./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/constructor_hierarchy_base_calls_with_side_effects_8.sol_1_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:29:09,817 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:29:09,873 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3ad380-f4d8-40d2-84b2-66a5ca6ddf46/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:29:09,877 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:29:09,877 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:29:09,896 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:29:09,896 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:29:09,897 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:29:09,897 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:29:09,897 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:29:09,897 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:29:09,897 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:29:09,897 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:29:09,897 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:29:09,898 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:29:09,898 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:29:09,898 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:29:09,898 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:29:09,898 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:29:09,898 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:29:09,898 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:29:09,898 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:29:09,898 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:29:09,898 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:29:09,898 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:29:09,899 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:29:09,899 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:29:10,090 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:29:10,099 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:29:10,101 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:29:10,102 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:29:10,102 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:29:10,103 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3ad380-f4d8-40d2-84b2-66a5ca6ddf46/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/constructor_hierarchy_base_calls_with_side_effects_8.sol_1_no_adts_000.smt2
[2025-05-07 17:29:10,104 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:29:10,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:29:10,331 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3ad380-f4d8-40d2-84b2-66a5ca6ddf46/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/constructor_hierarchy_base_calls_with_side_effects_8.sol_1_no_adts_000.smt2
[2025-05-07 17:29:10,334 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:29:10,334 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:29:10,335 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:29:10,335 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:29:10,335 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:29:10,337 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:29:10" (1/1) ...
[2025-05-07 17:29:10,364 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:10 Unit
[2025-05-07 17:29:10,364 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:29:10,365 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:29:10,365 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:29:10,365 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:29:10,376 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:10" (1/1) ...
[2025-05-07 17:29:10,377 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:10" (1/1) ...
[2025-05-07 17:29:10,398 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:10" (1/1) ...
[2025-05-07 17:29:10,398 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:10" (1/1) ...
[2025-05-07 17:29:10,402 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:10" (1/1) ...
[2025-05-07 17:29:10,403 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:10" (1/1) ...
[2025-05-07 17:29:10,405 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:10" (1/1) ...
[2025-05-07 17:29:10,407 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:10" (1/1) ...
[2025-05-07 17:29:10,408 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:10" (1/1) ...
[2025-05-07 17:29:10,418 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:29:10,419 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:29:10,419 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:29:10,419 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:29:10,419 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:10" (1/1) ...
[2025-05-07 17:29:10,421 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:29:10,430 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:10,439 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:29:10,441 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:29:10,450 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:29:10,450 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:29:10,450 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:29:10,450 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_4_0 given in one single declaration
[2025-05-07 17:29:10,450 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_4_0
[2025-05-07 17:29:10,450 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_4_0
[2025-05-07 17:29:10,450 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_7_C_52_0 given in one single declaration
[2025-05-07 17:29:10,451 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_7_C_52_0
[2025-05-07 17:29:10,451 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_7_C_52_0
[2025-05-07 17:29:10,451 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_42_function_f__22_52_0 given in one single declaration
[2025-05-07 17:29:10,451 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_42_function_f__22_52_0
[2025-05-07 17:29:10,451 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_42_function_f__22_52_0
[2025-05-07 17:29:10,451 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_9_function_f__22_52_0 given in one single declaration
[2025-05-07 17:29:10,451 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_9_function_f__22_52_0
[2025-05-07 17:29:10,451 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_9_function_f__22_52_0
[2025-05-07 17:29:10,451 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_24_return_function_f__22_52_0 given in one single declaration
[2025-05-07 17:29:10,451 INFO  L130     BoogieDeclarations]: Found specification of procedure block_24_return_function_f__22_52_0
[2025-05-07 17:29:10,451 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_24_return_function_f__22_52_0
[2025-05-07 17:29:10,451 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_23_f_21_52_0 given in one single declaration
[2025-05-07 17:29:10,451 INFO  L130     BoogieDeclarations]: Found specification of procedure block_23_f_21_52_0
[2025-05-07 17:29:10,451 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_23_f_21_52_0
[2025-05-07 17:29:10,451 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_22_function_f__22_52_0 given in one single declaration
[2025-05-07 17:29:10,451 INFO  L130     BoogieDeclarations]: Found specification of procedure block_22_function_f__22_52_0
[2025-05-07 17:29:10,451 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_22_function_f__22_52_0
[2025-05-07 17:29:10,451 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_38_A_23_0 given in one single declaration
[2025-05-07 17:29:10,452 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_38_A_23_0
[2025-05-07 17:29:10,452 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_38_A_23_0
[2025-05-07 17:29:10,452 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_40_A_23_0 given in one single declaration
[2025-05-07 17:29:10,452 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_40_A_23_0
[2025-05-07 17:29:10,452 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_40_A_23_0
[2025-05-07 17:29:10,452 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_39_A_23_0 given in one single declaration
[2025-05-07 17:29:10,452 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_39_A_23_0
[2025-05-07 17:29:10,452 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_39_A_23_0
[2025-05-07 17:29:10,452 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_8_constructor_8_52_0 given in one single declaration
[2025-05-07 17:29:10,452 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_8_constructor_8_52_0
[2025-05-07 17:29:10,452 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_8_constructor_8_52_0
[2025-05-07 17:29:10,452 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_37_return_constructor_8_52_0 given in one single declaration
[2025-05-07 17:29:10,452 INFO  L130     BoogieDeclarations]: Found specification of procedure block_37_return_constructor_8_52_0
[2025-05-07 17:29:10,452 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_37_return_constructor_8_52_0
[2025-05-07 17:29:10,452 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_36__7_52_0 given in one single declaration
[2025-05-07 17:29:10,452 INFO  L130     BoogieDeclarations]: Found specification of procedure block_36__7_52_0
[2025-05-07 17:29:10,452 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_36__7_52_0
[2025-05-07 17:29:10,452 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_35_constructor_8_52_0 given in one single declaration
[2025-05-07 17:29:10,452 INFO  L130     BoogieDeclarations]: Found specification of procedure block_35_constructor_8_52_0
[2025-05-07 17:29:10,453 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_35_constructor_8_52_0
[2025-05-07 17:29:10,453 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_41_C_52_0 given in one single declaration
[2025-05-07 17:29:10,453 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_41_C_52_0
[2025-05-07 17:29:10,453 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_41_C_52_0
[2025-05-07 17:29:10,453 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_32_C_52_0 given in one single declaration
[2025-05-07 17:29:10,453 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_32_C_52_0
[2025-05-07 17:29:10,453 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_32_C_52_0
[2025-05-07 17:29:10,453 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_10_constructor_51_52_0 given in one single declaration
[2025-05-07 17:29:10,453 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_10_constructor_51_52_0
[2025-05-07 17:29:10,453 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_10_constructor_51_52_0
[2025-05-07 17:29:10,453 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_29_constructor_51_52_0 given in one single declaration
[2025-05-07 17:29:10,453 INFO  L130     BoogieDeclarations]: Found specification of procedure block_29_constructor_51_52_0
[2025-05-07 17:29:10,453 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_29_constructor_51_52_0
[2025-05-07 17:29:10,453 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_27__50_52_0 given in one single declaration
[2025-05-07 17:29:10,453 INFO  L130     BoogieDeclarations]: Found specification of procedure block_27__50_52_0
[2025-05-07 17:29:10,453 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_27__50_52_0
[2025-05-07 17:29:10,453 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_26_constructor_51_52_0 given in one single declaration
[2025-05-07 17:29:10,453 INFO  L130     BoogieDeclarations]: Found specification of procedure block_26_constructor_51_52_0
[2025-05-07 17:29:10,453 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_26_constructor_51_52_0
[2025-05-07 17:29:10,454 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_31_constructor_51_52_0 given in one single declaration
[2025-05-07 17:29:10,454 INFO  L130     BoogieDeclarations]: Found specification of procedure block_31_constructor_51_52_0
[2025-05-07 17:29:10,454 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_31_constructor_51_52_0
[2025-05-07 17:29:10,454 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_30_constructor_51_52_0 given in one single declaration
[2025-05-07 17:29:10,454 INFO  L130     BoogieDeclarations]: Found specification of procedure block_30_constructor_51_52_0
[2025-05-07 17:29:10,454 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_30_constructor_51_52_0
[2025-05-07 17:29:10,454 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_28_return_constructor_51_52_0 given in one single declaration
[2025-05-07 17:29:10,454 INFO  L130     BoogieDeclarations]: Found specification of procedure block_28_return_constructor_51_52_0
[2025-05-07 17:29:10,454 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_28_return_constructor_51_52_0
[2025-05-07 17:29:10,454 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_34_C_52_0 given in one single declaration
[2025-05-07 17:29:10,454 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_34_C_52_0
[2025-05-07 17:29:10,454 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_34_C_52_0
[2025-05-07 17:29:10,454 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_33_C_52_0 given in one single declaration
[2025-05-07 17:29:10,454 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_33_C_52_0
[2025-05-07 17:29:10,454 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_33_C_52_0
[2025-05-07 17:29:10,454 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:29:10,454 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:29:10,454 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:29:10,592 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:29:10,593 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:29:10,820 INFO  L?                        ?]: Removed 231 outVars from TransFormulas that were not future-live.
[2025-05-07 17:29:10,820 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:29:10,832 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:29:10,833 INFO  L312             CfgBuilder]: Removed 13 assume(true) statements.
[2025-05-07 17:29:10,833 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:29:10 BoogieIcfgContainer
[2025-05-07 17:29:10,833 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:29:10,835 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:29:10,835 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:29:10,838 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:29:10,838 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:29:10" (1/3) ...
[2025-05-07 17:29:10,838 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49446215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:29:10, skipping insertion in model container
[2025-05-07 17:29:10,838 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:10" (2/3) ...
[2025-05-07 17:29:10,839 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49446215 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:29:10, skipping insertion in model container
[2025-05-07 17:29:10,839 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:29:10" (3/3) ...
[2025-05-07 17:29:10,840 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:29:10,849 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:29:10,851 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 27 procedures, 111 locations, 176 edges, 27 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:29:10,879 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:29:10,887 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;@449bb674, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:29:10,887 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:29:10,890 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 111 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 50 states have internal predecessors, (50), 39 states have call successors, (42), 26 states have call predecessors, (42), 26 states have return successors, (42), 34 states have call predecessors, (42), 39 states have call successors, (42)
[2025-05-07 17:29:10,897 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-05-07 17:29:10,897 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:10,898 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]
[2025-05-07 17:29:10,898 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:10,901 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:10,902 INFO  L85        PathProgramCache]: Analyzing trace with hash 841864685, now seen corresponding path program 1 times
[2025-05-07 17:29:10,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:10,907 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679712143]
[2025-05-07 17:29:10,907 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:10,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:10,936 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-05-07 17:29:10,979 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-05-07 17:29:10,979 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:10,979 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:11,150 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:29:11,150 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:11,151 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679712143]
[2025-05-07 17:29:11,151 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679712143] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:11,151 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:11,153 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:29:11,155 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745731584]
[2025-05-07 17:29:11,155 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:11,158 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:29:11,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:11,176 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:29:11,176 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:11,178 INFO  L87              Difference]: Start difference. First operand  has 111 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 50 states have internal predecessors, (50), 39 states have call successors, (42), 26 states have call predecessors, (42), 26 states have return successors, (42), 34 states have call predecessors, (42), 39 states have call successors, (42) Second operand  has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 4 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9)
[2025-05-07 17:29:11,310 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:11,310 INFO  L93              Difference]: Finished difference Result 110 states and 131 transitions.
[2025-05-07 17:29:11,311 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:29:11,313 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 4 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 33
[2025-05-07 17:29:11,313 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:11,323 INFO  L225             Difference]: With dead ends: 110
[2025-05-07 17:29:11,323 INFO  L226             Difference]: Without dead ends: 109
[2025-05-07 17:29:11,324 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:29:11,326 INFO  L437           NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:11,327 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 709 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:29:11,337 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 109 states.
[2025-05-07 17:29:11,358 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107.
[2025-05-07 17:29:11,360 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 107 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 47 states have internal predecessors, (47), 37 states have call successors, (40), 26 states have call predecessors, (40), 26 states have return successors, (40), 33 states have call predecessors, (40), 37 states have call successors, (40)
[2025-05-07 17:29:11,363 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions.
[2025-05-07 17:29:11,364 INFO  L79                 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 33
[2025-05-07 17:29:11,364 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:11,364 INFO  L485      AbstractCegarLoop]: Abstraction has 107 states and 127 transitions.
[2025-05-07 17:29:11,364 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 4 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9)
[2025-05-07 17:29:11,364 INFO  L278                IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions.
[2025-05-07 17:29:11,367 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-05-07 17:29:11,367 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:11,367 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]
[2025-05-07 17:29:11,367 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:29:11,368 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:11,368 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:11,368 INFO  L85        PathProgramCache]: Analyzing trace with hash 1336293611, now seen corresponding path program 1 times
[2025-05-07 17:29:11,368 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:11,369 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797229693]
[2025-05-07 17:29:11,369 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:11,369 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:11,410 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-05-07 17:29:11,417 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-05-07 17:29:11,417 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:11,417 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:11,527 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:29:11,527 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:11,527 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797229693]
[2025-05-07 17:29:11,527 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797229693] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:11,527 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:11,527 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:11,528 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023181796]
[2025-05-07 17:29:11,528 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:11,529 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:11,529 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:11,529 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:11,529 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:11,530 INFO  L87              Difference]: Start difference. First operand 107 states and 127 transitions. Second operand  has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (23), 1 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23)
[2025-05-07 17:29:11,546 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:11,546 INFO  L93              Difference]: Finished difference Result 109 states and 128 transitions.
[2025-05-07 17:29:11,547 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:11,547 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (23), 1 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 83
[2025-05-07 17:29:11,547 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:11,548 INFO  L225             Difference]: With dead ends: 109
[2025-05-07 17:29:11,548 INFO  L226             Difference]: Without dead ends: 103
[2025-05-07 17:29:11,549 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:29:11,550 INFO  L437           NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:11,550 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 372 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:11,551 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103 states.
[2025-05-07 17:29:11,558 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103.
[2025-05-07 17:29:11,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 103 states, 43 states have (on average 1.069767441860465) internal successors, (46), 46 states have internal predecessors, (46), 33 states have call successors, (36), 26 states have call predecessors, (36), 26 states have return successors, (36), 30 states have call predecessors, (36), 33 states have call successors, (36)
[2025-05-07 17:29:11,559 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions.
[2025-05-07 17:29:11,559 INFO  L79                 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 83
[2025-05-07 17:29:11,560 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:11,560 INFO  L485      AbstractCegarLoop]: Abstraction has 103 states and 118 transitions.
[2025-05-07 17:29:11,560 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 3 states have call successors, (23), 1 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23)
[2025-05-07 17:29:11,560 INFO  L278                IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions.
[2025-05-07 17:29:11,561 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:29:11,562 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:11,562 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]
[2025-05-07 17:29:11,562 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:29:11,562 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:11,562 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:11,562 INFO  L85        PathProgramCache]: Analyzing trace with hash 1409424074, now seen corresponding path program 1 times
[2025-05-07 17:29:11,562 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:11,562 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105926769]
[2025-05-07 17:29:11,563 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:11,563 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:11,590 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:29:11,610 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:29:11,610 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:11,610 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:11,689 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:29:11,689 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:11,689 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105926769]
[2025-05-07 17:29:11,689 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105926769] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:11,689 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:11,689 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:29:11,689 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216421363]
[2025-05-07 17:29:11,689 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:11,690 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:11,690 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:11,691 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:11,691 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:11,691 INFO  L87              Difference]: Start difference. First operand 103 states and 118 transitions. Second operand  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:29:11,732 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:11,732 INFO  L93              Difference]: Finished difference Result 102 states and 115 transitions.
[2025-05-07 17:29:11,732 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:11,733 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) Word has length 58
[2025-05-07 17:29:11,733 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:11,734 INFO  L225             Difference]: With dead ends: 102
[2025-05-07 17:29:11,734 INFO  L226             Difference]: Without dead ends: 101
[2025-05-07 17:29:11,734 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:29:11,735 INFO  L437           NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:11,735 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 547 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:11,735 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 101 states.
[2025-05-07 17:29:11,740 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101.
[2025-05-07 17:29:11,740 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 101 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 31 states have call successors, (34), 26 states have call predecessors, (34), 26 states have return successors, (34), 29 states have call predecessors, (34), 31 states have call successors, (34)
[2025-05-07 17:29:11,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions.
[2025-05-07 17:29:11,741 INFO  L79                 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 58
[2025-05-07 17:29:11,741 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:11,742 INFO  L485      AbstractCegarLoop]: Abstraction has 101 states and 113 transitions.
[2025-05-07 17:29:11,742 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:29:11,742 INFO  L278                IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions.
[2025-05-07 17:29:11,743 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-05-07 17:29:11,743 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:11,743 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]
[2025-05-07 17:29:11,743 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:29:11,743 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:11,744 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:11,744 INFO  L85        PathProgramCache]: Analyzing trace with hash -63111820, now seen corresponding path program 1 times
[2025-05-07 17:29:11,744 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:11,744 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83574874]
[2025-05-07 17:29:11,744 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:11,744 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:11,775 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-05-07 17:29:11,791 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-05-07 17:29:11,791 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:11,791 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:11,925 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:29:11,925 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:11,925 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83574874]
[2025-05-07 17:29:11,925 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83574874] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:11,925 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:11,925 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:29:11,925 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272948297]
[2025-05-07 17:29:11,925 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:11,926 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:29:11,926 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:11,926 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:29:11,926 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:11,926 INFO  L87              Difference]: Start difference. First operand 101 states and 113 transitions. Second operand  has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (23), 1 states have call predecessors, (23), 6 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23)
[2025-05-07 17:29:11,970 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:11,971 INFO  L93              Difference]: Finished difference Result 110 states and 125 transitions.
[2025-05-07 17:29:11,971 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:29:11,971 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (23), 1 states have call predecessors, (23), 6 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23) Word has length 83
[2025-05-07 17:29:11,972 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:11,972 INFO  L225             Difference]: With dead ends: 110
[2025-05-07 17:29:11,972 INFO  L226             Difference]: Without dead ends: 97
[2025-05-07 17:29:11,973 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:29:11,973 INFO  L437           NwaCegarLoop]: 121 mSDtfsCounter, 1 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:11,973 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 705 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:11,974 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2025-05-07 17:29:11,977 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97.
[2025-05-07 17:29:11,977 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97 states, 41 states have (on average 1.048780487804878) internal successors, (43), 43 states have internal predecessors, (43), 30 states have call successors, (32), 25 states have call predecessors, (32), 25 states have return successors, (32), 28 states have call predecessors, (32), 30 states have call successors, (32)
[2025-05-07 17:29:11,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions.
[2025-05-07 17:29:11,978 INFO  L79                 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 83
[2025-05-07 17:29:11,979 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:11,979 INFO  L485      AbstractCegarLoop]: Abstraction has 97 states and 107 transitions.
[2025-05-07 17:29:11,979 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (23), 1 states have call predecessors, (23), 6 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23)
[2025-05-07 17:29:11,979 INFO  L278                IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions.
[2025-05-07 17:29:11,980 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:29:11,980 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:11,980 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]
[2025-05-07 17:29:11,980 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:29:11,980 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:11,980 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:11,980 INFO  L85        PathProgramCache]: Analyzing trace with hash -976439610, now seen corresponding path program 1 times
[2025-05-07 17:29:11,980 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:11,980 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762255737]
[2025-05-07 17:29:11,980 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:11,981 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:11,997 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:29:12,002 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:29:12,002 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:12,002 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:12,042 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:29:12,042 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:12,042 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762255737]
[2025-05-07 17:29:12,042 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762255737] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:12,042 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:12,042 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:12,042 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910571754]
[2025-05-07 17:29:12,042 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:12,042 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:12,042 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:12,043 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:12,043 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:12,043 INFO  L87              Difference]: Start difference. First operand 97 states and 107 transitions. Second operand  has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:29:12,062 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:12,062 INFO  L93              Difference]: Finished difference Result 96 states and 104 transitions.
[2025-05-07 17:29:12,063 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:12,063 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 58
[2025-05-07 17:29:12,063 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:12,064 INFO  L225             Difference]: With dead ends: 96
[2025-05-07 17:29:12,064 INFO  L226             Difference]: Without dead ends: 94
[2025-05-07 17:29:12,064 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:29:12,064 INFO  L437           NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:12,065 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 292 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:12,065 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2025-05-07 17:29:12,068 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94.
[2025-05-07 17:29:12,068 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 41 states have (on average 1.024390243902439) internal successors, (42), 42 states have internal predecessors, (42), 27 states have call successors, (29), 25 states have call predecessors, (29), 25 states have return successors, (29), 26 states have call predecessors, (29), 27 states have call successors, (29)
[2025-05-07 17:29:12,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions.
[2025-05-07 17:29:12,069 INFO  L79                 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 58
[2025-05-07 17:29:12,069 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:12,069 INFO  L485      AbstractCegarLoop]: Abstraction has 94 states and 100 transitions.
[2025-05-07 17:29:12,069 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:29:12,069 INFO  L278                IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions.
[2025-05-07 17:29:12,070 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-05-07 17:29:12,070 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:12,070 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]
[2025-05-07 17:29:12,070 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:29:12,070 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:12,070 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:12,070 INFO  L85        PathProgramCache]: Analyzing trace with hash 1823505440, now seen corresponding path program 1 times
[2025-05-07 17:29:12,070 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:12,070 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23416945]
[2025-05-07 17:29:12,070 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:12,071 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:12,093 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-05-07 17:29:12,096 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-05-07 17:29:12,096 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:12,096 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:12,144 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:29:12,144 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:12,144 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23416945]
[2025-05-07 17:29:12,144 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23416945] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:12,144 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:12,144 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:12,144 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296738009]
[2025-05-07 17:29:12,144 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:12,144 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:12,144 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:12,145 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:12,145 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:12,145 INFO  L87              Difference]: Start difference. First operand 94 states and 100 transitions. Second operand  has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (23), 1 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23)
[2025-05-07 17:29:12,157 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:12,157 INFO  L93              Difference]: Finished difference Result 96 states and 101 transitions.
[2025-05-07 17:29:12,157 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:12,158 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (23), 1 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 83
[2025-05-07 17:29:12,158 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:12,158 INFO  L225             Difference]: With dead ends: 96
[2025-05-07 17:29:12,158 INFO  L226             Difference]: Without dead ends: 92
[2025-05-07 17:29:12,158 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:29:12,159 INFO  L437           NwaCegarLoop]: 99 mSDtfsCounter, 1 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:12,159 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 285 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:12,159 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-05-07 17:29:12,162 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2025-05-07 17:29:12,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 41 states have (on average 1.0) internal successors, (41), 41 states have internal predecessors, (41), 25 states have call successors, (27), 25 states have call predecessors, (27), 25 states have return successors, (27), 25 states have call predecessors, (27), 25 states have call successors, (27)
[2025-05-07 17:29:12,163 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 95 transitions.
[2025-05-07 17:29:12,163 INFO  L79                 Accepts]: Start accepts. Automaton has 92 states and 95 transitions. Word has length 83
[2025-05-07 17:29:12,163 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:12,163 INFO  L485      AbstractCegarLoop]: Abstraction has 92 states and 95 transitions.
[2025-05-07 17:29:12,163 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (23), 1 states have call predecessors, (23), 3 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23)
[2025-05-07 17:29:12,163 INFO  L278                IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions.
[2025-05-07 17:29:12,164 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-05-07 17:29:12,164 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:12,164 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]
[2025-05-07 17:29:12,164 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:29:12,164 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:12,164 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:12,164 INFO  L85        PathProgramCache]: Analyzing trace with hash -1947097350, now seen corresponding path program 1 times
[2025-05-07 17:29:12,165 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:12,165 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042400537]
[2025-05-07 17:29:12,165 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:12,165 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:12,193 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-05-07 17:29:12,212 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-05-07 17:29:12,212 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:12,212 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:12,365 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:29:12,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:12,365 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042400537]
[2025-05-07 17:29:12,365 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042400537] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:12,365 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:12,365 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:29:12,365 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407615205]
[2025-05-07 17:29:12,365 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:12,366 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:29:12,366 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:12,366 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:29:12,366 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:12,366 INFO  L87              Difference]: Start difference. First operand 92 states and 95 transitions. Second operand  has 7 states, 5 states have (on average 7.4) internal successors, (37), 7 states have internal predecessors, (37), 5 states have call successors, (23), 1 states have call predecessors, (23), 5 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:29:12,416 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:12,417 INFO  L93              Difference]: Finished difference Result 94 states and 96 transitions.
[2025-05-07 17:29:12,417 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:29:12,417 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 7.4) internal successors, (37), 7 states have internal predecessors, (37), 5 states have call successors, (23), 1 states have call predecessors, (23), 5 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) Word has length 83
[2025-05-07 17:29:12,418 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:12,418 INFO  L225             Difference]: With dead ends: 94
[2025-05-07 17:29:12,418 INFO  L226             Difference]: Without dead ends: 88
[2025-05-07 17:29:12,419 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:12,419 INFO  L437           NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:12,420 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 522 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:12,420 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 88 states.
[2025-05-07 17:29:12,424 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88.
[2025-05-07 17:29:12,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 88 states, 39 states have (on average 1.0) internal successors, (39), 39 states have internal predecessors, (39), 24 states have call successors, (25), 24 states have call predecessors, (25), 24 states have return successors, (25), 24 states have call predecessors, (25), 24 states have call successors, (25)
[2025-05-07 17:29:12,425 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions.
[2025-05-07 17:29:12,425 INFO  L79                 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 83
[2025-05-07 17:29:12,426 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:12,426 INFO  L485      AbstractCegarLoop]: Abstraction has 88 states and 89 transitions.
[2025-05-07 17:29:12,426 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 7.4) internal successors, (37), 7 states have internal predecessors, (37), 5 states have call successors, (23), 1 states have call predecessors, (23), 5 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:29:12,426 INFO  L278                IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions.
[2025-05-07 17:29:12,427 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-05-07 17:29:12,427 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:12,427 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]
[2025-05-07 17:29:12,427 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:29:12,427 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:12,428 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:12,428 INFO  L85        PathProgramCache]: Analyzing trace with hash 599345832, now seen corresponding path program 1 times
[2025-05-07 17:29:12,428 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:12,428 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258760205]
[2025-05-07 17:29:12,428 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:12,428 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:12,461 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-05-07 17:29:12,479 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-05-07 17:29:12,479 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:12,479 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:13,317 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:29:13,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:13,317 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258760205]
[2025-05-07 17:29:13,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258760205] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:13,317 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:13,317 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26
[2025-05-07 17:29:13,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260912813]
[2025-05-07 17:29:13,318 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:13,318 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2025-05-07 17:29:13,318 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:13,319 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2025-05-07 17:29:13,319 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650
[2025-05-07 17:29:13,319 INFO  L87              Difference]: Start difference. First operand 88 states and 89 transitions. Second operand  has 26 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 21 states have internal predecessors, (37), 11 states have call successors, (23), 1 states have call predecessors, (23), 19 states have return successors, (23), 20 states have call predecessors, (23), 11 states have call successors, (23)
[2025-05-07 17:29:13,746 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:13,746 INFO  L93              Difference]: Finished difference Result 95 states and 98 transitions.
[2025-05-07 17:29:13,746 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2025-05-07 17:29:13,747 INFO  L79                 Accepts]: Start accepts. Automaton has  has 26 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 21 states have internal predecessors, (37), 11 states have call successors, (23), 1 states have call predecessors, (23), 19 states have return successors, (23), 20 states have call predecessors, (23), 11 states have call successors, (23) Word has length 83
[2025-05-07 17:29:13,747 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:13,747 INFO  L225             Difference]: With dead ends: 95
[2025-05-07 17:29:13,747 INFO  L226             Difference]: Without dead ends: 84
[2025-05-07 17:29:13,748 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=859, Unknown=0, NotChecked=0, Total=930
[2025-05-07 17:29:13,748 INFO  L437           NwaCegarLoop]: 72 mSDtfsCounter, 5 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:13,749 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1745 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:29:13,749 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2025-05-07 17:29:13,752 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2025-05-07 17:29:13,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 37 states have (on average 1.0) internal successors, (37), 37 states have internal predecessors, (37), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23)
[2025-05-07 17:29:13,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 83 transitions.
[2025-05-07 17:29:13,753 INFO  L79                 Accepts]: Start accepts. Automaton has 84 states and 83 transitions. Word has length 83
[2025-05-07 17:29:13,754 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:13,754 INFO  L485      AbstractCegarLoop]: Abstraction has 84 states and 83 transitions.
[2025-05-07 17:29:13,754 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 21 states have internal predecessors, (37), 11 states have call successors, (23), 1 states have call predecessors, (23), 19 states have return successors, (23), 20 states have call predecessors, (23), 11 states have call successors, (23)
[2025-05-07 17:29:13,754 INFO  L278                IsEmpty]: Start isEmpty. Operand 84 states and 83 transitions.
[2025-05-07 17:29:13,755 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-05-07 17:29:13,755 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:13,755 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]
[2025-05-07 17:29:13,755 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:29:13,756 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:13,756 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:13,756 INFO  L85        PathProgramCache]: Analyzing trace with hash 635975580, now seen corresponding path program 1 times
[2025-05-07 17:29:13,756 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:13,756 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393005407]
[2025-05-07 17:29:13,756 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:13,756 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:13,798 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-05-07 17:29:13,823 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-05-07 17:29:13,823 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:13,823 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:13,911 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:29:13,911 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:13,911 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393005407]
[2025-05-07 17:29:13,911 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393005407] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:13,911 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:13,911 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:29:13,911 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795699544]
[2025-05-07 17:29:13,911 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:13,912 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:29:13,912 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:13,912 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:29:13,912 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:13,913 INFO  L87              Difference]: Start difference. First operand 84 states and 83 transitions. Second operand  has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (23), 1 states have call predecessors, (23), 6 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23)
[2025-05-07 17:29:13,939 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:13,939 INFO  L93              Difference]: Finished difference Result 78 states and 77 transitions.
[2025-05-07 17:29:13,939 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:29:13,940 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (23), 1 states have call predecessors, (23), 6 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23) Word has length 83
[2025-05-07 17:29:13,940 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:13,940 INFO  L225             Difference]: With dead ends: 78
[2025-05-07 17:29:13,940 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:29:13,940 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:29:13,941 INFO  L437           NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:13,941 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 428 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:13,942 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:29:13,942 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:29:13,942 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:29:13,942 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:29:13,942 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83
[2025-05-07 17:29:13,942 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:13,942 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:29:13,942 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 4 states have call successors, (23), 1 states have call predecessors, (23), 6 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23)
[2025-05-07 17:29:13,942 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:29:13,943 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:29:13,945 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:29:13,945 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:29:13,948 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:13,950 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:29:13,953 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:29:13 BoogieIcfgContainer
[2025-05-07 17:29:13,953 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:29:13,954 INFO  L158              Benchmark]: Toolchain (without parser) took 3619.65ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 149.7MB in the beginning and 121.5MB in the end (delta: 28.2MB). Peak memory consumption was 81.2MB. Max. memory is 33.6GB.
[2025-05-07 17:29:13,954 INFO  L158              Benchmark]: SmtParser took 0.28ms. Allocated memory is still 234.9MB. Free memory is still 174.0MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:13,955 INFO  L158              Benchmark]: ChcToBoogie took 29.73ms. Allocated memory is still 234.9MB. Free memory was 149.7MB in the beginning and 146.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:13,955 INFO  L158              Benchmark]: Boogie Preprocessor took 53.14ms. Allocated memory is still 234.9MB. Free memory was 146.9MB in the beginning and 143.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:13,955 INFO  L158              Benchmark]: RCFGBuilder took 414.40ms. Allocated memory is still 234.9MB. Free memory was 143.6MB in the beginning and 176.0MB in the end (delta: -32.4MB). Peak memory consumption was 43.9MB. Max. memory is 33.6GB.
[2025-05-07 17:29:13,955 INFO  L158              Benchmark]: TraceAbstraction took 3118.79ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 175.2MB in the beginning and 121.5MB in the end (delta: 53.7MB). Peak memory consumption was 104.4MB. Max. memory is 33.6GB.
[2025-05-07 17:29:13,956 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.28ms. Allocated memory is still 234.9MB. Free memory is still 174.0MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 29.73ms. Allocated memory is still 234.9MB. Free memory was 149.7MB in the beginning and 146.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 53.14ms. Allocated memory is still 234.9MB. Free memory was 146.9MB in the beginning and 143.6MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 414.40ms. Allocated memory is still 234.9MB. Free memory was 143.6MB in the beginning and 176.0MB in the end (delta: -32.4MB). Peak memory consumption was 43.9MB. Max. memory is 33.6GB.
 * TraceAbstraction took 3118.79ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 175.2MB in the beginning and 121.5MB in the end (delta: 53.7MB). Peak memory consumption was 104.4MB. 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 27 procedures, 111 locations, 176 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 5605 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4685 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 650 IncrementalHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 920 mSDtfsCounter, 650 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=0, InterpolantAutomatonStates: 72, 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, 9 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 638 ConstructedInterpolants, 0 QuantifiedInterpolants, 927 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-05-07 17:29:13,968 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
