./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/typecast/string_literal_to_fixed_bytes_return.sol_0_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:28:41,575 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:28:41,612 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0ff944-cf0b-4f73-a97b-c6bf18d24d10/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:28:41,614 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:28:41,615 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:28:41,627 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:28:41,627 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:28:41,628 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:28:41,628 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:28:41,628 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:28:41,628 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:28:41,628 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:28:41,628 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:28:41,628 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:28:41,628 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:28:41,628 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:28:41,628 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:28:41,628 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:28:41,629 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:41,629 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:28:41,629 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:28:41,629 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:28:41,629 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:28:41,629 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:28:41,629 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:28:41,629 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:28:41,629 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:28:41,833 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:28:41,841 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:28:41,844 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:28:41,845 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:28:41,845 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:28:41,846 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0ff944-cf0b-4f73-a97b-c6bf18d24d10/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/typecast/string_literal_to_fixed_bytes_return.sol_0_no_adts_000.smt2
[2025-05-07 17:28:41,847 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:28:41,850 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:28:42,106 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef0ff944-cf0b-4f73-a97b-c6bf18d24d10/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/typecast/string_literal_to_fixed_bytes_return.sol_0_no_adts_000.smt2
[2025-05-07 17:28:42,109 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:28:42,110 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:28:42,111 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:28:42,111 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:28:42,111 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:28:42,114 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:42" (1/1) ...
[2025-05-07 17:28:42,155 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:42 Unit
[2025-05-07 17:28:42,155 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:28:42,156 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:28:42,156 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:28:42,156 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:28:42,172 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:42" (1/1) ...
[2025-05-07 17:28:42,173 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:42" (1/1) ...
[2025-05-07 17:28:42,202 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:42" (1/1) ...
[2025-05-07 17:28:42,202 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:42" (1/1) ...
[2025-05-07 17:28:42,208 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:42" (1/1) ...
[2025-05-07 17:28:42,209 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:42" (1/1) ...
[2025-05-07 17:28:42,211 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:42" (1/1) ...
[2025-05-07 17:28:42,214 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:42" (1/1) ...
[2025-05-07 17:28:42,216 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:42" (1/1) ...
[2025-05-07 17:28:42,232 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:28:42,233 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:28:42,233 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:28:42,233 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:28:42,234 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:42" (1/1) ...
[2025-05-07 17:28:42,236 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:42,248 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:42,257 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:28:42,259 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:28:42,267 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:28:42,267 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:28:42,267 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:28:42,267 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_5_0 given in one single declaration
[2025-05-07 17:28:42,267 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_5_0
[2025-05-07 17:28:42,267 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_5_0
[2025-05-07 17:28:42,267 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_0_C_36_0 given in one single declaration
[2025-05-07 17:28:42,268 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_0_C_36_0
[2025-05-07 17:28:42,268 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_0_C_36_0
[2025-05-07 17:28:42,268 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_6_function_f1__17_36_0 given in one single declaration
[2025-05-07 17:28:42,268 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_6_function_f1__17_36_0
[2025-05-07 17:28:42,268 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_6_function_f1__17_36_0
[2025-05-07 17:28:42,268 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_19_function_f1__17_36_0 given in one single declaration
[2025-05-07 17:28:42,268 INFO  L130     BoogieDeclarations]: Found specification of procedure block_19_function_f1__17_36_0
[2025-05-07 17:28:42,268 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_19_function_f1__17_36_0
[2025-05-07 17:28:42,268 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_5_function_f1__17_36_0 given in one single declaration
[2025-05-07 17:28:42,268 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_5_function_f1__17_36_0
[2025-05-07 17:28:42,268 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_5_function_f1__17_36_0
[2025-05-07 17:28:42,268 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_15_f1_16_36_0 given in one single declaration
[2025-05-07 17:28:42,268 INFO  L130     BoogieDeclarations]: Found specification of procedure block_15_f1_16_36_0
[2025-05-07 17:28:42,268 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_15_f1_16_36_0
[2025-05-07 17:28:42,268 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_14_function_f1__17_36_0 given in one single declaration
[2025-05-07 17:28:42,268 INFO  L130     BoogieDeclarations]: Found specification of procedure block_14_function_f1__17_36_0
[2025-05-07 17:28:42,268 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_14_function_f1__17_36_0
[2025-05-07 17:28:42,268 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_17_function_g__8_36_0 given in one single declaration
[2025-05-07 17:28:42,268 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_17_function_g__8_36_0
[2025-05-07 17:28:42,269 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_17_function_g__8_36_0
[2025-05-07 17:28:42,269 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_3_function_g__8_36_0 given in one single declaration
[2025-05-07 17:28:42,269 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_3_function_g__8_36_0
[2025-05-07 17:28:42,269 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_3_function_g__8_36_0
[2025-05-07 17:28:42,269 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_11_return_function_g__8_36_0 given in one single declaration
[2025-05-07 17:28:42,269 INFO  L130     BoogieDeclarations]: Found specification of procedure block_11_return_function_g__8_36_0
[2025-05-07 17:28:42,269 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_11_return_function_g__8_36_0
[2025-05-07 17:28:42,269 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_10_g_7_36_0 given in one single declaration
[2025-05-07 17:28:42,269 INFO  L130     BoogieDeclarations]: Found specification of procedure block_10_g_7_36_0
[2025-05-07 17:28:42,269 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_10_g_7_36_0
[2025-05-07 17:28:42,269 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_9_function_g__8_36_0 given in one single declaration
[2025-05-07 17:28:42,269 INFO  L130     BoogieDeclarations]: Found specification of procedure block_9_function_g__8_36_0
[2025-05-07 17:28:42,269 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_9_function_g__8_36_0
[2025-05-07 17:28:42,269 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_16_return_function_f1__17_36_0 given in one single declaration
[2025-05-07 17:28:42,269 INFO  L130     BoogieDeclarations]: Found specification of procedure block_16_return_function_f1__17_36_0
[2025-05-07 17:28:42,269 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_16_return_function_f1__17_36_0
[2025-05-07 17:28:42,269 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_2_C_36_0 given in one single declaration
[2025-05-07 17:28:42,269 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_2_C_36_0
[2025-05-07 17:28:42,270 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_2_C_36_0
[2025-05-07 17:28:42,270 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_28_C_36_0 given in one single declaration
[2025-05-07 17:28:42,270 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_28_C_36_0
[2025-05-07 17:28:42,270 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_28_C_36_0
[2025-05-07 17:28:42,270 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_30_C_36_0 given in one single declaration
[2025-05-07 17:28:42,270 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_30_C_36_0
[2025-05-07 17:28:42,270 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_30_C_36_0
[2025-05-07 17:28:42,270 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_29_C_36_0 given in one single declaration
[2025-05-07 17:28:42,270 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_29_C_36_0
[2025-05-07 17:28:42,270 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_29_C_36_0
[2025-05-07 17:28:42,270 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_31_C_36_0 given in one single declaration
[2025-05-07 17:28:42,270 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_31_C_36_0
[2025-05-07 17:28:42,270 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_31_C_36_0
[2025-05-07 17:28:42,270 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_4_function_g__8_36_0 given in one single declaration
[2025-05-07 17:28:42,270 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_4_function_g__8_36_0
[2025-05-07 17:28:42,270 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_4_function_g__8_36_0
[2025-05-07 17:28:42,270 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_13_function_g__8_36_0 given in one single declaration
[2025-05-07 17:28:42,270 INFO  L130     BoogieDeclarations]: Found specification of procedure block_13_function_g__8_36_0
[2025-05-07 17:28:42,270 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_13_function_g__8_36_0
[2025-05-07 17:28:42,271 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_8_function_a__35_36_0 given in one single declaration
[2025-05-07 17:28:42,271 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_8_function_a__35_36_0
[2025-05-07 17:28:42,271 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_8_function_a__35_36_0
[2025-05-07 17:28:42,271 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_7_function_a__35_36_0 given in one single declaration
[2025-05-07 17:28:42,271 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_7_function_a__35_36_0
[2025-05-07 17:28:42,271 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_7_function_a__35_36_0
[2025-05-07 17:28:42,271 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_25_function_f1__17_36_0 given in one single declaration
[2025-05-07 17:28:42,271 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_25_function_f1__17_36_0
[2025-05-07 17:28:42,271 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_25_function_f1__17_36_0
[2025-05-07 17:28:42,271 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_26_function_a__35_36_0 given in one single declaration
[2025-05-07 17:28:42,271 INFO  L130     BoogieDeclarations]: Found specification of procedure block_26_function_a__35_36_0
[2025-05-07 17:28:42,271 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_26_function_a__35_36_0
[2025-05-07 17:28:42,271 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_21_a_34_36_0 given in one single declaration
[2025-05-07 17:28:42,271 INFO  L130     BoogieDeclarations]: Found specification of procedure block_21_a_34_36_0
[2025-05-07 17:28:42,271 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_21_a_34_36_0
[2025-05-07 17:28:42,272 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_20_function_a__35_36_0 given in one single declaration
[2025-05-07 17:28:42,272 INFO  L130     BoogieDeclarations]: Found specification of procedure block_20_function_a__35_36_0
[2025-05-07 17:28:42,272 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_20_function_a__35_36_0
[2025-05-07 17:28:42,272 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_23_function_f1__17_36_0 given in one single declaration
[2025-05-07 17:28:42,272 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_23_function_f1__17_36_0
[2025-05-07 17:28:42,272 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_23_function_f1__17_36_0
[2025-05-07 17:28:42,272 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_24_function_a__35_36_0 given in one single declaration
[2025-05-07 17:28:42,272 INFO  L130     BoogieDeclarations]: Found specification of procedure block_24_function_a__35_36_0
[2025-05-07 17:28:42,272 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_24_function_a__35_36_0
[2025-05-07 17:28:42,272 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_22_return_function_a__35_36_0 given in one single declaration
[2025-05-07 17:28:42,272 INFO  L130     BoogieDeclarations]: Found specification of procedure block_22_return_function_a__35_36_0
[2025-05-07 17:28:42,272 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_22_return_function_a__35_36_0
[2025-05-07 17:28:42,272 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_27_function_a__35_36_0 given in one single declaration
[2025-05-07 17:28:42,272 INFO  L130     BoogieDeclarations]: Found specification of procedure block_27_function_a__35_36_0
[2025-05-07 17:28:42,272 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_27_function_a__35_36_0
[2025-05-07 17:28:42,272 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:28:42,272 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:28:42,272 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:28:42,422 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:28:42,424 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:28:42,674 INFO  L?                        ?]: Removed 231 outVars from TransFormulas that were not future-live.
[2025-05-07 17:28:42,674 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:28:42,683 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:28:42,683 INFO  L312             CfgBuilder]: Removed 17 assume(true) statements.
[2025-05-07 17:28:42,683 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:42 BoogieIcfgContainer
[2025-05-07 17:28:42,683 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:28:42,685 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:28:42,685 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:28:42,687 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:28:42,688 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:42" (1/3) ...
[2025-05-07 17:28:42,688 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661f1814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:28:42, skipping insertion in model container
[2025-05-07 17:28:42,688 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:42" (2/3) ...
[2025-05-07 17:28:42,688 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@661f1814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:28:42, skipping insertion in model container
[2025-05-07 17:28:42,688 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:42" (3/3) ...
[2025-05-07 17:28:42,689 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:28:42,699 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:28:42,701 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 32 procedures, 132 locations, 213 edges, 32 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:28:42,731 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:28:42,739 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;@3e37ca0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:28:42,739 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:28:42,742 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 132 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 57 states have internal predecessors, (57), 50 states have call successors, (52), 31 states have call predecessors, (52), 31 states have return successors, (52), 43 states have call predecessors, (52), 50 states have call successors, (52)
[2025-05-07 17:28:42,750 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2025-05-07 17:28:42,750 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:42,751 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]
[2025-05-07 17:28:42,751 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:42,755 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:42,755 INFO  L85        PathProgramCache]: Analyzing trace with hash -1663011289, now seen corresponding path program 1 times
[2025-05-07 17:28:42,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:42,761 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829773921]
[2025-05-07 17:28:42,761 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:42,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:42,820 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes.
[2025-05-07 17:28:42,887 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements.
[2025-05-07 17:28:42,887 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:42,887 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:43,109 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:28:43,109 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:43,109 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829773921]
[2025-05-07 17:28:43,110 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829773921] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:43,110 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:43,112 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:43,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839896619]
[2025-05-07 17:28:43,114 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:43,117 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:43,117 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:43,153 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:43,153 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:43,156 INFO  L87              Difference]: Start difference. First operand  has 132 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 57 states have internal predecessors, (57), 50 states have call successors, (52), 31 states have call predecessors, (52), 31 states have return successors, (52), 43 states have call predecessors, (52), 50 states have call successors, (52) Second operand  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (22), 1 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22)
[2025-05-07 17:28:43,206 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:43,207 INFO  L93              Difference]: Finished difference Result 134 states and 165 transitions.
[2025-05-07 17:28:43,208 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:43,209 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (22), 1 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 79
[2025-05-07 17:28:43,209 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:43,215 INFO  L225             Difference]: With dead ends: 134
[2025-05-07 17:28:43,216 INFO  L226             Difference]: Without dead ends: 130
[2025-05-07 17:28:43,217 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:28:43,219 INFO  L437           NwaCegarLoop]: 161 mSDtfsCounter, 1 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 475 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:28:43,219 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 475 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:43,230 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 130 states.
[2025-05-07 17:28:43,249 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128.
[2025-05-07 17:28:43,250 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 128 states, 50 states have (on average 1.08) internal successors, (54), 54 states have internal predecessors, (54), 48 states have call successors, (50), 31 states have call predecessors, (50), 31 states have return successors, (50), 42 states have call predecessors, (50), 48 states have call successors, (50)
[2025-05-07 17:28:43,255 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 154 transitions.
[2025-05-07 17:28:43,255 INFO  L79                 Accepts]: Start accepts. Automaton has 128 states and 154 transitions. Word has length 79
[2025-05-07 17:28:43,256 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:43,256 INFO  L485      AbstractCegarLoop]: Abstraction has 128 states and 154 transitions.
[2025-05-07 17:28:43,256 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (22), 1 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22)
[2025-05-07 17:28:43,257 INFO  L278                IsEmpty]: Start isEmpty. Operand 128 states and 154 transitions.
[2025-05-07 17:28:43,260 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2025-05-07 17:28:43,260 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:43,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]
[2025-05-07 17:28:43,260 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:28:43,260 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:43,261 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:43,261 INFO  L85        PathProgramCache]: Analyzing trace with hash 1543748515, now seen corresponding path program 1 times
[2025-05-07 17:28:43,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:43,261 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066113469]
[2025-05-07 17:28:43,261 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:43,261 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:43,306 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes.
[2025-05-07 17:28:43,341 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements.
[2025-05-07 17:28:43,342 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:43,342 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:43,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:28:43,538 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:43,538 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066113469]
[2025-05-07 17:28:43,538 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066113469] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:43,538 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:43,538 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:43,538 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495081206]
[2025-05-07 17:28:43,538 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:43,539 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:43,539 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:43,540 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:43,540 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:43,540 INFO  L87              Difference]: Start difference. First operand 128 states and 154 transitions. Second operand  has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (22), 1 states have call predecessors, (22), 6 states have return successors, (22), 6 states have call predecessors, (22), 4 states have call successors, (22)
[2025-05-07 17:28:43,611 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:43,611 INFO  L93              Difference]: Finished difference Result 127 states and 151 transitions.
[2025-05-07 17:28:43,612 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:43,612 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (22), 1 states have call predecessors, (22), 6 states have return successors, (22), 6 states have call predecessors, (22), 4 states have call successors, (22) Word has length 79
[2025-05-07 17:28:43,612 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:43,614 INFO  L225             Difference]: With dead ends: 127
[2025-05-07 17:28:43,614 INFO  L226             Difference]: Without dead ends: 126
[2025-05-07 17:28:43,614 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:28:43,615 INFO  L437           NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:43,615 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 860 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:43,616 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 126 states.
[2025-05-07 17:28:43,622 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126.
[2025-05-07 17:28:43,622 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 126 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 53 states have internal predecessors, (53), 46 states have call successors, (48), 31 states have call predecessors, (48), 31 states have return successors, (48), 41 states have call predecessors, (48), 46 states have call successors, (48)
[2025-05-07 17:28:43,624 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions.
[2025-05-07 17:28:43,624 INFO  L79                 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 79
[2025-05-07 17:28:43,624 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:43,624 INFO  L485      AbstractCegarLoop]: Abstraction has 126 states and 149 transitions.
[2025-05-07 17:28:43,624 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 5.833333333333333) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (22), 1 states have call predecessors, (22), 6 states have return successors, (22), 6 states have call predecessors, (22), 4 states have call successors, (22)
[2025-05-07 17:28:43,624 INFO  L278                IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions.
[2025-05-07 17:28:43,626 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 83
[2025-05-07 17:28:43,626 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:43,626 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]
[2025-05-07 17:28:43,626 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:28:43,626 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:43,626 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:43,627 INFO  L85        PathProgramCache]: Analyzing trace with hash -313378271, now seen corresponding path program 1 times
[2025-05-07 17:28:43,627 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:43,627 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302244874]
[2025-05-07 17:28:43,627 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:43,627 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:43,661 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes.
[2025-05-07 17:28:43,681 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements.
[2025-05-07 17:28:43,681 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:43,681 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:43,769 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:28:43,769 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:43,769 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302244874]
[2025-05-07 17:28:43,769 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302244874] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:43,769 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:43,769 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:43,769 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436728822]
[2025-05-07 17:28:43,769 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:43,770 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:43,770 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:43,770 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:43,770 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:43,771 INFO  L87              Difference]: Start difference. First operand 126 states and 149 transitions. Second operand  has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (23), 1 states have call predecessors, (23), 5 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23)
[2025-05-07 17:28:43,854 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:43,854 INFO  L93              Difference]: Finished difference Result 127 states and 148 transitions.
[2025-05-07 17:28:43,855 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:43,855 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (23), 1 states have call predecessors, (23), 5 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23) Word has length 82
[2025-05-07 17:28:43,856 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:43,856 INFO  L225             Difference]: With dead ends: 127
[2025-05-07 17:28:43,857 INFO  L226             Difference]: Without dead ends: 126
[2025-05-07 17:28:43,857 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:28:43,857 INFO  L437           NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:43,857 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 674 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:43,858 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 126 states.
[2025-05-07 17:28:43,864 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124.
[2025-05-07 17:28:43,864 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 124 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 52 states have internal predecessors, (52), 44 states have call successors, (46), 31 states have call predecessors, (46), 31 states have return successors, (46), 40 states have call predecessors, (46), 44 states have call successors, (46)
[2025-05-07 17:28:43,865 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 144 transitions.
[2025-05-07 17:28:43,865 INFO  L79                 Accepts]: Start accepts. Automaton has 124 states and 144 transitions. Word has length 82
[2025-05-07 17:28:43,865 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:43,866 INFO  L485      AbstractCegarLoop]: Abstraction has 124 states and 144 transitions.
[2025-05-07 17:28:43,866 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (23), 1 states have call predecessors, (23), 5 states have return successors, (23), 5 states have call predecessors, (23), 4 states have call successors, (23)
[2025-05-07 17:28:43,866 INFO  L278                IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions.
[2025-05-07 17:28:43,868 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 86
[2025-05-07 17:28:43,868 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:43,868 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]
[2025-05-07 17:28:43,868 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:28:43,868 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:43,868 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:43,869 INFO  L85        PathProgramCache]: Analyzing trace with hash 1755647059, now seen corresponding path program 1 times
[2025-05-07 17:28:43,869 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:43,869 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583263555]
[2025-05-07 17:28:43,869 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:43,869 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:43,907 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes.
[2025-05-07 17:28:43,917 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements.
[2025-05-07 17:28:43,917 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:43,917 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:44,115 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:28:44,115 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:44,115 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583263555]
[2025-05-07 17:28:44,116 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583263555] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:44,116 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:44,116 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-05-07 17:28:44,116 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740593208]
[2025-05-07 17:28:44,116 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:44,116 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-05-07 17:28:44,117 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:44,117 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-05-07 17:28:44,117 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:28:44,118 INFO  L87              Difference]: Start difference. First operand 124 states and 144 transitions. Second operand  has 10 states, 8 states have (on average 4.625) internal successors, (37), 10 states have internal predecessors, (37), 6 states have call successors, (24), 1 states have call predecessors, (24), 8 states have return successors, (24), 8 states have call predecessors, (24), 6 states have call successors, (24)
[2025-05-07 17:28:44,265 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:44,265 INFO  L93              Difference]: Finished difference Result 121 states and 139 transitions.
[2025-05-07 17:28:44,265 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-05-07 17:28:44,265 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 4.625) internal successors, (37), 10 states have internal predecessors, (37), 6 states have call successors, (24), 1 states have call predecessors, (24), 8 states have return successors, (24), 8 states have call predecessors, (24), 6 states have call successors, (24) Word has length 85
[2025-05-07 17:28:44,266 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:44,267 INFO  L225             Difference]: With dead ends: 121
[2025-05-07 17:28:44,267 INFO  L226             Difference]: Without dead ends: 119
[2025-05-07 17:28:44,267 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:28:44,268 INFO  L437           NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:44,268 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1125 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:44,269 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2025-05-07 17:28:44,275 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119.
[2025-05-07 17:28:44,276 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 119 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 50 states have internal predecessors, (50), 42 states have call successors, (43), 30 states have call predecessors, (43), 30 states have return successors, (43), 38 states have call predecessors, (43), 42 states have call successors, (43)
[2025-05-07 17:28:44,277 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions.
[2025-05-07 17:28:44,277 INFO  L79                 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 85
[2025-05-07 17:28:44,278 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:44,278 INFO  L485      AbstractCegarLoop]: Abstraction has 119 states and 136 transitions.
[2025-05-07 17:28:44,278 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 4.625) internal successors, (37), 10 states have internal predecessors, (37), 6 states have call successors, (24), 1 states have call predecessors, (24), 8 states have return successors, (24), 8 states have call predecessors, (24), 6 states have call successors, (24)
[2025-05-07 17:28:44,278 INFO  L278                IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions.
[2025-05-07 17:28:44,280 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2025-05-07 17:28:44,280 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:44,280 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:44,280 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:28:44,280 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:44,281 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:44,281 INFO  L85        PathProgramCache]: Analyzing trace with hash 838620914, now seen corresponding path program 1 times
[2025-05-07 17:28:44,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:44,281 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591418400]
[2025-05-07 17:28:44,281 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:44,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:44,323 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes.
[2025-05-07 17:28:44,350 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements.
[2025-05-07 17:28:44,350 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:44,350 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:44,462 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2025-05-07 17:28:44,462 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:44,463 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591418400]
[2025-05-07 17:28:44,463 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591418400] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:44,463 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033057109]
[2025-05-07 17:28:44,463 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:44,463 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:44,464 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:44,466 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:44,467 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:28:44,741 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes.
[2025-05-07 17:28:44,889 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements.
[2025-05-07 17:28:44,889 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:44,889 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:44,894 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1486 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:44,902 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:44,977 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2025-05-07 17:28:44,977 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:45,910 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2025-05-07 17:28:45,910 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033057109] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:28:45,910 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:28:45,910 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 10
[2025-05-07 17:28:45,910 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110100547]
[2025-05-07 17:28:45,910 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:45,911 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-05-07 17:28:45,911 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:45,911 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-05-07 17:28:45,911 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:28:45,912 INFO  L87              Difference]: Start difference. First operand 119 states and 136 transitions. Second operand  has 10 states, 7 states have (on average 7.857142857142857) internal successors, (55), 10 states have internal predecessors, (55), 7 states have call successors, (38), 2 states have call predecessors, (38), 7 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40)
[2025-05-07 17:28:45,982 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:45,982 INFO  L93              Difference]: Finished difference Result 117 states and 131 transitions.
[2025-05-07 17:28:45,983 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:45,983 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 7 states have (on average 7.857142857142857) internal successors, (55), 10 states have internal predecessors, (55), 7 states have call successors, (38), 2 states have call predecessors, (38), 7 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) Word has length 116
[2025-05-07 17:28:45,983 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:45,984 INFO  L225             Difference]: With dead ends: 117
[2025-05-07 17:28:45,984 INFO  L226             Difference]: Without dead ends: 116
[2025-05-07 17:28:45,984 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 224 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:28:45,985 INFO  L437           NwaCegarLoop]: 125 mSDtfsCounter, 2 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:45,985 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 977 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:45,986 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2025-05-07 17:28:45,992 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116.
[2025-05-07 17:28:45,993 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 116 states, 46 states have (on average 1.065217391304348) internal successors, (49), 49 states have internal predecessors, (49), 39 states have call successors, (40), 30 states have call predecessors, (40), 30 states have return successors, (40), 36 states have call predecessors, (40), 39 states have call successors, (40)
[2025-05-07 17:28:45,994 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions.
[2025-05-07 17:28:45,994 INFO  L79                 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 116
[2025-05-07 17:28:45,994 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:45,994 INFO  L485      AbstractCegarLoop]: Abstraction has 116 states and 129 transitions.
[2025-05-07 17:28:45,994 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 7 states have (on average 7.857142857142857) internal successors, (55), 10 states have internal predecessors, (55), 7 states have call successors, (38), 2 states have call predecessors, (38), 7 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40)
[2025-05-07 17:28:45,994 INFO  L278                IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions.
[2025-05-07 17:28:45,996 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2025-05-07 17:28:45,996 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:45,996 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:46,001 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:28:46,197 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2025-05-07 17:28:46,197 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:46,199 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:46,199 INFO  L85        PathProgramCache]: Analyzing trace with hash 415245020, now seen corresponding path program 1 times
[2025-05-07 17:28:46,200 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:46,200 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090151927]
[2025-05-07 17:28:46,200 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:46,201 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:46,314 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes.
[2025-05-07 17:28:46,335 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements.
[2025-05-07 17:28:46,335 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:46,335 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:46,449 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2025-05-07 17:28:46,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:46,449 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090151927]
[2025-05-07 17:28:46,449 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090151927] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:46,449 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:46,450 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:46,450 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303566407]
[2025-05-07 17:28:46,450 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:46,450 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:46,450 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:46,451 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:46,451 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:46,451 INFO  L87              Difference]: Start difference. First operand 116 states and 129 transitions. Second operand  has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 4 states have call successors, (26), 1 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26)
[2025-05-07 17:28:46,478 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:46,478 INFO  L93              Difference]: Finished difference Result 120 states and 133 transitions.
[2025-05-07 17:28:46,479 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:46,479 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), 4 states have call successors, (26), 1 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 119
[2025-05-07 17:28:46,479 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:46,480 INFO  L225             Difference]: With dead ends: 120
[2025-05-07 17:28:46,480 INFO  L226             Difference]: Without dead ends: 120
[2025-05-07 17:28:46,481 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:28:46,481 INFO  L437           NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:46,482 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 623 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:46,482 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2025-05-07 17:28:46,489 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120.
[2025-05-07 17:28:46,489 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 120 states, 48 states have (on average 1.0625) internal successors, (51), 51 states have internal predecessors, (51), 39 states have call successors, (40), 30 states have call predecessors, (40), 32 states have return successors, (42), 38 states have call predecessors, (42), 39 states have call successors, (42)
[2025-05-07 17:28:46,490 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 133 transitions.
[2025-05-07 17:28:46,490 INFO  L79                 Accepts]: Start accepts. Automaton has 120 states and 133 transitions. Word has length 119
[2025-05-07 17:28:46,491 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:46,491 INFO  L485      AbstractCegarLoop]: Abstraction has 120 states and 133 transitions.
[2025-05-07 17:28:46,491 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), 4 states have call successors, (26), 1 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26)
[2025-05-07 17:28:46,491 INFO  L278                IsEmpty]: Start isEmpty. Operand 120 states and 133 transitions.
[2025-05-07 17:28:46,492 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2025-05-07 17:28:46,492 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:46,493 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:46,493 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:28:46,493 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:46,493 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:46,493 INFO  L85        PathProgramCache]: Analyzing trace with hash 1108591186, now seen corresponding path program 1 times
[2025-05-07 17:28:46,493 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:46,493 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256054750]
[2025-05-07 17:28:46,494 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:46,494 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:46,525 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes.
[2025-05-07 17:28:46,540 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements.
[2025-05-07 17:28:46,540 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:46,540 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:46,670 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2025-05-07 17:28:46,670 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:46,670 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256054750]
[2025-05-07 17:28:46,670 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256054750] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:46,670 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:46,670 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:46,670 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538640799]
[2025-05-07 17:28:46,671 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:46,671 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:46,671 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:46,671 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:46,672 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:46,672 INFO  L87              Difference]: Start difference. First operand 120 states and 133 transitions. Second operand  has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 4 states have call successors, (26), 1 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26)
[2025-05-07 17:28:46,688 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:46,688 INFO  L93              Difference]: Finished difference Result 72 states and 75 transitions.
[2025-05-07 17:28:46,689 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:46,689 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), 4 states have call successors, (26), 1 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 119
[2025-05-07 17:28:46,689 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:46,689 INFO  L225             Difference]: With dead ends: 72
[2025-05-07 17:28:46,689 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:28:46,690 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:28:46,690 INFO  L437           NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:46,690 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 342 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:46,691 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:28:46,691 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:28:46,691 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:28:46,691 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:28:46,691 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119
[2025-05-07 17:28:46,692 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:46,692 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:28:46,692 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), 4 states have call successors, (26), 1 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26)
[2025-05-07 17:28:46,692 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:28:46,692 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:28:46,694 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:28:46,694 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:28:46,696 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:46,698 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:28:46,700 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:28:46 BoogieIcfgContainer
[2025-05-07 17:28:46,700 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:28:46,701 INFO  L158              Benchmark]: Toolchain (without parser) took 4590.91ms. Allocated memory is still 234.9MB. Free memory was 145.3MB in the beginning and 178.1MB in the end (delta: -32.8MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:46,701 INFO  L158              Benchmark]: SmtParser took 0.22ms. Allocated memory is still 234.9MB. Free memory is still 173.1MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:46,701 INFO  L158              Benchmark]: ChcToBoogie took 44.53ms. Allocated memory is still 234.9MB. Free memory was 145.2MB in the beginning and 142.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:46,701 INFO  L158              Benchmark]: Boogie Preprocessor took 76.23ms. Allocated memory is still 234.9MB. Free memory was 142.0MB in the beginning and 137.7MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:46,702 INFO  L158              Benchmark]: RCFGBuilder took 450.48ms. Allocated memory was 234.9MB in the beginning and 318.8MB in the end (delta: 83.9MB). Free memory was 137.7MB in the beginning and 250.2MB in the end (delta: -112.5MB). Peak memory consumption was 43.2MB. Max. memory is 33.6GB.
[2025-05-07 17:28:46,702 INFO  L158              Benchmark]: TraceAbstraction took 4015.73ms. Allocated memory was 318.8MB in the beginning and 234.9MB in the end (delta: -83.9MB). Free memory was 249.6MB in the beginning and 178.1MB in the end (delta: 71.5MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:46,703 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.22ms. Allocated memory is still 234.9MB. Free memory is still 173.1MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 44.53ms. Allocated memory is still 234.9MB. Free memory was 145.2MB in the beginning and 142.0MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 76.23ms. Allocated memory is still 234.9MB. Free memory was 142.0MB in the beginning and 137.7MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 450.48ms. Allocated memory was 234.9MB in the beginning and 318.8MB in the end (delta: 83.9MB). Free memory was 137.7MB in the beginning and 250.2MB in the end (delta: -112.5MB). Peak memory consumption was 43.2MB. Max. memory is 33.6GB.
 * TraceAbstraction took 4015.73ms. Allocated memory was 318.8MB in the beginning and 234.9MB in the end (delta: -83.9MB). Free memory was 249.6MB in the beginning and 178.1MB in the end (delta: 71.5MB). There was no memory consumed. 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 32 procedures, 132 locations, 213 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 5076 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4180 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 283 IncrementalHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 896 mSDtfsCounter, 283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 277 GetRequests, 236 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=0, InterpolantAutomatonStates: 46, 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, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 795 NumberOfCodeBlocks, 795 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 902 ConstructedInterpolants, 0 QuantifiedInterpolants, 1105 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1486 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 132/150 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:28:46,714 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
