./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/functions/constructor_hierarchy_mixed_chain.sol_0_no_adts_000.smt2 .


--------------------------------------------------------------------------------


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:26:03,323 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:26:03,361 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55057d11-ab20-40c8-84f1-804ffa6d9e97/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:26:03,364 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:26:03,364 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:26:03,377 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:26:03,378 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:26:03,378 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:26:03,378 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:26:03,378 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:26:03,378 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:26:03,378 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:26:03,378 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:26:03,378 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:26:03,378 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:26:03,379 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:26:03,379 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:26:03,379 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:26:03,379 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:26:03,379 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:26:03,379 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:26:03,379 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:26:03,379 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:26:03,379 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:26:03,379 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:26:03,380 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:26:03,380 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:26:03,560 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:26:03,568 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:26:03,570 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:26:03,571 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:26:03,571 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:26:03,572 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55057d11-ab20-40c8-84f1-804ffa6d9e97/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/functions/constructor_hierarchy_mixed_chain.sol_0_no_adts_000.smt2
[2025-05-07 17:26:03,574 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:26:03,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:26:03,831 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_55057d11-ab20-40c8-84f1-804ffa6d9e97/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/functions/constructor_hierarchy_mixed_chain.sol_0_no_adts_000.smt2
[2025-05-07 17:26:03,833 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:26:03,834 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:26:03,835 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:26:03,835 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:26:03,835 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:26:03,837 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:26:03" (1/1) ...
[2025-05-07 17:26:03,867 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:03 Unit
[2025-05-07 17:26:03,867 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:26:03,868 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:26:03,868 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:26:03,868 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:26:03,879 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:03" (1/1) ...
[2025-05-07 17:26:03,879 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:03" (1/1) ...
[2025-05-07 17:26:03,903 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:03" (1/1) ...
[2025-05-07 17:26:03,903 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:03" (1/1) ...
[2025-05-07 17:26:03,909 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:03" (1/1) ...
[2025-05-07 17:26:03,910 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:03" (1/1) ...
[2025-05-07 17:26:03,912 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:03" (1/1) ...
[2025-05-07 17:26:03,915 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:03" (1/1) ...
[2025-05-07 17:26:03,916 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:03" (1/1) ...
[2025-05-07 17:26:03,927 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:26:03,927 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:26:03,927 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:26:03,927 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:26:03,928 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:03" (1/1) ...
[2025-05-07 17:26:03,930 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:26:03,939 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:26:03,947 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-05-07 17:26:03,949 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:26:03,956 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:26:03,956 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:26:03,957 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:26:03,957 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_3_0 given in one single declaration
[2025-05-07 17:26:03,957 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_3_0
[2025-05-07 17:26:03,957 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_3_0
[2025-05-07 17:26:03,957 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_26_A_60_0 given in one single declaration
[2025-05-07 17:26:03,957 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_26_A_60_0
[2025-05-07 17:26:03,957 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_26_A_60_0
[2025-05-07 17:26:03,957 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_113_A_60_0 given in one single declaration
[2025-05-07 17:26:03,957 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_113_A_60_0
[2025-05-07 17:26:03,957 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_113_A_60_0
[2025-05-07 17:26:03,957 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_115_A_60_0 given in one single declaration
[2025-05-07 17:26:03,957 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_115_A_60_0
[2025-05-07 17:26:03,957 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_115_A_60_0
[2025-05-07 17:26:03,957 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_114_A_60_0 given in one single declaration
[2025-05-07 17:26:03,957 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_114_A_60_0
[2025-05-07 17:26:03,957 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_114_A_60_0
[2025-05-07 17:26:03,957 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_30_constructor_59_60_0 given in one single declaration
[2025-05-07 17:26:03,957 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_30_constructor_59_60_0
[2025-05-07 17:26:03,958 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_30_constructor_59_60_0
[2025-05-07 17:26:03,958 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_110_return_constructor_59_60_0 given in one single declaration
[2025-05-07 17:26:03,958 INFO  L130     BoogieDeclarations]: Found specification of procedure block_110_return_constructor_59_60_0
[2025-05-07 17:26:03,958 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_110_return_constructor_59_60_0
[2025-05-07 17:26:03,958 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_109__58_60_0 given in one single declaration
[2025-05-07 17:26:03,958 INFO  L130     BoogieDeclarations]: Found specification of procedure block_109__58_60_0
[2025-05-07 17:26:03,958 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_109__58_60_0
[2025-05-07 17:26:03,958 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_108_constructor_59_60_0 given in one single declaration
[2025-05-07 17:26:03,958 INFO  L130     BoogieDeclarations]: Found specification of procedure block_108_constructor_59_60_0
[2025-05-07 17:26:03,958 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_108_constructor_59_60_0
[2025-05-07 17:26:03,958 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_112_constructor_59_60_0 given in one single declaration
[2025-05-07 17:26:03,958 INFO  L130     BoogieDeclarations]: Found specification of procedure block_112_constructor_59_60_0
[2025-05-07 17:26:03,958 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_112_constructor_59_60_0
[2025-05-07 17:26:03,958 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_111_constructor_59_60_0 given in one single declaration
[2025-05-07 17:26:03,958 INFO  L130     BoogieDeclarations]: Found specification of procedure block_111_constructor_59_60_0
[2025-05-07 17:26:03,958 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_111_constructor_59_60_0
[2025-05-07 17:26:03,958 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_122_C_28_0 given in one single declaration
[2025-05-07 17:26:03,958 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_122_C_28_0
[2025-05-07 17:26:03,958 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_122_C_28_0
[2025-05-07 17:26:03,958 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_124_C_28_0 given in one single declaration
[2025-05-07 17:26:03,959 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_124_C_28_0
[2025-05-07 17:26:03,959 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_124_C_28_0
[2025-05-07 17:26:03,959 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_123_C_28_0 given in one single declaration
[2025-05-07 17:26:03,959 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_123_C_28_0
[2025-05-07 17:26:03,959 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_123_C_28_0
[2025-05-07 17:26:03,959 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_119_B_39_0 given in one single declaration
[2025-05-07 17:26:03,959 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_119_B_39_0
[2025-05-07 17:26:03,959 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_119_B_39_0
[2025-05-07 17:26:03,959 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_29_constructor_38_60_0 given in one single declaration
[2025-05-07 17:26:03,959 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_29_constructor_38_60_0
[2025-05-07 17:26:03,959 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_29_constructor_38_60_0
[2025-05-07 17:26:03,959 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_118_return_constructor_38_60_0 given in one single declaration
[2025-05-07 17:26:03,959 INFO  L130     BoogieDeclarations]: Found specification of procedure block_118_return_constructor_38_60_0
[2025-05-07 17:26:03,959 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_118_return_constructor_38_60_0
[2025-05-07 17:26:03,959 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_117__37_60_0 given in one single declaration
[2025-05-07 17:26:03,959 INFO  L130     BoogieDeclarations]: Found specification of procedure block_117__37_60_0
[2025-05-07 17:26:03,959 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_117__37_60_0
[2025-05-07 17:26:03,959 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_116_constructor_38_60_0 given in one single declaration
[2025-05-07 17:26:03,959 INFO  L130     BoogieDeclarations]: Found specification of procedure block_116_constructor_38_60_0
[2025-05-07 17:26:03,959 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_116_constructor_38_60_0
[2025-05-07 17:26:03,959 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_121_B_39_0 given in one single declaration
[2025-05-07 17:26:03,960 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_121_B_39_0
[2025-05-07 17:26:03,960 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_121_B_39_0
[2025-05-07 17:26:03,960 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_120_B_39_0 given in one single declaration
[2025-05-07 17:26:03,960 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_120_B_39_0
[2025-05-07 17:26:03,960 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_120_B_39_0
[2025-05-07 17:26:03,960 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_128_D_25_0 given in one single declaration
[2025-05-07 17:26:03,960 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_128_D_25_0
[2025-05-07 17:26:03,960 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_128_D_25_0
[2025-05-07 17:26:03,960 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_28_constructor_24_60_0 given in one single declaration
[2025-05-07 17:26:03,960 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_28_constructor_24_60_0
[2025-05-07 17:26:03,960 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_28_constructor_24_60_0
[2025-05-07 17:26:03,960 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_127_return_constructor_24_60_0 given in one single declaration
[2025-05-07 17:26:03,960 INFO  L130     BoogieDeclarations]: Found specification of procedure block_127_return_constructor_24_60_0
[2025-05-07 17:26:03,960 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_127_return_constructor_24_60_0
[2025-05-07 17:26:03,960 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_126__23_60_0 given in one single declaration
[2025-05-07 17:26:03,960 INFO  L130     BoogieDeclarations]: Found specification of procedure block_126__23_60_0
[2025-05-07 17:26:03,960 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_126__23_60_0
[2025-05-07 17:26:03,960 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_125_constructor_24_60_0 given in one single declaration
[2025-05-07 17:26:03,960 INFO  L130     BoogieDeclarations]: Found specification of procedure block_125_constructor_24_60_0
[2025-05-07 17:26:03,960 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_125_constructor_24_60_0
[2025-05-07 17:26:03,960 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_130_D_25_0 given in one single declaration
[2025-05-07 17:26:03,960 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_130_D_25_0
[2025-05-07 17:26:03,961 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_130_D_25_0
[2025-05-07 17:26:03,961 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_129_D_25_0 given in one single declaration
[2025-05-07 17:26:03,961 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_129_D_25_0
[2025-05-07 17:26:03,961 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_129_D_25_0
[2025-05-07 17:26:03,961 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_140_A_60_0 given in one single declaration
[2025-05-07 17:26:03,961 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_140_A_60_0
[2025-05-07 17:26:03,961 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_140_A_60_0
[2025-05-07 17:26:03,961 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_137_F_11_0 given in one single declaration
[2025-05-07 17:26:03,961 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_137_F_11_0
[2025-05-07 17:26:03,961 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_137_F_11_0
[2025-05-07 17:26:03,961 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_27_constructor_10_60_0 given in one single declaration
[2025-05-07 17:26:03,961 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_27_constructor_10_60_0
[2025-05-07 17:26:03,961 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_27_constructor_10_60_0
[2025-05-07 17:26:03,961 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_136_return_constructor_10_60_0 given in one single declaration
[2025-05-07 17:26:03,961 INFO  L130     BoogieDeclarations]: Found specification of procedure block_136_return_constructor_10_60_0
[2025-05-07 17:26:03,961 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_136_return_constructor_10_60_0
[2025-05-07 17:26:03,961 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_135__9_60_0 given in one single declaration
[2025-05-07 17:26:03,961 INFO  L130     BoogieDeclarations]: Found specification of procedure block_135__9_60_0
[2025-05-07 17:26:03,961 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_135__9_60_0
[2025-05-07 17:26:03,961 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_134_constructor_10_60_0 given in one single declaration
[2025-05-07 17:26:03,961 INFO  L130     BoogieDeclarations]: Found specification of procedure block_134_constructor_10_60_0
[2025-05-07 17:26:03,961 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_134_constructor_10_60_0
[2025-05-07 17:26:03,961 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_139_F_11_0 given in one single declaration
[2025-05-07 17:26:03,961 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_139_F_11_0
[2025-05-07 17:26:03,962 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_139_F_11_0
[2025-05-07 17:26:03,962 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_138_F_11_0 given in one single declaration
[2025-05-07 17:26:03,962 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_138_F_11_0
[2025-05-07 17:26:03,962 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_138_F_11_0
[2025-05-07 17:26:03,962 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_131_E_14_0 given in one single declaration
[2025-05-07 17:26:03,962 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_131_E_14_0
[2025-05-07 17:26:03,962 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_131_E_14_0
[2025-05-07 17:26:03,962 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_133_E_14_0 given in one single declaration
[2025-05-07 17:26:03,962 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_133_E_14_0
[2025-05-07 17:26:03,962 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_133_E_14_0
[2025-05-07 17:26:03,962 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_132_E_14_0 given in one single declaration
[2025-05-07 17:26:03,962 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_132_E_14_0
[2025-05-07 17:26:03,962 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_132_E_14_0
[2025-05-07 17:26:03,962 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:26:03,962 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:26:03,962 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:26:04,177 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:26:04,179 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:26:04,449 INFO  L?                        ?]: Removed 374 outVars from TransFormulas that were not future-live.
[2025-05-07 17:26:04,449 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:26:04,459 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:26:04,459 INFO  L312             CfgBuilder]: Removed 19 assume(true) statements.
[2025-05-07 17:26:04,460 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:26:04 BoogieIcfgContainer
[2025-05-07 17:26:04,460 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:26:04,461 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:26:04,461 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:26:04,464 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:26:04,464 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:26:03" (1/3) ...
[2025-05-07 17:26:04,464 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497ddad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:26:04, skipping insertion in model container
[2025-05-07 17:26:04,464 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:03" (2/3) ...
[2025-05-07 17:26:04,464 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497ddad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:26:04, skipping insertion in model container
[2025-05-07 17:26:04,465 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:26:04" (3/3) ...
[2025-05-07 17:26:04,465 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:26:04,476 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:26:04,478 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 41 procedures, 182 locations, 307 edges, 41 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:26:04,508 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:26:04,516 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4671af0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:26:04,516 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:26:04,519 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 182 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 76 states have internal predecessors, (76), 75 states have call successors, (77), 40 states have call predecessors, (77), 40 states have return successors, (77), 65 states have call predecessors, (77), 75 states have call successors, (77)
[2025-05-07 17:26:04,527 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:26:04,528 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:04,528 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:04,528 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:04,532 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:04,532 INFO  L85        PathProgramCache]: Analyzing trace with hash 677640696, now seen corresponding path program 1 times
[2025-05-07 17:26:04,537 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:04,537 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794494573]
[2025-05-07 17:26:04,537 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:04,538 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:04,572 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:26:04,620 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:26:04,620 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:04,620 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:04,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:26:04,783 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:04,783 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794494573]
[2025-05-07 17:26:04,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794494573] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:04,784 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:04,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:26:04,787 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719166028]
[2025-05-07 17:26:04,787 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:04,790 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:26:04,790 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:04,810 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:26:04,810 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:04,813 INFO  L87              Difference]: Start difference. First operand  has 182 states, 65 states have (on average 1.1692307692307693) internal successors, (76), 76 states have internal predecessors, (76), 75 states have call successors, (77), 40 states have call predecessors, (77), 40 states have return successors, (77), 65 states have call predecessors, (77), 75 states have call successors, (77) Second operand  has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:26:04,923 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:04,924 INFO  L93              Difference]: Finished difference Result 180 states and 227 transitions.
[2025-05-07 17:26:04,925 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:26:04,926 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 41
[2025-05-07 17:26:04,926 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:04,932 INFO  L225             Difference]: With dead ends: 180
[2025-05-07 17:26:04,932 INFO  L226             Difference]: Without dead ends: 178
[2025-05-07 17:26:04,934 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:04,936 INFO  L437           NwaCegarLoop]: 224 mSDtfsCounter, 0 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:04,936 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1101 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:04,947 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 178 states.
[2025-05-07 17:26:04,969 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178.
[2025-05-07 17:26:04,970 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 178 states, 64 states have (on average 1.140625) internal successors, (73), 73 states have internal predecessors, (73), 73 states have call successors, (75), 40 states have call predecessors, (75), 40 states have return successors, (75), 64 states have call predecessors, (75), 73 states have call successors, (75)
[2025-05-07 17:26:04,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 223 transitions.
[2025-05-07 17:26:04,974 INFO  L79                 Accepts]: Start accepts. Automaton has 178 states and 223 transitions. Word has length 41
[2025-05-07 17:26:04,975 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:04,975 INFO  L485      AbstractCegarLoop]: Abstraction has 178 states and 223 transitions.
[2025-05-07 17:26:04,975 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:26:04,975 INFO  L278                IsEmpty]: Start isEmpty. Operand 178 states and 223 transitions.
[2025-05-07 17:26:04,977 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:26:04,977 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:04,977 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:04,977 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:26:04,978 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:04,978 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:04,978 INFO  L85        PathProgramCache]: Analyzing trace with hash -1243570575, now seen corresponding path program 1 times
[2025-05-07 17:26:04,978 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:04,978 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923866651]
[2025-05-07 17:26:04,978 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:04,978 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:05,005 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:26:05,027 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:26:05,027 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:05,027 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:05,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:26:05,125 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:05,125 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923866651]
[2025-05-07 17:26:05,125 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923866651] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:05,125 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:05,125 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:26:05,125 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729676880]
[2025-05-07 17:26:05,125 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:05,126 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:26:05,126 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:05,127 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:26:05,127 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:05,127 INFO  L87              Difference]: Start difference. First operand 178 states and 223 transitions. Second operand  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:26:05,225 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:05,225 INFO  L93              Difference]: Finished difference Result 178 states and 220 transitions.
[2025-05-07 17:26:05,225 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:26:05,225 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:26:05,226 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:05,227 INFO  L225             Difference]: With dead ends: 178
[2025-05-07 17:26:05,227 INFO  L226             Difference]: Without dead ends: 177
[2025-05-07 17:26:05,227 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:05,227 INFO  L437           NwaCegarLoop]: 210 mSDtfsCounter, 1 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:05,228 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1010 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:26:05,228 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 177 states.
[2025-05-07 17:26:05,236 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175.
[2025-05-07 17:26:05,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 175 states, 64 states have (on average 1.125) internal successors, (72), 72 states have internal predecessors, (72), 70 states have call successors, (72), 40 states have call predecessors, (72), 40 states have return successors, (72), 62 states have call predecessors, (72), 70 states have call successors, (72)
[2025-05-07 17:26:05,237 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions.
[2025-05-07 17:26:05,238 INFO  L79                 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 51
[2025-05-07 17:26:05,238 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:05,238 INFO  L485      AbstractCegarLoop]: Abstraction has 175 states and 216 transitions.
[2025-05-07 17:26:05,238 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:26:05,238 INFO  L278                IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions.
[2025-05-07 17:26:05,239 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:26:05,239 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:05,239 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:05,239 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:26:05,239 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:05,240 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:05,240 INFO  L85        PathProgramCache]: Analyzing trace with hash -398094220, now seen corresponding path program 1 times
[2025-05-07 17:26:05,240 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:05,240 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101501336]
[2025-05-07 17:26:05,240 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:05,240 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:05,256 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:26:05,259 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:26:05,259 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:05,260 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:05,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:26:05,298 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:05,298 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101501336]
[2025-05-07 17:26:05,298 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101501336] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:05,298 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:05,299 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:05,299 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557416199]
[2025-05-07 17:26:05,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:05,299 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:05,299 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:05,300 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:05,300 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:05,300 INFO  L87              Difference]: Start difference. First operand 175 states and 216 transitions. Second operand  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:26:05,359 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:05,359 INFO  L93              Difference]: Finished difference Result 176 states and 215 transitions.
[2025-05-07 17:26:05,360 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:05,360 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 41
[2025-05-07 17:26:05,360 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:05,361 INFO  L225             Difference]: With dead ends: 176
[2025-05-07 17:26:05,361 INFO  L226             Difference]: Without dead ends: 175
[2025-05-07 17:26:05,361 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:05,362 INFO  L437           NwaCegarLoop]: 207 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:05,362 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 586 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:05,363 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 175 states.
[2025-05-07 17:26:05,370 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173.
[2025-05-07 17:26:05,370 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 173 states, 64 states have (on average 1.109375) internal successors, (71), 71 states have internal predecessors, (71), 68 states have call successors, (70), 40 states have call predecessors, (70), 40 states have return successors, (70), 61 states have call predecessors, (70), 68 states have call successors, (70)
[2025-05-07 17:26:05,371 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 211 transitions.
[2025-05-07 17:26:05,371 INFO  L79                 Accepts]: Start accepts. Automaton has 173 states and 211 transitions. Word has length 41
[2025-05-07 17:26:05,371 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:05,371 INFO  L485      AbstractCegarLoop]: Abstraction has 173 states and 211 transitions.
[2025-05-07 17:26:05,371 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:26:05,371 INFO  L278                IsEmpty]: Start isEmpty. Operand 173 states and 211 transitions.
[2025-05-07 17:26:05,373 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-05-07 17:26:05,373 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:05,373 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:05,373 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:26:05,373 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:05,373 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:05,373 INFO  L85        PathProgramCache]: Analyzing trace with hash -1254698306, now seen corresponding path program 1 times
[2025-05-07 17:26:05,373 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:05,373 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401342266]
[2025-05-07 17:26:05,373 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:05,374 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:05,400 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-05-07 17:26:05,414 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-05-07 17:26:05,414 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:05,414 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:05,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:26:05,477 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:05,477 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401342266]
[2025-05-07 17:26:05,477 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401342266] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:05,477 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:05,477 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:05,477 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72923996]
[2025-05-07 17:26:05,477 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:05,478 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:05,478 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:05,479 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:05,479 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:05,479 INFO  L87              Difference]: Start difference. First operand 173 states and 211 transitions. Second operand  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21)
[2025-05-07 17:26:05,535 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:05,535 INFO  L93              Difference]: Finished difference Result 177 states and 218 transitions.
[2025-05-07 17:26:05,535 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:05,535 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 76
[2025-05-07 17:26:05,536 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:05,536 INFO  L225             Difference]: With dead ends: 177
[2025-05-07 17:26:05,537 INFO  L226             Difference]: Without dead ends: 177
[2025-05-07 17:26:05,537 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:05,537 INFO  L437           NwaCegarLoop]: 206 mSDtfsCounter, 1 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:05,537 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 584 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:05,538 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 177 states.
[2025-05-07 17:26:05,545 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175.
[2025-05-07 17:26:05,546 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 175 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 72 states have internal predecessors, (72), 68 states have call successors, (70), 40 states have call predecessors, (70), 41 states have return successors, (74), 62 states have call predecessors, (74), 68 states have call successors, (74)
[2025-05-07 17:26:05,547 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions.
[2025-05-07 17:26:05,547 INFO  L79                 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 76
[2025-05-07 17:26:05,547 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:05,547 INFO  L485      AbstractCegarLoop]: Abstraction has 175 states and 216 transitions.
[2025-05-07 17:26:05,547 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21)
[2025-05-07 17:26:05,547 INFO  L278                IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions.
[2025-05-07 17:26:05,548 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-05-07 17:26:05,548 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:05,549 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:05,549 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:26:05,549 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:05,549 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:05,549 INFO  L85        PathProgramCache]: Analyzing trace with hash -176224454, now seen corresponding path program 1 times
[2025-05-07 17:26:05,549 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:05,550 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613805767]
[2025-05-07 17:26:05,550 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:05,550 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:05,576 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-05-07 17:26:05,590 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-05-07 17:26:05,590 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:05,590 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:05,665 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:26:05,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:05,666 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613805767]
[2025-05-07 17:26:05,666 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613805767] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:05,666 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:05,666 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:26:05,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829019936]
[2025-05-07 17:26:05,666 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:05,666 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:26:05,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:05,667 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:26:05,667 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:05,667 INFO  L87              Difference]: Start difference. First operand 175 states and 216 transitions. Second operand  has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 6 states have call predecessors, (21), 3 states have call successors, (21)
[2025-05-07 17:26:05,708 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:05,708 INFO  L93              Difference]: Finished difference Result 173 states and 209 transitions.
[2025-05-07 17:26:05,708 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:26:05,708 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 6 states have call predecessors, (21), 3 states have call successors, (21) Word has length 76
[2025-05-07 17:26:05,709 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:05,709 INFO  L225             Difference]: With dead ends: 173
[2025-05-07 17:26:05,709 INFO  L226             Difference]: Without dead ends: 167
[2025-05-07 17:26:05,709 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:05,710 INFO  L437           NwaCegarLoop]: 206 mSDtfsCounter, 0 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:05,710 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1013 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:05,711 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 167 states.
[2025-05-07 17:26:05,715 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167.
[2025-05-07 17:26:05,715 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 167 states, 64 states have (on average 1.078125) internal successors, (69), 69 states have internal predecessors, (69), 62 states have call successors, (64), 40 states have call predecessors, (64), 40 states have return successors, (64), 57 states have call predecessors, (64), 62 states have call successors, (64)
[2025-05-07 17:26:05,716 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 197 transitions.
[2025-05-07 17:26:05,716 INFO  L79                 Accepts]: Start accepts. Automaton has 167 states and 197 transitions. Word has length 76
[2025-05-07 17:26:05,716 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:05,716 INFO  L485      AbstractCegarLoop]: Abstraction has 167 states and 197 transitions.
[2025-05-07 17:26:05,717 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 6 states have call predecessors, (21), 3 states have call successors, (21)
[2025-05-07 17:26:05,717 INFO  L278                IsEmpty]: Start isEmpty. Operand 167 states and 197 transitions.
[2025-05-07 17:26:05,717 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2025-05-07 17:26:05,717 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:05,718 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:05,718 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:26:05,718 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:05,718 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:05,718 INFO  L85        PathProgramCache]: Analyzing trace with hash 1710154467, now seen corresponding path program 1 times
[2025-05-07 17:26:05,718 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:05,718 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211179203]
[2025-05-07 17:26:05,718 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:05,718 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:05,740 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes.
[2025-05-07 17:26:05,754 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements.
[2025-05-07 17:26:05,754 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:05,754 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:05,828 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:26:05,828 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:05,828 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211179203]
[2025-05-07 17:26:05,828 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211179203] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:05,828 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:05,828 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:26:05,828 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430058540]
[2025-05-07 17:26:05,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:05,829 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:26:05,829 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:05,830 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:26:05,830 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:05,830 INFO  L87              Difference]: Start difference. First operand 167 states and 197 transitions. Second operand  has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (24), 1 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24)
[2025-05-07 17:26:05,883 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:05,883 INFO  L93              Difference]: Finished difference Result 165 states and 190 transitions.
[2025-05-07 17:26:05,883 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:26:05,884 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (24), 1 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24) Word has length 86
[2025-05-07 17:26:05,884 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:05,885 INFO  L225             Difference]: With dead ends: 165
[2025-05-07 17:26:05,885 INFO  L226             Difference]: Without dead ends: 164
[2025-05-07 17:26:05,885 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:05,886 INFO  L437           NwaCegarLoop]: 182 mSDtfsCounter, 1 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:05,886 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 884 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:05,887 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 164 states.
[2025-05-07 17:26:05,893 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162.
[2025-05-07 17:26:05,893 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 162 states, 64 states have (on average 1.0625) internal successors, (68), 68 states have internal predecessors, (68), 57 states have call successors, (59), 40 states have call predecessors, (59), 40 states have return successors, (59), 53 states have call predecessors, (59), 57 states have call successors, (59)
[2025-05-07 17:26:05,894 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 186 transitions.
[2025-05-07 17:26:05,894 INFO  L79                 Accepts]: Start accepts. Automaton has 162 states and 186 transitions. Word has length 86
[2025-05-07 17:26:05,894 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:05,894 INFO  L485      AbstractCegarLoop]: Abstraction has 162 states and 186 transitions.
[2025-05-07 17:26:05,894 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (24), 1 states have call predecessors, (24), 5 states have return successors, (24), 4 states have call predecessors, (24), 3 states have call successors, (24)
[2025-05-07 17:26:05,894 INFO  L278                IsEmpty]: Start isEmpty. Operand 162 states and 186 transitions.
[2025-05-07 17:26:05,895 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-05-07 17:26:05,895 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:05,896 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:05,896 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:26:05,896 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:05,896 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:05,896 INFO  L85        PathProgramCache]: Analyzing trace with hash -1913664427, now seen corresponding path program 1 times
[2025-05-07 17:26:05,896 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:05,897 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690353080]
[2025-05-07 17:26:05,897 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:05,897 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:05,938 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-05-07 17:26:05,949 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-05-07 17:26:05,949 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:05,949 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:06,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:26:06,011 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:06,011 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690353080]
[2025-05-07 17:26:06,011 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690353080] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:06,011 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:06,011 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:06,011 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642411680]
[2025-05-07 17:26:06,011 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:06,012 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:06,012 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:06,012 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:06,012 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:06,012 INFO  L87              Difference]: Start difference. First operand 162 states and 186 transitions. Second operand  has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (31), 1 states have call predecessors, (31), 3 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31)
[2025-05-07 17:26:06,043 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:06,044 INFO  L93              Difference]: Finished difference Result 166 states and 191 transitions.
[2025-05-07 17:26:06,044 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:06,044 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (31), 1 states have call predecessors, (31), 3 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31) Word has length 111
[2025-05-07 17:26:06,044 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:06,045 INFO  L225             Difference]: With dead ends: 166
[2025-05-07 17:26:06,045 INFO  L226             Difference]: Without dead ends: 166
[2025-05-07 17:26:06,045 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:06,046 INFO  L437           NwaCegarLoop]: 183 mSDtfsCounter, 1 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:06,046 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 526 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:06,047 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 166 states.
[2025-05-07 17:26:06,050 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164.
[2025-05-07 17:26:06,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 164 states, 65 states have (on average 1.0615384615384615) internal successors, (69), 69 states have internal predecessors, (69), 57 states have call successors, (59), 40 states have call predecessors, (59), 41 states have return successors, (61), 54 states have call predecessors, (61), 57 states have call successors, (61)
[2025-05-07 17:26:06,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 189 transitions.
[2025-05-07 17:26:06,051 INFO  L79                 Accepts]: Start accepts. Automaton has 164 states and 189 transitions. Word has length 111
[2025-05-07 17:26:06,052 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:06,052 INFO  L485      AbstractCegarLoop]: Abstraction has 164 states and 189 transitions.
[2025-05-07 17:26:06,052 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 4 states have call successors, (31), 1 states have call predecessors, (31), 3 states have return successors, (31), 4 states have call predecessors, (31), 4 states have call successors, (31)
[2025-05-07 17:26:06,052 INFO  L278                IsEmpty]: Start isEmpty. Operand 164 states and 189 transitions.
[2025-05-07 17:26:06,053 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-05-07 17:26:06,053 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:06,053 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:06,053 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:26:06,053 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:06,054 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:06,054 INFO  L85        PathProgramCache]: Analyzing trace with hash 1410712665, now seen corresponding path program 1 times
[2025-05-07 17:26:06,054 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:06,054 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423412951]
[2025-05-07 17:26:06,054 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:06,054 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:06,088 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-05-07 17:26:06,107 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-05-07 17:26:06,107 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:06,107 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:06,211 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:26:06,211 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:06,211 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423412951]
[2025-05-07 17:26:06,211 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423412951] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:06,211 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:06,211 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:26:06,211 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045220944]
[2025-05-07 17:26:06,211 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:06,212 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:26:06,212 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:06,212 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:26:06,212 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:06,213 INFO  L87              Difference]: Start difference. First operand 164 states and 189 transitions. Second operand  has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (31), 1 states have call predecessors, (31), 5 states have return successors, (31), 6 states have call predecessors, (31), 4 states have call successors, (31)
[2025-05-07 17:26:06,247 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:06,247 INFO  L93              Difference]: Finished difference Result 159 states and 178 transitions.
[2025-05-07 17:26:06,248 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:26:06,248 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (31), 1 states have call predecessors, (31), 5 states have return successors, (31), 6 states have call predecessors, (31), 4 states have call successors, (31) Word has length 111
[2025-05-07 17:26:06,248 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:06,250 INFO  L225             Difference]: With dead ends: 159
[2025-05-07 17:26:06,250 INFO  L226             Difference]: Without dead ends: 154
[2025-05-07 17:26:06,250 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:06,250 INFO  L437           NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:06,251 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 860 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:06,251 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 154 states.
[2025-05-07 17:26:06,256 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154.
[2025-05-07 17:26:06,257 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 154 states, 64 states have (on average 1.03125) internal successors, (66), 66 states have internal predecessors, (66), 49 states have call successors, (51), 40 states have call predecessors, (51), 40 states have return successors, (51), 47 states have call predecessors, (51), 49 states have call successors, (51)
[2025-05-07 17:26:06,258 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions.
[2025-05-07 17:26:06,258 INFO  L79                 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 111
[2025-05-07 17:26:06,258 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:06,258 INFO  L485      AbstractCegarLoop]: Abstraction has 154 states and 168 transitions.
[2025-05-07 17:26:06,258 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 4 states have call successors, (31), 1 states have call predecessors, (31), 5 states have return successors, (31), 6 states have call predecessors, (31), 4 states have call successors, (31)
[2025-05-07 17:26:06,258 INFO  L278                IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions.
[2025-05-07 17:26:06,260 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2025-05-07 17:26:06,260 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:06,260 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:06,260 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:26:06,260 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:06,261 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:06,261 INFO  L85        PathProgramCache]: Analyzing trace with hash -779782781, now seen corresponding path program 1 times
[2025-05-07 17:26:06,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:06,261 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889424303]
[2025-05-07 17:26:06,261 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:06,261 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:06,307 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-05-07 17:26:06,310 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-05-07 17:26:06,310 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:06,310 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:06,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:26:06,395 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:06,395 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889424303]
[2025-05-07 17:26:06,396 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889424303] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:06,396 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:06,396 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:06,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909013166]
[2025-05-07 17:26:06,396 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:06,396 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:06,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:06,397 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:06,397 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:06,397 INFO  L87              Difference]: Start difference. First operand 154 states and 168 transitions. Second operand  has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (38), 1 states have call predecessors, (38), 3 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38)
[2025-05-07 17:26:06,403 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:06,403 INFO  L93              Difference]: Finished difference Result 156 states and 169 transitions.
[2025-05-07 17:26:06,404 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:06,404 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (38), 1 states have call predecessors, (38), 3 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 136
[2025-05-07 17:26:06,404 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:06,405 INFO  L225             Difference]: With dead ends: 156
[2025-05-07 17:26:06,405 INFO  L226             Difference]: Without dead ends: 147
[2025-05-07 17:26:06,405 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:06,405 INFO  L437           NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:06,406 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 491 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:06,406 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 147 states.
[2025-05-07 17:26:06,408 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147.
[2025-05-07 17:26:06,408 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 147 states, 64 states have (on average 1.015625) internal successors, (65), 65 states have internal predecessors, (65), 42 states have call successors, (44), 40 states have call predecessors, (44), 40 states have return successors, (44), 41 states have call predecessors, (44), 42 states have call successors, (44)
[2025-05-07 17:26:06,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 153 transitions.
[2025-05-07 17:26:06,409 INFO  L79                 Accepts]: Start accepts. Automaton has 147 states and 153 transitions. Word has length 136
[2025-05-07 17:26:06,409 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:06,409 INFO  L485      AbstractCegarLoop]: Abstraction has 147 states and 153 transitions.
[2025-05-07 17:26:06,409 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 3 states have call successors, (38), 1 states have call predecessors, (38), 3 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38)
[2025-05-07 17:26:06,409 INFO  L278                IsEmpty]: Start isEmpty. Operand 147 states and 153 transitions.
[2025-05-07 17:26:06,410 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2025-05-07 17:26:06,410 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:06,411 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:06,411 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:26:06,411 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:06,411 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:06,411 INFO  L85        PathProgramCache]: Analyzing trace with hash 1466372062, now seen corresponding path program 1 times
[2025-05-07 17:26:06,411 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:06,411 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879831877]
[2025-05-07 17:26:06,411 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:06,411 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:06,451 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-05-07 17:26:06,463 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-05-07 17:26:06,464 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:06,464 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:06,538 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:26:06,538 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:06,538 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879831877]
[2025-05-07 17:26:06,538 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879831877] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:06,538 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:06,538 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:06,538 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722288303]
[2025-05-07 17:26:06,539 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:06,539 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:06,539 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:06,539 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:06,540 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:06,540 INFO  L87              Difference]: Start difference. First operand 147 states and 153 transitions. Second operand  has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (38), 1 states have call predecessors, (38), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38)
[2025-05-07 17:26:06,553 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:06,553 INFO  L93              Difference]: Finished difference Result 149 states and 154 transitions.
[2025-05-07 17:26:06,553 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:06,553 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (38), 1 states have call predecessors, (38), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38) Word has length 136
[2025-05-07 17:26:06,554 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:06,554 INFO  L225             Difference]: With dead ends: 149
[2025-05-07 17:26:06,554 INFO  L226             Difference]: Without dead ends: 145
[2025-05-07 17:26:06,554 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:06,555 INFO  L437           NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:06,555 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 443 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:06,555 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2025-05-07 17:26:06,558 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145.
[2025-05-07 17:26:06,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 145 states, 64 states have (on average 1.0) internal successors, (64), 64 states have internal predecessors, (64), 40 states have call successors, (42), 40 states have call predecessors, (42), 40 states have return successors, (42), 40 states have call predecessors, (42), 40 states have call successors, (42)
[2025-05-07 17:26:06,559 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 148 transitions.
[2025-05-07 17:26:06,559 INFO  L79                 Accepts]: Start accepts. Automaton has 145 states and 148 transitions. Word has length 136
[2025-05-07 17:26:06,559 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:06,559 INFO  L485      AbstractCegarLoop]: Abstraction has 145 states and 148 transitions.
[2025-05-07 17:26:06,559 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 4 states have call successors, (38), 1 states have call predecessors, (38), 3 states have return successors, (38), 4 states have call predecessors, (38), 4 states have call successors, (38)
[2025-05-07 17:26:06,559 INFO  L278                IsEmpty]: Start isEmpty. Operand 145 states and 148 transitions.
[2025-05-07 17:26:06,567 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2025-05-07 17:26:06,568 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:06,568 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:06,568 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:26:06,568 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:06,568 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:06,569 INFO  L85        PathProgramCache]: Analyzing trace with hash -1468016414, now seen corresponding path program 1 times
[2025-05-07 17:26:06,569 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:06,569 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890020454]
[2025-05-07 17:26:06,569 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:06,569 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:06,609 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-05-07 17:26:06,631 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-05-07 17:26:06,631 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:06,631 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:06,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:26:06,765 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:06,765 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890020454]
[2025-05-07 17:26:06,765 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890020454] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:06,765 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:06,765 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:26:06,765 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277929029]
[2025-05-07 17:26:06,765 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:06,766 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:26:06,766 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:06,767 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:26:06,767 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:26:06,767 INFO  L87              Difference]: Start difference. First operand 145 states and 148 transitions. Second operand  has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 5 states have call successors, (38), 1 states have call predecessors, (38), 6 states have return successors, (38), 6 states have call predecessors, (38), 5 states have call successors, (38)
[2025-05-07 17:26:06,798 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:06,798 INFO  L93              Difference]: Finished difference Result 155 states and 161 transitions.
[2025-05-07 17:26:06,799 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:26:06,799 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 5 states have call successors, (38), 1 states have call predecessors, (38), 6 states have return successors, (38), 6 states have call predecessors, (38), 5 states have call successors, (38) Word has length 136
[2025-05-07 17:26:06,799 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:06,800 INFO  L225             Difference]: With dead ends: 155
[2025-05-07 17:26:06,800 INFO  L226             Difference]: Without dead ends: 141
[2025-05-07 17:26:06,800 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:26:06,801 INFO  L437           NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:06,801 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 913 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:06,801 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 141 states.
[2025-05-07 17:26:06,803 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141.
[2025-05-07 17:26:06,803 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 141 states, 62 states have (on average 1.0) internal successors, (62), 62 states have internal predecessors, (62), 39 states have call successors, (40), 39 states have call predecessors, (40), 39 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40)
[2025-05-07 17:26:06,804 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions.
[2025-05-07 17:26:06,804 INFO  L79                 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 136
[2025-05-07 17:26:06,805 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:06,805 INFO  L485      AbstractCegarLoop]: Abstraction has 141 states and 142 transitions.
[2025-05-07 17:26:06,805 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 5 states have call successors, (38), 1 states have call predecessors, (38), 6 states have return successors, (38), 6 states have call predecessors, (38), 5 states have call successors, (38)
[2025-05-07 17:26:06,805 INFO  L278                IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions.
[2025-05-07 17:26:06,806 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2025-05-07 17:26:06,806 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:06,806 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:06,806 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:26:06,806 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:06,807 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:06,807 INFO  L85        PathProgramCache]: Analyzing trace with hash 1521303356, now seen corresponding path program 1 times
[2025-05-07 17:26:06,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:06,807 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105553881]
[2025-05-07 17:26:06,807 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:06,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:06,847 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-05-07 17:26:06,879 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-05-07 17:26:06,879 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:06,879 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:07,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:26:07,031 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:07,031 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105553881]
[2025-05-07 17:26:07,032 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105553881] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:07,032 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:07,032 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:26:07,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720307832]
[2025-05-07 17:26:07,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:07,032 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:26:07,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:07,033 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:26:07,033 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:26:07,033 INFO  L87              Difference]: Start difference. First operand 141 states and 142 transitions. Second operand  has 7 states, 5 states have (on average 12.0) internal successors, (60), 7 states have internal predecessors, (60), 5 states have call successors, (38), 1 states have call predecessors, (38), 5 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38)
[2025-05-07 17:26:07,083 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:07,083 INFO  L93              Difference]: Finished difference Result 143 states and 143 transitions.
[2025-05-07 17:26:07,084 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:26:07,084 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 12.0) internal successors, (60), 7 states have internal predecessors, (60), 5 states have call successors, (38), 1 states have call predecessors, (38), 5 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38) Word has length 136
[2025-05-07 17:26:07,084 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:07,085 INFO  L225             Difference]: With dead ends: 143
[2025-05-07 17:26:07,085 INFO  L226             Difference]: Without dead ends: 137
[2025-05-07 17:26:07,085 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:26:07,085 INFO  L437           NwaCegarLoop]: 138 mSDtfsCounter, 2 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:07,086 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 811 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:07,086 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 137 states.
[2025-05-07 17:26:07,088 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137.
[2025-05-07 17:26:07,089 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 137 states, 60 states have (on average 1.0) internal successors, (60), 60 states have internal predecessors, (60), 38 states have call successors, (38), 38 states have call predecessors, (38), 38 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38)
[2025-05-07 17:26:07,089 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 136 transitions.
[2025-05-07 17:26:07,089 INFO  L79                 Accepts]: Start accepts. Automaton has 137 states and 136 transitions. Word has length 136
[2025-05-07 17:26:07,089 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:07,090 INFO  L485      AbstractCegarLoop]: Abstraction has 137 states and 136 transitions.
[2025-05-07 17:26:07,090 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 12.0) internal successors, (60), 7 states have internal predecessors, (60), 5 states have call successors, (38), 1 states have call predecessors, (38), 5 states have return successors, (38), 5 states have call predecessors, (38), 5 states have call successors, (38)
[2025-05-07 17:26:07,090 INFO  L278                IsEmpty]: Start isEmpty. Operand 137 states and 136 transitions.
[2025-05-07 17:26:07,091 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2025-05-07 17:26:07,091 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:07,091 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:07,091 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-05-07 17:26:07,091 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:07,091 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:07,092 INFO  L85        PathProgramCache]: Analyzing trace with hash -898785346, now seen corresponding path program 1 times
[2025-05-07 17:26:07,092 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:07,092 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958050914]
[2025-05-07 17:26:07,092 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:07,092 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:07,127 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-05-07 17:26:07,146 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-05-07 17:26:07,147 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:07,147 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:07,567 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:26:07,567 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:07,567 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958050914]
[2025-05-07 17:26:07,568 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958050914] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:07,568 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:07,568 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:26:07,568 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090221912]
[2025-05-07 17:26:07,568 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:07,568 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:26:07,568 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:07,568 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:26:07,568 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:26:07,569 INFO  L87              Difference]: Start difference. First operand 137 states and 136 transitions. Second operand  has 14 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 7 states have call successors, (38), 1 states have call predecessors, (38), 11 states have return successors, (38), 12 states have call predecessors, (38), 7 states have call successors, (38)
[2025-05-07 17:26:07,674 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:07,674 INFO  L93              Difference]: Finished difference Result 90 states and 89 transitions.
[2025-05-07 17:26:07,674 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:26:07,675 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 7 states have call successors, (38), 1 states have call predecessors, (38), 11 states have return successors, (38), 12 states have call predecessors, (38), 7 states have call successors, (38) Word has length 136
[2025-05-07 17:26:07,675 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:07,675 INFO  L225             Difference]: With dead ends: 90
[2025-05-07 17:26:07,675 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:26:07,676 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240
[2025-05-07 17:26:07,676 INFO  L437           NwaCegarLoop]: 81 mSDtfsCounter, 2 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1024 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:07,676 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1024 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:26:07,677 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:26:07,677 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:26:07,677 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-05-07 17:26:07,677 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:26:07,677 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 136
[2025-05-07 17:26:07,677 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:07,677 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:26:07,677 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 7 states have call successors, (38), 1 states have call predecessors, (38), 11 states have return successors, (38), 12 states have call predecessors, (38), 7 states have call successors, (38)
[2025-05-07 17:26:07,678 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:26:07,678 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:26:07,680 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:26:07,681 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-05-07 17:26:07,684 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:07,686 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:26:07,689 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:26:07 BoogieIcfgContainer
[2025-05-07 17:26:07,689 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:26:07,690 INFO  L158              Benchmark]: Toolchain (without parser) took 3855.56ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 138.3MB in the beginning and 183.3MB in the end (delta: -45.0MB). Peak memory consumption was 19.8MB. Max. memory is 33.6GB.
[2025-05-07 17:26:07,690 INFO  L158              Benchmark]: SmtParser took 0.27ms. Allocated memory is still 234.9MB. Free memory is still 172.2MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:26:07,691 INFO  L158              Benchmark]: ChcToBoogie took 32.46ms. Allocated memory is still 234.9MB. Free memory was 138.3MB in the beginning and 134.7MB in the end (delta: 3.6MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-05-07 17:26:07,691 INFO  L158              Benchmark]: Boogie Preprocessor took 59.14ms. Allocated memory is still 234.9MB. Free memory was 134.7MB in the beginning and 130.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:26:07,691 INFO  L158              Benchmark]: RCFGBuilder took 532.55ms. Allocated memory is still 234.9MB. Free memory was 130.8MB in the beginning and 141.6MB in the end (delta: -10.8MB). Peak memory consumption was 26.2MB. Max. memory is 33.6GB.
[2025-05-07 17:26:07,691 INFO  L158              Benchmark]: TraceAbstraction took 3228.26ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 141.1MB in the beginning and 183.3MB in the end (delta: -42.2MB). Peak memory consumption was 10.3MB. Max. memory is 33.6GB.
[2025-05-07 17:26:07,692 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.27ms. Allocated memory is still 234.9MB. Free memory is still 172.2MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 32.46ms. Allocated memory is still 234.9MB. Free memory was 138.3MB in the beginning and 134.7MB in the end (delta: 3.6MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * Boogie Preprocessor took 59.14ms. Allocated memory is still 234.9MB. Free memory was 134.7MB in the beginning and 130.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 532.55ms. Allocated memory is still 234.9MB. Free memory was 130.8MB in the beginning and 141.6MB in the end (delta: -10.8MB). Peak memory consumption was 26.2MB. Max. memory is 33.6GB.
 * TraceAbstraction took 3228.26ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 141.1MB in the beginning and 183.3MB in the end (delta: -42.2MB). Peak memory consumption was 10.3MB. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Unknown line] : the set of constraint Horn clauses is satisfiable
    For all program executions holds that the set of constraint Horn clauses is satisfiable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 41 procedures, 182 locations, 307 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12 mSDsluCounter, 10246 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7958 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 364 IncrementalHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 2288 mSDtfsCounter, 364 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=0, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 10 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1273 NumberOfCodeBlocks, 1273 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1260 ConstructedInterpolants, 0 QuantifiedInterpolants, 1522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-05-07 17:26:07,705 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
sat
