./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/constructor_hierarchy_base_calls_with_side_effects_9.sol_2_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:28:44,891 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:28:44,928 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8980b83e-d052-4603-a237-3c06a3fcb6a3/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:28:44,931 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:28:44,932 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:28:44,945 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:28:44,945 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:28:44,945 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:28:44,946 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:28:44,946 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:28:44,946 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:28:44,946 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:28:44,946 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:28:44,946 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:28:44,946 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:28:44,946 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:28:44,946 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:28:44,946 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:28:44,946 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:44,946 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:28:44,947 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:28:44,947 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:28:44,947 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:28:44,947 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:28:44,947 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:28:44,947 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:28:44,947 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:28:45,123 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:28:45,131 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:28:45,133 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:28:45,134 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:28:45,135 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:28:45,136 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8980b83e-d052-4603-a237-3c06a3fcb6a3/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/constructor_hierarchy_base_calls_with_side_effects_9.sol_2_no_adts_000.smt2
[2025-05-07 17:28:45,136 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:28:45,139 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:28:45,369 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8980b83e-d052-4603-a237-3c06a3fcb6a3/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/constructor_hierarchy_base_calls_with_side_effects_9.sol_2_no_adts_000.smt2
[2025-05-07 17:28:45,371 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:28:45,372 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:28:45,372 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:28:45,373 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:28:45,373 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:28:45,374 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:45" (1/1) ...
[2025-05-07 17:28:45,403 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:45 Unit
[2025-05-07 17:28:45,403 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:28:45,404 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:28:45,404 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:28:45,404 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:28:45,416 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:45" (1/1) ...
[2025-05-07 17:28:45,416 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:45" (1/1) ...
[2025-05-07 17:28:45,438 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:45" (1/1) ...
[2025-05-07 17:28:45,438 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:45" (1/1) ...
[2025-05-07 17:28:45,442 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:45" (1/1) ...
[2025-05-07 17:28:45,443 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:45" (1/1) ...
[2025-05-07 17:28:45,445 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:45" (1/1) ...
[2025-05-07 17:28:45,447 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:45" (1/1) ...
[2025-05-07 17:28:45,448 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:45" (1/1) ...
[2025-05-07 17:28:45,458 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:28:45,458 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:28:45,458 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:28:45,458 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:28:45,459 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:45" (1/1) ...
[2025-05-07 17:28:45,461 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:45,470 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:45,480 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-05-07 17:28:45,482 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:28:45,491 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:28:45,492 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:28:45,492 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:28:45,492 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_5_0 given in one single declaration
[2025-05-07 17:28:45,492 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_5_0
[2025-05-07 17:28:45,492 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_5_0
[2025-05-07 17:28:45,492 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_7_C_59_0 given in one single declaration
[2025-05-07 17:28:45,492 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_7_C_59_0
[2025-05-07 17:28:45,492 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_7_C_59_0
[2025-05-07 17:28:45,492 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_33_C_59_0 given in one single declaration
[2025-05-07 17:28:45,492 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_33_C_59_0
[2025-05-07 17:28:45,492 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_33_C_59_0
[2025-05-07 17:28:45,493 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_35_C_59_0 given in one single declaration
[2025-05-07 17:28:45,493 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_35_C_59_0
[2025-05-07 17:28:45,493 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_35_C_59_0
[2025-05-07 17:28:45,493 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_34_C_59_0 given in one single declaration
[2025-05-07 17:28:45,493 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_34_C_59_0
[2025-05-07 17:28:45,493 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_34_C_59_0
[2025-05-07 17:28:45,493 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_10_constructor_58_59_0 given in one single declaration
[2025-05-07 17:28:45,493 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_10_constructor_58_59_0
[2025-05-07 17:28:45,493 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_10_constructor_58_59_0
[2025-05-07 17:28:45,493 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_31_constructor_58_59_0 given in one single declaration
[2025-05-07 17:28:45,493 INFO  L130     BoogieDeclarations]: Found specification of procedure block_31_constructor_58_59_0
[2025-05-07 17:28:45,493 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_31_constructor_58_59_0
[2025-05-07 17:28:45,494 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_27__57_59_0 given in one single declaration
[2025-05-07 17:28:45,494 INFO  L130     BoogieDeclarations]: Found specification of procedure block_27__57_59_0
[2025-05-07 17:28:45,494 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_27__57_59_0
[2025-05-07 17:28:45,494 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_26_constructor_58_59_0 given in one single declaration
[2025-05-07 17:28:45,494 INFO  L130     BoogieDeclarations]: Found specification of procedure block_26_constructor_58_59_0
[2025-05-07 17:28:45,494 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_26_constructor_58_59_0
[2025-05-07 17:28:45,494 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_28_return_constructor_58_59_0 given in one single declaration
[2025-05-07 17:28:45,494 INFO  L130     BoogieDeclarations]: Found specification of procedure block_28_return_constructor_58_59_0
[2025-05-07 17:28:45,494 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_28_return_constructor_58_59_0
[2025-05-07 17:28:45,494 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_29_constructor_58_59_0 given in one single declaration
[2025-05-07 17:28:45,494 INFO  L130     BoogieDeclarations]: Found specification of procedure block_29_constructor_58_59_0
[2025-05-07 17:28:45,494 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_29_constructor_58_59_0
[2025-05-07 17:28:45,494 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_32_constructor_58_59_0 given in one single declaration
[2025-05-07 17:28:45,494 INFO  L130     BoogieDeclarations]: Found specification of procedure block_32_constructor_58_59_0
[2025-05-07 17:28:45,495 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_32_constructor_58_59_0
[2025-05-07 17:28:45,495 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_30_constructor_58_59_0 given in one single declaration
[2025-05-07 17:28:45,495 INFO  L130     BoogieDeclarations]: Found specification of procedure block_30_constructor_58_59_0
[2025-05-07 17:28:45,495 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_30_constructor_58_59_0
[2025-05-07 17:28:45,495 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_39_A_24_0 given in one single declaration
[2025-05-07 17:28:45,495 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_39_A_24_0
[2025-05-07 17:28:45,495 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_39_A_24_0
[2025-05-07 17:28:45,495 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_8_constructor_9_59_0 given in one single declaration
[2025-05-07 17:28:45,495 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_8_constructor_9_59_0
[2025-05-07 17:28:45,495 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_8_constructor_9_59_0
[2025-05-07 17:28:45,495 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_38_return_constructor_9_59_0 given in one single declaration
[2025-05-07 17:28:45,495 INFO  L130     BoogieDeclarations]: Found specification of procedure block_38_return_constructor_9_59_0
[2025-05-07 17:28:45,495 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_38_return_constructor_9_59_0
[2025-05-07 17:28:45,495 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_37__8_59_0 given in one single declaration
[2025-05-07 17:28:45,495 INFO  L130     BoogieDeclarations]: Found specification of procedure block_37__8_59_0
[2025-05-07 17:28:45,496 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_37__8_59_0
[2025-05-07 17:28:45,496 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_36_constructor_9_59_0 given in one single declaration
[2025-05-07 17:28:45,496 INFO  L130     BoogieDeclarations]: Found specification of procedure block_36_constructor_9_59_0
[2025-05-07 17:28:45,496 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_36_constructor_9_59_0
[2025-05-07 17:28:45,496 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_41_A_24_0 given in one single declaration
[2025-05-07 17:28:45,496 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_41_A_24_0
[2025-05-07 17:28:45,496 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_41_A_24_0
[2025-05-07 17:28:45,496 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_40_A_24_0 given in one single declaration
[2025-05-07 17:28:45,496 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_40_A_24_0
[2025-05-07 17:28:45,496 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_40_A_24_0
[2025-05-07 17:28:45,496 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_43_function_f__23_59_0 given in one single declaration
[2025-05-07 17:28:45,496 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_43_function_f__23_59_0
[2025-05-07 17:28:45,496 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_43_function_f__23_59_0
[2025-05-07 17:28:45,496 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_9_function_f__23_59_0 given in one single declaration
[2025-05-07 17:28:45,496 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_9_function_f__23_59_0
[2025-05-07 17:28:45,497 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_9_function_f__23_59_0
[2025-05-07 17:28:45,497 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_24_return_function_f__23_59_0 given in one single declaration
[2025-05-07 17:28:45,497 INFO  L130     BoogieDeclarations]: Found specification of procedure block_24_return_function_f__23_59_0
[2025-05-07 17:28:45,497 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_24_return_function_f__23_59_0
[2025-05-07 17:28:45,497 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_23_f_22_59_0 given in one single declaration
[2025-05-07 17:28:45,497 INFO  L130     BoogieDeclarations]: Found specification of procedure block_23_f_22_59_0
[2025-05-07 17:28:45,497 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_23_f_22_59_0
[2025-05-07 17:28:45,497 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_22_function_f__23_59_0 given in one single declaration
[2025-05-07 17:28:45,497 INFO  L130     BoogieDeclarations]: Found specification of procedure block_22_function_f__23_59_0
[2025-05-07 17:28:45,497 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_22_function_f__23_59_0
[2025-05-07 17:28:45,497 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_42_C_59_0 given in one single declaration
[2025-05-07 17:28:45,497 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_42_C_59_0
[2025-05-07 17:28:45,497 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_42_C_59_0
[2025-05-07 17:28:45,497 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:28:45,497 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:28:45,498 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:28:45,645 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:28:45,648 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:28:45,876 INFO  L?                        ?]: Removed 251 outVars from TransFormulas that were not future-live.
[2025-05-07 17:28:45,876 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:28:45,885 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:28:45,885 INFO  L312             CfgBuilder]: Removed 13 assume(true) statements.
[2025-05-07 17:28:45,885 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:45 BoogieIcfgContainer
[2025-05-07 17:28:45,885 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:28:45,887 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:28:45,887 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:28:45,889 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:28:45,889 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:45" (1/3) ...
[2025-05-07 17:28:45,890 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b38281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:28:45, skipping insertion in model container
[2025-05-07 17:28:45,890 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:45" (2/3) ...
[2025-05-07 17:28:45,890 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35b38281 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:28:45, skipping insertion in model container
[2025-05-07 17:28:45,890 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:45" (3/3) ...
[2025-05-07 17:28:45,891 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:28:45,900 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:28:45,902 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 28 procedures, 116 locations, 185 edges, 28 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:28:45,930 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:28:45,939 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;@36e40d4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:28:45,939 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:28:45,942 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 116 states, 47 states have (on average 1.127659574468085) internal successors, (53), 53 states have internal predecessors, (53), 40 states have call successors, (44), 27 states have call predecessors, (44), 27 states have return successors, (44), 35 states have call predecessors, (44), 40 states have call successors, (44)
[2025-05-07 17:28:45,949 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-05-07 17:28:45,949 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:45,949 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:28:45,949 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:45,953 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:45,953 INFO  L85        PathProgramCache]: Analyzing trace with hash 1218634239, now seen corresponding path program 1 times
[2025-05-07 17:28:45,958 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:45,958 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560492978]
[2025-05-07 17:28:45,959 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:45,959 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:45,991 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-05-07 17:28:46,034 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-05-07 17:28:46,035 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:46,035 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:46,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:46,213 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:46,213 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560492978]
[2025-05-07 17:28:46,213 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560492978] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:46,214 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:46,216 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:46,217 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069402964]
[2025-05-07 17:28:46,218 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:46,220 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:46,221 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:46,258 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:46,259 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:46,261 INFO  L87              Difference]: Start difference. First operand  has 116 states, 47 states have (on average 1.127659574468085) internal successors, (53), 53 states have internal predecessors, (53), 40 states have call successors, (44), 27 states have call predecessors, (44), 27 states have return successors, (44), 35 states have call predecessors, (44), 40 states have call successors, (44) Second operand  has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 3 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:28:46,383 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:46,384 INFO  L93              Difference]: Finished difference Result 116 states and 140 transitions.
[2025-05-07 17:28:46,385 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:46,386 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), 3 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9) Word has length 33
[2025-05-07 17:28:46,386 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:46,393 INFO  L225             Difference]: With dead ends: 116
[2025-05-07 17:28:46,393 INFO  L226             Difference]: Without dead ends: 114
[2025-05-07 17:28:46,394 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:46,396 INFO  L437           NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 762 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:28:46,396 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 762 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:46,406 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2025-05-07 17:28:46,422 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112.
[2025-05-07 17:28:46,423 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 112 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 50 states have internal predecessors, (50), 38 states have call successors, (42), 27 states have call predecessors, (42), 27 states have return successors, (42), 34 states have call predecessors, (42), 38 states have call successors, (42)
[2025-05-07 17:28:46,426 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions.
[2025-05-07 17:28:46,427 INFO  L79                 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 33
[2025-05-07 17:28:46,427 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:46,427 INFO  L485      AbstractCegarLoop]: Abstraction has 112 states and 134 transitions.
[2025-05-07 17:28:46,427 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), 3 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:28:46,427 INFO  L278                IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions.
[2025-05-07 17:28:46,429 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2025-05-07 17:28:46,429 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:46,429 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]
[2025-05-07 17:28:46,429 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:28:46,430 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:46,430 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:46,430 INFO  L85        PathProgramCache]: Analyzing trace with hash 1358710069, now seen corresponding path program 1 times
[2025-05-07 17:28:46,430 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:46,430 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153168845]
[2025-05-07 17:28:46,430 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:46,430 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:46,461 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes.
[2025-05-07 17:28:46,486 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements.
[2025-05-07 17:28:46,486 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:46,486 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:46,595 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:46,596 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:46,596 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153168845]
[2025-05-07 17:28:46,596 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153168845] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:46,596 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:46,596 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:46,596 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809960595]
[2025-05-07 17:28:46,596 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:46,597 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:46,597 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:46,597 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:46,597 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:46,598 INFO  L87              Difference]: Start difference. First operand 112 states and 134 transitions. Second operand  has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:28:46,643 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:46,643 INFO  L93              Difference]: Finished difference Result 112 states and 133 transitions.
[2025-05-07 17:28:46,644 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:46,644 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16) Word has length 59
[2025-05-07 17:28:46,644 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:46,645 INFO  L225             Difference]: With dead ends: 112
[2025-05-07 17:28:46,645 INFO  L226             Difference]: Without dead ends: 110
[2025-05-07 17:28:46,645 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:46,645 INFO  L437           NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 635 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:28:46,646 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 635 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:46,646 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 110 states.
[2025-05-07 17:28:46,651 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110.
[2025-05-07 17:28:46,651 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 110 states, 46 states have (on average 1.065217391304348) internal successors, (49), 49 states have internal predecessors, (49), 36 states have call successors, (40), 27 states have call predecessors, (40), 27 states have return successors, (40), 33 states have call predecessors, (40), 36 states have call successors, (40)
[2025-05-07 17:28:46,652 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions.
[2025-05-07 17:28:46,652 INFO  L79                 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 59
[2025-05-07 17:28:46,652 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:46,652 INFO  L485      AbstractCegarLoop]: Abstraction has 110 states and 129 transitions.
[2025-05-07 17:28:46,653 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:28:46,653 INFO  L278                IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions.
[2025-05-07 17:28:46,654 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2025-05-07 17:28:46,654 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:46,654 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]
[2025-05-07 17:28:46,654 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:28:46,654 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:46,654 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:46,654 INFO  L85        PathProgramCache]: Analyzing trace with hash -1697168079, now seen corresponding path program 1 times
[2025-05-07 17:28:46,654 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:46,654 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544277369]
[2025-05-07 17:28:46,654 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:46,655 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:46,672 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes.
[2025-05-07 17:28:46,676 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements.
[2025-05-07 17:28:46,676 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:46,676 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:46,727 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:46,727 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:46,727 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544277369]
[2025-05-07 17:28:46,727 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544277369] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:46,727 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:46,727 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:46,728 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689451967]
[2025-05-07 17:28:46,728 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:46,728 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:46,728 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:46,728 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:46,729 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:46,729 INFO  L87              Difference]: Start difference. First operand 110 states and 129 transitions. Second operand  has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:28:46,761 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:46,761 INFO  L93              Difference]: Finished difference Result 110 states and 126 transitions.
[2025-05-07 17:28:46,761 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:46,762 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 59
[2025-05-07 17:28:46,762 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:46,763 INFO  L225             Difference]: With dead ends: 110
[2025-05-07 17:28:46,763 INFO  L226             Difference]: Without dead ends: 109
[2025-05-07 17:28:46,763 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:46,763 INFO  L437           NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:46,764 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 354 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:46,764 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 109 states.
[2025-05-07 17:28:46,769 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107.
[2025-05-07 17:28:46,769 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 107 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 33 states have call successors, (37), 27 states have call predecessors, (37), 27 states have return successors, (37), 31 states have call predecessors, (37), 33 states have call successors, (37)
[2025-05-07 17:28:46,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions.
[2025-05-07 17:28:46,770 INFO  L79                 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 59
[2025-05-07 17:28:46,770 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:46,770 INFO  L485      AbstractCegarLoop]: Abstraction has 107 states and 122 transitions.
[2025-05-07 17:28:46,770 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 4 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:28:46,770 INFO  L278                IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions.
[2025-05-07 17:28:46,771 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2025-05-07 17:28:46,771 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:46,772 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:46,772 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:28:46,772 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:46,772 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:46,772 INFO  L85        PathProgramCache]: Analyzing trace with hash -965196121, now seen corresponding path program 1 times
[2025-05-07 17:28:46,772 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:46,772 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236916069]
[2025-05-07 17:28:46,772 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:46,772 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:46,804 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes.
[2025-05-07 17:28:46,808 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements.
[2025-05-07 17:28:46,808 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:46,808 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:46,890 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:46,890 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:46,890 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236916069]
[2025-05-07 17:28:46,890 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236916069] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:46,890 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:46,890 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:46,890 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529993962]
[2025-05-07 17:28:46,891 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:46,891 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:46,891 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:46,892 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:46,892 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:46,892 INFO  L87              Difference]: Start difference. First operand 107 states and 122 transitions. Second operand  has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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:28:46,903 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:46,903 INFO  L93              Difference]: Finished difference Result 109 states and 123 transitions.
[2025-05-07 17:28:46,903 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:46,904 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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 84
[2025-05-07 17:28:46,904 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:46,905 INFO  L225             Difference]: With dead ends: 109
[2025-05-07 17:28:46,905 INFO  L226             Difference]: Without dead ends: 103
[2025-05-07 17:28:46,905 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:46,906 INFO  L437           NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:46,906 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 356 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:46,907 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103 states.
[2025-05-07 17:28:46,913 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103.
[2025-05-07 17:28:46,913 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 103 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 47 states have internal predecessors, (47), 29 states have call successors, (33), 27 states have call predecessors, (33), 27 states have return successors, (33), 28 states have call predecessors, (33), 29 states have call successors, (33)
[2025-05-07 17:28:46,914 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions.
[2025-05-07 17:28:46,914 INFO  L79                 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 84
[2025-05-07 17:28:46,914 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:46,914 INFO  L485      AbstractCegarLoop]: Abstraction has 103 states and 113 transitions.
[2025-05-07 17:28:46,914 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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:28:46,915 INFO  L278                IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions.
[2025-05-07 17:28:46,916 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2025-05-07 17:28:46,916 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:46,916 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:46,916 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:28:46,916 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:46,917 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:46,917 INFO  L85        PathProgramCache]: Analyzing trace with hash -974141753, now seen corresponding path program 1 times
[2025-05-07 17:28:46,917 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:46,917 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327130297]
[2025-05-07 17:28:46,917 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:46,917 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:46,952 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes.
[2025-05-07 17:28:46,977 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements.
[2025-05-07 17:28:46,977 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:46,977 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:47,086 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:47,087 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:47,087 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327130297]
[2025-05-07 17:28:47,087 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327130297] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:47,087 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:47,087 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:47,087 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942560820]
[2025-05-07 17:28:47,087 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:47,088 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:47,088 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:47,089 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:47,089 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:47,089 INFO  L87              Difference]: Start difference. First operand 103 states and 113 transitions. Second operand  has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 6 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:28:47,138 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:47,138 INFO  L93              Difference]: Finished difference Result 113 states and 127 transitions.
[2025-05-07 17:28:47,138 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:47,139 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 6 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) Word has length 84
[2025-05-07 17:28:47,139 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:47,140 INFO  L225             Difference]: With dead ends: 113
[2025-05-07 17:28:47,140 INFO  L226             Difference]: Without dead ends: 99
[2025-05-07 17:28:47,140 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:47,141 INFO  L437           NwaCegarLoop]: 109 mSDtfsCounter, 1 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:47,141 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 643 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:47,142 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2025-05-07 17:28:47,147 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99.
[2025-05-07 17:28:47,147 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 99 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 45 states have internal predecessors, (45), 28 states have call successors, (31), 26 states have call predecessors, (31), 26 states have return successors, (31), 27 states have call predecessors, (31), 28 states have call successors, (31)
[2025-05-07 17:28:47,148 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions.
[2025-05-07 17:28:47,148 INFO  L79                 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 84
[2025-05-07 17:28:47,149 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:47,149 INFO  L485      AbstractCegarLoop]: Abstraction has 99 states and 107 transitions.
[2025-05-07 17:28:47,149 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 6 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:28:47,149 INFO  L278                IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions.
[2025-05-07 17:28:47,151 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2025-05-07 17:28:47,151 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:47,151 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:47,151 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:28:47,151 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:47,151 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:47,151 INFO  L85        PathProgramCache]: Analyzing trace with hash 1326244163, now seen corresponding path program 1 times
[2025-05-07 17:28:47,152 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:47,152 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260175000]
[2025-05-07 17:28:47,152 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:47,152 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:47,184 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes.
[2025-05-07 17:28:47,201 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements.
[2025-05-07 17:28:47,201 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:47,201 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:47,372 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:47,372 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:47,372 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260175000]
[2025-05-07 17:28:47,372 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260175000] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:47,372 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:47,372 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:47,372 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258930445]
[2025-05-07 17:28:47,372 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:47,372 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:47,372 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:47,373 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:47,373 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:47,373 INFO  L87              Difference]: Start difference. First operand 99 states and 107 transitions. Second operand  has 7 states, 5 states have (on average 7.6) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 5 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:28:47,436 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:47,436 INFO  L93              Difference]: Finished difference Result 103 states and 111 transitions.
[2025-05-07 17:28:47,437 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:47,437 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 7.6) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 5 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23) Word has length 84
[2025-05-07 17:28:47,437 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:47,438 INFO  L225             Difference]: With dead ends: 103
[2025-05-07 17:28:47,438 INFO  L226             Difference]: Without dead ends: 103
[2025-05-07 17:28:47,438 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:28:47,438 INFO  L437           NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:47,438 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 492 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:47,439 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103 states.
[2025-05-07 17:28:47,443 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101.
[2025-05-07 17:28:47,443 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 101 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 46 states have internal predecessors, (46), 28 states have call successors, (31), 26 states have call predecessors, (31), 27 states have return successors, (32), 28 states have call predecessors, (32), 28 states have call successors, (32)
[2025-05-07 17:28:47,443 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions.
[2025-05-07 17:28:47,443 INFO  L79                 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 84
[2025-05-07 17:28:47,444 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:47,444 INFO  L485      AbstractCegarLoop]: Abstraction has 101 states and 109 transitions.
[2025-05-07 17:28:47,444 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 7.6) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 5 states have return successors, (23), 5 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:28:47,444 INFO  L278                IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions.
[2025-05-07 17:28:47,444 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2025-05-07 17:28:47,444 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:47,445 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:47,445 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:28:47,445 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:47,445 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:47,445 INFO  L85        PathProgramCache]: Analyzing trace with hash -239265119, now seen corresponding path program 1 times
[2025-05-07 17:28:47,445 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:47,445 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562338232]
[2025-05-07 17:28:47,445 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:47,445 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:47,474 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes.
[2025-05-07 17:28:47,481 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements.
[2025-05-07 17:28:47,481 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:47,481 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:47,538 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:47,538 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:47,538 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562338232]
[2025-05-07 17:28:47,538 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562338232] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:47,538 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:47,538 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:47,538 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425723322]
[2025-05-07 17:28:47,538 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:47,539 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:47,539 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:47,539 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:47,539 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:47,539 INFO  L87              Difference]: Start difference. First operand 101 states and 109 transitions. Second operand  has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 4 states have call successors, (23), 1 states have call predecessors, (23), 3 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23)
[2025-05-07 17:28:47,551 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:47,552 INFO  L93              Difference]: Finished difference Result 103 states and 110 transitions.
[2025-05-07 17:28:47,552 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:47,552 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 4 states have call successors, (23), 1 states have call predecessors, (23), 3 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 84
[2025-05-07 17:28:47,552 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:47,553 INFO  L225             Difference]: With dead ends: 103
[2025-05-07 17:28:47,553 INFO  L226             Difference]: Without dead ends: 93
[2025-05-07 17:28:47,553 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:47,553 INFO  L437           NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 306 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:28:47,554 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 306 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:47,554 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2025-05-07 17:28:47,556 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93.
[2025-05-07 17:28:47,556 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 93 states, 42 states have (on average 1.0) internal successors, (42), 42 states have internal predecessors, (42), 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:28:47,557 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions.
[2025-05-07 17:28:47,557 INFO  L79                 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 84
[2025-05-07 17:28:47,557 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:47,557 INFO  L485      AbstractCegarLoop]: Abstraction has 93 states and 96 transitions.
[2025-05-07 17:28:47,557 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 4 states have call successors, (23), 1 states have call predecessors, (23), 3 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23)
[2025-05-07 17:28:47,557 INFO  L278                IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions.
[2025-05-07 17:28:47,557 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2025-05-07 17:28:47,558 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:47,558 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:47,558 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:28:47,558 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:47,558 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:47,558 INFO  L85        PathProgramCache]: Analyzing trace with hash -677849051, now seen corresponding path program 1 times
[2025-05-07 17:28:47,558 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:47,558 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979643946]
[2025-05-07 17:28:47,558 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:47,558 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:47,587 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes.
[2025-05-07 17:28:47,603 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements.
[2025-05-07 17:28:47,603 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:47,603 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:47,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:47,717 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:47,717 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979643946]
[2025-05-07 17:28:47,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979643946] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:47,717 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:47,717 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:47,717 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137584105]
[2025-05-07 17:28:47,718 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:47,718 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:47,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:47,718 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:47,718 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:47,718 INFO  L87              Difference]: Start difference. First operand 93 states and 96 transitions. Second operand  has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 6 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:28:47,751 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:47,751 INFO  L93              Difference]: Finished difference Result 102 states and 107 transitions.
[2025-05-07 17:28:47,752 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:47,752 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 6 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) Word has length 84
[2025-05-07 17:28:47,752 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:47,753 INFO  L225             Difference]: With dead ends: 102
[2025-05-07 17:28:47,753 INFO  L226             Difference]: Without dead ends: 89
[2025-05-07 17:28:47,753 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:47,754 INFO  L437           NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 585 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:28:47,754 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 585 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:47,754 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 89 states.
[2025-05-07 17:28:47,757 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89.
[2025-05-07 17:28:47,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 89 states, 40 states have (on average 1.0) internal successors, (40), 40 states have internal predecessors, (40), 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:28:47,758 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions.
[2025-05-07 17:28:47,758 INFO  L79                 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84
[2025-05-07 17:28:47,758 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:47,759 INFO  L485      AbstractCegarLoop]: Abstraction has 89 states and 90 transitions.
[2025-05-07 17:28:47,759 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 6 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:28:47,759 INFO  L278                IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions.
[2025-05-07 17:28:47,759 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2025-05-07 17:28:47,760 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:47,760 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:47,760 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:28:47,760 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:47,760 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:47,760 INFO  L85        PathProgramCache]: Analyzing trace with hash -776613285, now seen corresponding path program 1 times
[2025-05-07 17:28:47,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:47,761 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55281817]
[2025-05-07 17:28:47,761 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:47,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:47,792 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes.
[2025-05-07 17:28:47,813 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements.
[2025-05-07 17:28:47,813 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:47,813 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:48,214 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:48,214 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:48,214 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55281817]
[2025-05-07 17:28:48,214 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55281817] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:48,214 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:48,214 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2025-05-07 17:28:48,214 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819606744]
[2025-05-07 17:28:48,214 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:48,214 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-05-07 17:28:48,215 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:48,215 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-05-07 17:28:48,215 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272
[2025-05-07 17:28:48,216 INFO  L87              Difference]: Start difference. First operand 89 states and 90 transitions. Second operand  has 17 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 8 states have call successors, (23), 1 states have call predecessors, (23), 13 states have return successors, (23), 15 states have call predecessors, (23), 8 states have call successors, (23)
[2025-05-07 17:28:48,409 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:48,409 INFO  L93              Difference]: Finished difference Result 96 states and 99 transitions.
[2025-05-07 17:28:48,410 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-05-07 17:28:48,410 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 8 states have call successors, (23), 1 states have call predecessors, (23), 13 states have return successors, (23), 15 states have call predecessors, (23), 8 states have call successors, (23) Word has length 84
[2025-05-07 17:28:48,410 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:48,410 INFO  L225             Difference]: With dead ends: 96
[2025-05-07 17:28:48,410 INFO  L226             Difference]: Without dead ends: 85
[2025-05-07 17:28:48,411 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380
[2025-05-07 17:28:48,411 INFO  L437           NwaCegarLoop]: 78 mSDtfsCounter, 3 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:48,411 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1218 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:48,411 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 85 states.
[2025-05-07 17:28:48,413 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85.
[2025-05-07 17:28:48,413 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 85 states, 38 states have (on average 1.0) internal successors, (38), 38 states have internal predecessors, (38), 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:28:48,413 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 84 transitions.
[2025-05-07 17:28:48,414 INFO  L79                 Accepts]: Start accepts. Automaton has 85 states and 84 transitions. Word has length 84
[2025-05-07 17:28:48,414 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:48,414 INFO  L485      AbstractCegarLoop]: Abstraction has 85 states and 84 transitions.
[2025-05-07 17:28:48,414 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 13 states have (on average 2.923076923076923) internal successors, (38), 14 states have internal predecessors, (38), 8 states have call successors, (23), 1 states have call predecessors, (23), 13 states have return successors, (23), 15 states have call predecessors, (23), 8 states have call successors, (23)
[2025-05-07 17:28:48,414 INFO  L278                IsEmpty]: Start isEmpty. Operand 85 states and 84 transitions.
[2025-05-07 17:28:48,414 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2025-05-07 17:28:48,414 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:48,414 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:48,414 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:28:48,414 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:48,415 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:48,415 INFO  L85        PathProgramCache]: Analyzing trace with hash -2039923917, now seen corresponding path program 1 times
[2025-05-07 17:28:48,415 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:48,415 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791950298]
[2025-05-07 17:28:48,415 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:48,415 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:48,448 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes.
[2025-05-07 17:28:48,462 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements.
[2025-05-07 17:28:48,462 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:48,462 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:48,548 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:48,548 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:48,548 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791950298]
[2025-05-07 17:28:48,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791950298] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:48,548 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:48,548 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:48,548 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685136089]
[2025-05-07 17:28:48,548 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:48,549 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:48,549 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:48,549 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:48,549 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:48,550 INFO  L87              Difference]: Start difference. First operand 85 states and 84 transitions. Second operand  has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 6 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:28:48,579 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:48,579 INFO  L93              Difference]: Finished difference Result 79 states and 78 transitions.
[2025-05-07 17:28:48,579 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:48,580 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 6 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) Word has length 84
[2025-05-07 17:28:48,580 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:48,580 INFO  L225             Difference]: With dead ends: 79
[2025-05-07 17:28:48,580 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:28:48,580 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:48,580 INFO  L437           NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 434 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:28:48,581 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 434 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:48,581 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:28:48,581 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:28:48,581 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-05-07 17:28:48,581 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:28:48,581 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84
[2025-05-07 17:28:48,581 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:48,581 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:28:48,581 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 6 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:28:48,581 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:28:48,582 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:28:48,583 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:28:48,584 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:28:48,586 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:48,588 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:28:48,590 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:28:48 BoogieIcfgContainer
[2025-05-07 17:28:48,590 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:28:48,591 INFO  L158              Benchmark]: Toolchain (without parser) took 3218.90ms. Allocated memory is still 234.9MB. Free memory was 147.9MB in the beginning and 133.7MB in the end (delta: 14.2MB). Peak memory consumption was 11.4MB. Max. memory is 33.6GB.
[2025-05-07 17:28:48,591 INFO  L158              Benchmark]: SmtParser took 0.23ms. Allocated memory is still 234.9MB. Free memory is still 173.1MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:48,591 INFO  L158              Benchmark]: ChcToBoogie took 30.98ms. Allocated memory is still 234.9MB. Free memory was 147.8MB in the beginning and 144.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:48,591 INFO  L158              Benchmark]: Boogie Preprocessor took 53.93ms. Allocated memory is still 234.9MB. Free memory was 144.9MB in the beginning and 141.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:48,591 INFO  L158              Benchmark]: RCFGBuilder took 427.20ms. Allocated memory is still 234.9MB. Free memory was 141.4MB in the beginning and 171.3MB in the end (delta: -29.9MB). Peak memory consumption was 43.5MB. Max. memory is 33.6GB.
[2025-05-07 17:28:48,591 INFO  L158              Benchmark]: TraceAbstraction took 2703.54ms. Allocated memory is still 234.9MB. Free memory was 170.5MB in the beginning and 133.7MB in the end (delta: 36.8MB). Peak memory consumption was 35.0MB. Max. memory is 33.6GB.
[2025-05-07 17:28:48,592 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.23ms. Allocated memory is still 234.9MB. Free memory is still 173.1MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 30.98ms. Allocated memory is still 234.9MB. Free memory was 147.8MB in the beginning and 144.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 53.93ms. Allocated memory is still 234.9MB. Free memory was 144.9MB in the beginning and 141.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 427.20ms. Allocated memory is still 234.9MB. Free memory was 141.4MB in the beginning and 171.3MB in the end (delta: -29.9MB). Peak memory consumption was 43.5MB. Max. memory is 33.6GB.
 * TraceAbstraction took 2703.54ms. Allocated memory is still 234.9MB. Free memory was 170.5MB in the beginning and 133.7MB in the end (delta: 36.8MB). Peak memory consumption was 35.0MB. 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 28 procedures, 116 locations, 185 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 5785 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4709 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 395 IncrementalHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 1076 mSDtfsCounter, 395 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=116occurred in iteration=0, InterpolantAutomatonStates: 70, 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, 10 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 739 NumberOfCodeBlocks, 739 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 729 ConstructedInterpolants, 0 QuantifiedInterpolants, 976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:28:48,603 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
