./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/functions/constructor_hierarchy_3.sol_1_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:28:24,942 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:28:24,996 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a1c2b3e-a290-4bf0-b7bd-930232cf9536/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:28:25,000 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:28:25,000 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:28:25,016 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:28:25,017 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:28:25,017 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:28:25,017 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:28:25,017 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:28:25,018 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:28:25,018 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:28:25,018 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:28:25,018 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:28:25,018 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:28:25,018 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:28:25,018 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:28:25,018 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:28:25,018 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:25,019 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:28:25,019 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:28:25,019 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:28:25,019 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:28:25,019 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:28:25,019 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:28:25,020 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:28:25,020 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:28:25,221 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:28:25,229 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:28:25,231 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:28:25,232 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:28:25,232 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:28:25,233 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a1c2b3e-a290-4bf0-b7bd-930232cf9536/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/functions/constructor_hierarchy_3.sol_1_no_adts_000.smt2
[2025-05-07 17:28:25,234 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:28:25,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:28:25,474 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1a1c2b3e-a290-4bf0-b7bd-930232cf9536/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/functions/constructor_hierarchy_3.sol_1_no_adts_000.smt2
[2025-05-07 17:28:25,476 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:28:25,477 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:28:25,478 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:28:25,478 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:28:25,478 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:28:25,480 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:25" (1/1) ...
[2025-05-07 17:28:25,509 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:25 Unit
[2025-05-07 17:28:25,509 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:28:25,510 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:28:25,510 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:28:25,510 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:28:25,522 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:25" (1/1) ...
[2025-05-07 17:28:25,522 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:25" (1/1) ...
[2025-05-07 17:28:25,544 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:25" (1/1) ...
[2025-05-07 17:28:25,544 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:25" (1/1) ...
[2025-05-07 17:28:25,549 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:25" (1/1) ...
[2025-05-07 17:28:25,551 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:25" (1/1) ...
[2025-05-07 17:28:25,552 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:25" (1/1) ...
[2025-05-07 17:28:25,554 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:25" (1/1) ...
[2025-05-07 17:28:25,555 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:25" (1/1) ...
[2025-05-07 17:28:25,568 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:28:25,569 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:28:25,569 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:28:25,569 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:28:25,570 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:25" (1/1) ...
[2025-05-07 17:28:25,572 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:25,581 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:25,591 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:25,593 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:25,602 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:28:25,602 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:28:25,602 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:28:25,602 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_3_0 given in one single declaration
[2025-05-07 17:28:25,603 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_3_0
[2025-05-07 17:28:25,603 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_3_0
[2025-05-07 17:28:25,603 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_11_A_57_0 given in one single declaration
[2025-05-07 17:28:25,603 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_11_A_57_0
[2025-05-07 17:28:25,603 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_11_A_57_0
[2025-05-07 17:28:25,603 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_40_A_57_0 given in one single declaration
[2025-05-07 17:28:25,603 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_40_A_57_0
[2025-05-07 17:28:25,603 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_40_A_57_0
[2025-05-07 17:28:25,603 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_42_A_57_0 given in one single declaration
[2025-05-07 17:28:25,603 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_42_A_57_0
[2025-05-07 17:28:25,603 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_42_A_57_0
[2025-05-07 17:28:25,603 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_41_A_57_0 given in one single declaration
[2025-05-07 17:28:25,603 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_41_A_57_0
[2025-05-07 17:28:25,603 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_41_A_57_0
[2025-05-07 17:28:25,603 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_14_constructor_56_57_0 given in one single declaration
[2025-05-07 17:28:25,603 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_14_constructor_56_57_0
[2025-05-07 17:28:25,603 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_14_constructor_56_57_0
[2025-05-07 17:28:25,603 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_39_constructor_56_57_0 given in one single declaration
[2025-05-07 17:28:25,603 INFO  L130     BoogieDeclarations]: Found specification of procedure block_39_constructor_56_57_0
[2025-05-07 17:28:25,603 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_39_constructor_56_57_0
[2025-05-07 17:28:25,604 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_36__55_57_0 given in one single declaration
[2025-05-07 17:28:25,604 INFO  L130     BoogieDeclarations]: Found specification of procedure block_36__55_57_0
[2025-05-07 17:28:25,604 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_36__55_57_0
[2025-05-07 17:28:25,604 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_35_constructor_56_57_0 given in one single declaration
[2025-05-07 17:28:25,604 INFO  L130     BoogieDeclarations]: Found specification of procedure block_35_constructor_56_57_0
[2025-05-07 17:28:25,604 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_35_constructor_56_57_0
[2025-05-07 17:28:25,604 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_37_return_constructor_56_57_0 given in one single declaration
[2025-05-07 17:28:25,604 INFO  L130     BoogieDeclarations]: Found specification of procedure block_37_return_constructor_56_57_0
[2025-05-07 17:28:25,604 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_37_return_constructor_56_57_0
[2025-05-07 17:28:25,604 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_38_constructor_56_57_0 given in one single declaration
[2025-05-07 17:28:25,604 INFO  L130     BoogieDeclarations]: Found specification of procedure block_38_constructor_56_57_0
[2025-05-07 17:28:25,604 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_38_constructor_56_57_0
[2025-05-07 17:28:25,604 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_46_B_26_0 given in one single declaration
[2025-05-07 17:28:25,604 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_46_B_26_0
[2025-05-07 17:28:25,604 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_46_B_26_0
[2025-05-07 17:28:25,604 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_13_constructor_25_57_0 given in one single declaration
[2025-05-07 17:28:25,604 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_13_constructor_25_57_0
[2025-05-07 17:28:25,604 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_13_constructor_25_57_0
[2025-05-07 17:28:25,604 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_45_return_constructor_25_57_0 given in one single declaration
[2025-05-07 17:28:25,604 INFO  L130     BoogieDeclarations]: Found specification of procedure block_45_return_constructor_25_57_0
[2025-05-07 17:28:25,605 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_45_return_constructor_25_57_0
[2025-05-07 17:28:25,605 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_44__24_57_0 given in one single declaration
[2025-05-07 17:28:25,605 INFO  L130     BoogieDeclarations]: Found specification of procedure block_44__24_57_0
[2025-05-07 17:28:25,605 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_44__24_57_0
[2025-05-07 17:28:25,605 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_43_constructor_25_57_0 given in one single declaration
[2025-05-07 17:28:25,605 INFO  L130     BoogieDeclarations]: Found specification of procedure block_43_constructor_25_57_0
[2025-05-07 17:28:25,605 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_43_constructor_25_57_0
[2025-05-07 17:28:25,605 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_48_B_26_0 given in one single declaration
[2025-05-07 17:28:25,605 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_48_B_26_0
[2025-05-07 17:28:25,605 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_48_B_26_0
[2025-05-07 17:28:25,605 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_47_B_26_0 given in one single declaration
[2025-05-07 17:28:25,605 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_47_B_26_0
[2025-05-07 17:28:25,605 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_47_B_26_0
[2025-05-07 17:28:25,605 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_55_A_57_0 given in one single declaration
[2025-05-07 17:28:25,605 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_55_A_57_0
[2025-05-07 17:28:25,605 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_55_A_57_0
[2025-05-07 17:28:25,605 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_52_C_13_0 given in one single declaration
[2025-05-07 17:28:25,605 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_52_C_13_0
[2025-05-07 17:28:25,605 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_52_C_13_0
[2025-05-07 17:28:25,605 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_54_C_13_0 given in one single declaration
[2025-05-07 17:28:25,605 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_54_C_13_0
[2025-05-07 17:28:25,606 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_54_C_13_0
[2025-05-07 17:28:25,606 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_53_C_13_0 given in one single declaration
[2025-05-07 17:28:25,606 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_53_C_13_0
[2025-05-07 17:28:25,606 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_53_C_13_0
[2025-05-07 17:28:25,606 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_12_constructor_12_57_0 given in one single declaration
[2025-05-07 17:28:25,606 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_12_constructor_12_57_0
[2025-05-07 17:28:25,606 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_12_constructor_12_57_0
[2025-05-07 17:28:25,606 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_51_return_constructor_12_57_0 given in one single declaration
[2025-05-07 17:28:25,606 INFO  L130     BoogieDeclarations]: Found specification of procedure block_51_return_constructor_12_57_0
[2025-05-07 17:28:25,606 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_51_return_constructor_12_57_0
[2025-05-07 17:28:25,606 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_50__11_57_0 given in one single declaration
[2025-05-07 17:28:25,606 INFO  L130     BoogieDeclarations]: Found specification of procedure block_50__11_57_0
[2025-05-07 17:28:25,606 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_50__11_57_0
[2025-05-07 17:28:25,606 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_49_constructor_12_57_0 given in one single declaration
[2025-05-07 17:28:25,606 INFO  L130     BoogieDeclarations]: Found specification of procedure block_49_constructor_12_57_0
[2025-05-07 17:28:25,606 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_49_constructor_12_57_0
[2025-05-07 17:28:25,606 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:28:25,606 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:28:25,606 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:28:25,746 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:28:25,748 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:28:26,001 INFO  L?                        ?]: Removed 257 outVars from TransFormulas that were not future-live.
[2025-05-07 17:28:26,001 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:28:26,011 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:28:26,011 INFO  L312             CfgBuilder]: Removed 12 assume(true) statements.
[2025-05-07 17:28:26,012 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:26 BoogieIcfgContainer
[2025-05-07 17:28:26,012 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:28:26,014 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:28:26,014 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:28:26,018 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:28:26,018 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:25" (1/3) ...
[2025-05-07 17:28:26,018 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259c836f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:28:26, skipping insertion in model container
[2025-05-07 17:28:26,018 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:25" (2/3) ...
[2025-05-07 17:28:26,019 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@259c836f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:28:26, skipping insertion in model container
[2025-05-07 17:28:26,019 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:26" (3/3) ...
[2025-05-07 17:28:26,020 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:28:26,032 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:28:26,033 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 28 procedures, 117 locations, 185 edges, 28 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:28:26,065 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:28:26,075 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;@3ebb4ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:28:26,075 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:28:26,078 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 117 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 53 states have internal predecessors, (53), 42 states have call successors, (44), 27 states have call predecessors, (44), 27 states have return successors, (44), 36 states have call predecessors, (44), 42 states have call successors, (44)
[2025-05-07 17:28:26,088 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:28:26,089 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:26,089 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:26,089 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:26,094 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:26,094 INFO  L85        PathProgramCache]: Analyzing trace with hash 1392013935, now seen corresponding path program 1 times
[2025-05-07 17:28:26,101 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:26,101 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241029679]
[2025-05-07 17:28:26,101 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:26,102 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:26,140 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:28:26,190 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:28:26,191 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:26,191 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:26,351 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:26,352 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:26,352 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241029679]
[2025-05-07 17:28:26,352 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241029679] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:26,353 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:26,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:26,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932035285]
[2025-05-07 17:28:26,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:26,361 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:26,361 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:26,396 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:26,396 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:26,398 INFO  L87              Difference]: Start difference. First operand  has 117 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 53 states have internal predecessors, (53), 42 states have call successors, (44), 27 states have call predecessors, (44), 27 states have return successors, (44), 36 states have call predecessors, (44), 42 states have call successors, (44) Second operand  has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:28:26,490 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:26,491 INFO  L93              Difference]: Finished difference Result 114 states and 136 transitions.
[2025-05-07 17:28:26,492 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:26,493 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 41
[2025-05-07 17:28:26,494 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:26,501 INFO  L225             Difference]: With dead ends: 114
[2025-05-07 17:28:26,501 INFO  L226             Difference]: Without dead ends: 113
[2025-05-07 17:28:26,503 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:26,506 INFO  L437           NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:26,507 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 650 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:26,520 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2025-05-07 17:28:26,536 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113.
[2025-05-07 17:28:26,537 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 113 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 50 states have internal predecessors, (50), 40 states have call successors, (42), 27 states have call predecessors, (42), 27 states have return successors, (42), 35 states have call predecessors, (42), 40 states have call successors, (42)
[2025-05-07 17:28:26,541 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions.
[2025-05-07 17:28:26,541 INFO  L79                 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 41
[2025-05-07 17:28:26,542 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:26,542 INFO  L485      AbstractCegarLoop]: Abstraction has 113 states and 134 transitions.
[2025-05-07 17:28:26,542 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:28:26,542 INFO  L278                IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions.
[2025-05-07 17:28:26,544 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:28:26,544 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:26,544 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:26,544 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:28:26,544 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:26,545 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:26,545 INFO  L85        PathProgramCache]: Analyzing trace with hash 1790184691, now seen corresponding path program 1 times
[2025-05-07 17:28:26,545 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:26,545 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025463843]
[2025-05-07 17:28:26,545 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:26,545 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:26,565 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:28:26,572 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:28:26,572 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:26,572 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:26,641 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:26,641 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:26,641 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025463843]
[2025-05-07 17:28:26,641 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025463843] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:26,641 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:26,642 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:26,642 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962443485]
[2025-05-07 17:28:26,642 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:26,643 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:26,643 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:26,644 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:26,644 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:26,644 INFO  L87              Difference]: Start difference. First operand 113 states and 134 transitions. Second operand  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:28:26,695 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:26,696 INFO  L93              Difference]: Finished difference Result 114 states and 133 transitions.
[2025-05-07 17:28:26,696 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:26,696 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 41
[2025-05-07 17:28:26,697 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:26,698 INFO  L225             Difference]: With dead ends: 114
[2025-05-07 17:28:26,698 INFO  L226             Difference]: Without dead ends: 113
[2025-05-07 17:28:26,698 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:26,699 INFO  L437           NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:26,699 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 363 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:26,700 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2025-05-07 17:28:26,708 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111.
[2025-05-07 17:28:26,709 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 111 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 49 states have internal predecessors, (49), 38 states have call successors, (40), 27 states have call predecessors, (40), 27 states have return successors, (40), 34 states have call predecessors, (40), 38 states have call successors, (40)
[2025-05-07 17:28:26,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions.
[2025-05-07 17:28:26,711 INFO  L79                 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 41
[2025-05-07 17:28:26,711 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:26,711 INFO  L485      AbstractCegarLoop]: Abstraction has 111 states and 129 transitions.
[2025-05-07 17:28:26,711 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:28:26,711 INFO  L278                IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions.
[2025-05-07 17:28:26,712 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:28:26,713 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:26,713 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]
[2025-05-07 17:28:26,713 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:28:26,713 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:26,713 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:26,713 INFO  L85        PathProgramCache]: Analyzing trace with hash 2051326625, now seen corresponding path program 1 times
[2025-05-07 17:28:26,713 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:26,714 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084731814]
[2025-05-07 17:28:26,714 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:26,714 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:26,743 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:28:26,761 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:28:26,761 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:26,761 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:26,865 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:26,865 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:26,865 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084731814]
[2025-05-07 17:28:26,865 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084731814] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:26,865 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:26,865 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:26,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309071095]
[2025-05-07 17:28:26,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:26,866 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:26,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:26,867 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:26,867 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:26,867 INFO  L87              Difference]: Start difference. First operand 111 states and 129 transitions. Second operand  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18)
[2025-05-07 17:28:26,899 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:26,900 INFO  L93              Difference]: Finished difference Result 115 states and 134 transitions.
[2025-05-07 17:28:26,900 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:26,900 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 66
[2025-05-07 17:28:26,901 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:26,901 INFO  L225             Difference]: With dead ends: 115
[2025-05-07 17:28:26,901 INFO  L226             Difference]: Without dead ends: 115
[2025-05-07 17:28:26,902 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:26,902 INFO  L437           NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:26,902 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 361 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:26,903 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 115 states.
[2025-05-07 17:28:26,908 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113.
[2025-05-07 17:28:26,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 113 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 50 states have internal predecessors, (50), 38 states have call successors, (40), 27 states have call predecessors, (40), 28 states have return successors, (42), 35 states have call predecessors, (42), 38 states have call successors, (42)
[2025-05-07 17:28:26,909 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions.
[2025-05-07 17:28:26,910 INFO  L79                 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 66
[2025-05-07 17:28:26,910 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:26,910 INFO  L485      AbstractCegarLoop]: Abstraction has 113 states and 132 transitions.
[2025-05-07 17:28:26,910 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18)
[2025-05-07 17:28:26,910 INFO  L278                IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions.
[2025-05-07 17:28:26,911 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:28:26,911 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:26,911 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]
[2025-05-07 17:28:26,911 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:28:26,912 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:26,912 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:26,912 INFO  L85        PathProgramCache]: Analyzing trace with hash -1165166819, now seen corresponding path program 1 times
[2025-05-07 17:28:26,912 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:26,912 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423161242]
[2025-05-07 17:28:26,912 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:26,912 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:26,933 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:28:26,948 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:28:26,948 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:26,948 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:27,028 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:27,028 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:27,029 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423161242]
[2025-05-07 17:28:27,029 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423161242] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:27,029 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:27,029 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:27,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039971885]
[2025-05-07 17:28:27,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:27,029 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:27,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:27,030 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:27,030 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:27,030 INFO  L87              Difference]: Start difference. First operand 113 states and 132 transitions. Second operand  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 3 states have call successors, (18)
[2025-05-07 17:28:27,071 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:27,071 INFO  L93              Difference]: Finished difference Result 111 states and 127 transitions.
[2025-05-07 17:28:27,072 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:27,072 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 3 states have call successors, (18) Word has length 66
[2025-05-07 17:28:27,072 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:27,073 INFO  L225             Difference]: With dead ends: 111
[2025-05-07 17:28:27,073 INFO  L226             Difference]: Without dead ends: 106
[2025-05-07 17:28:27,073 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:27,074 INFO  L437           NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 605 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:27,074 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 605 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:27,075 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2025-05-07 17:28:27,079 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106.
[2025-05-07 17:28:27,079 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 106 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 47 states have internal predecessors, (47), 33 states have call successors, (35), 27 states have call predecessors, (35), 27 states have return successors, (35), 31 states have call predecessors, (35), 33 states have call successors, (35)
[2025-05-07 17:28:27,080 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions.
[2025-05-07 17:28:27,080 INFO  L79                 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 66
[2025-05-07 17:28:27,080 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:27,080 INFO  L485      AbstractCegarLoop]: Abstraction has 106 states and 117 transitions.
[2025-05-07 17:28:27,080 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 3 states have call successors, (18)
[2025-05-07 17:28:27,080 INFO  L278                IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions.
[2025-05-07 17:28:27,082 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-05-07 17:28:27,082 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:27,082 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:27,082 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:28:27,082 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:27,082 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:27,083 INFO  L85        PathProgramCache]: Analyzing trace with hash -230488899, now seen corresponding path program 1 times
[2025-05-07 17:28:27,083 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:27,083 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073137854]
[2025-05-07 17:28:27,083 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:27,083 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:27,120 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-05-07 17:28:27,124 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-05-07 17:28:27,124 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:27,124 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:27,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:27,214 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:27,215 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073137854]
[2025-05-07 17:28:27,215 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073137854] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:27,215 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:27,215 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:27,215 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570526316]
[2025-05-07 17:28:27,215 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:27,215 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:27,215 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:27,216 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:27,216 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:27,216 INFO  L87              Difference]: Start difference. First operand 106 states and 117 transitions. Second operand  has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25)
[2025-05-07 17:28:27,225 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:27,225 INFO  L93              Difference]: Finished difference Result 108 states and 118 transitions.
[2025-05-07 17:28:27,225 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:27,225 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 91
[2025-05-07 17:28:27,226 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:27,226 INFO  L225             Difference]: With dead ends: 108
[2025-05-07 17:28:27,226 INFO  L226             Difference]: Without dead ends: 102
[2025-05-07 17:28:27,227 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:27,227 INFO  L437           NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 343 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:27,227 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 343 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:27,228 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2025-05-07 17:28:27,231 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102.
[2025-05-07 17:28:27,231 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 102 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 46 states have internal predecessors, (46), 29 states have call successors, (31), 27 states have call predecessors, (31), 27 states have return successors, (31), 28 states have call predecessors, (31), 29 states have call successors, (31)
[2025-05-07 17:28:27,232 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions.
[2025-05-07 17:28:27,232 INFO  L79                 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 91
[2025-05-07 17:28:27,232 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:27,232 INFO  L485      AbstractCegarLoop]: Abstraction has 102 states and 108 transitions.
[2025-05-07 17:28:27,232 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 3 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25)
[2025-05-07 17:28:27,232 INFO  L278                IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions.
[2025-05-07 17:28:27,233 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-05-07 17:28:27,233 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:27,233 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:27,233 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:28:27,233 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:27,233 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:27,234 INFO  L85        PathProgramCache]: Analyzing trace with hash 1147777123, now seen corresponding path program 1 times
[2025-05-07 17:28:27,234 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:27,234 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348990803]
[2025-05-07 17:28:27,234 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:27,234 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:27,266 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-05-07 17:28:27,286 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-05-07 17:28:27,286 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:27,286 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:28,082 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:28,082 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:28,082 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348990803]
[2025-05-07 17:28:28,082 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348990803] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:28,082 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:28,082 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2025-05-07 17:28:28,082 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467540192]
[2025-05-07 17:28:28,082 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:28,083 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-05-07 17:28:28,083 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:28,083 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-05-07 17:28:28,084 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380
[2025-05-07 17:28:28,084 INFO  L87              Difference]: Start difference. First operand 102 states and 108 transitions. Second operand  has 20 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 17 states have internal predecessors, (41), 10 states have call successors, (25), 1 states have call predecessors, (25), 14 states have return successors, (25), 15 states have call predecessors, (25), 10 states have call successors, (25)
[2025-05-07 17:28:28,437 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:28,437 INFO  L93              Difference]: Finished difference Result 108 states and 116 transitions.
[2025-05-07 17:28:28,438 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-05-07 17:28:28,438 INFO  L79                 Accepts]: Start accepts. Automaton has  has 20 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 17 states have internal predecessors, (41), 10 states have call successors, (25), 1 states have call predecessors, (25), 14 states have return successors, (25), 15 states have call predecessors, (25), 10 states have call successors, (25) Word has length 91
[2025-05-07 17:28:28,439 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:28,439 INFO  L225             Difference]: With dead ends: 108
[2025-05-07 17:28:28,440 INFO  L226             Difference]: Without dead ends: 98
[2025-05-07 17:28:28,440 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552
[2025-05-07 17:28:28,441 INFO  L437           NwaCegarLoop]: 99 mSDtfsCounter, 5 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1824 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:28,441 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1824 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:28:28,442 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2025-05-07 17:28:28,445 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98.
[2025-05-07 17:28:28,446 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 44 states have internal predecessors, (44), 28 states have call successors, (29), 26 states have call predecessors, (29), 26 states have return successors, (29), 27 states have call predecessors, (29), 28 states have call successors, (29)
[2025-05-07 17:28:28,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions.
[2025-05-07 17:28:28,447 INFO  L79                 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 91
[2025-05-07 17:28:28,447 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:28,447 INFO  L485      AbstractCegarLoop]: Abstraction has 98 states and 102 transitions.
[2025-05-07 17:28:28,448 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 17 states have internal predecessors, (41), 10 states have call successors, (25), 1 states have call predecessors, (25), 14 states have return successors, (25), 15 states have call predecessors, (25), 10 states have call successors, (25)
[2025-05-07 17:28:28,448 INFO  L278                IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions.
[2025-05-07 17:28:28,448 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-05-07 17:28:28,449 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:28,449 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:28,449 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:28:28,449 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:28,449 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:28,449 INFO  L85        PathProgramCache]: Analyzing trace with hash -981319929, now seen corresponding path program 1 times
[2025-05-07 17:28:28,450 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:28,450 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117091843]
[2025-05-07 17:28:28,450 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:28,450 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:28,476 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-05-07 17:28:28,492 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-05-07 17:28:28,492 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:28,492 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:28,601 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:28,601 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:28,601 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117091843]
[2025-05-07 17:28:28,601 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117091843] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:28,601 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:28,602 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:28,602 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196378779]
[2025-05-07 17:28:28,602 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:28,602 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:28,602 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:28,603 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:28,603 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:28,603 INFO  L87              Difference]: Start difference. First operand 98 states and 102 transitions. Second operand  has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 6 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:28:28,647 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:28,648 INFO  L93              Difference]: Finished difference Result 107 states and 114 transitions.
[2025-05-07 17:28:28,648 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:28,648 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 6 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25) Word has length 91
[2025-05-07 17:28:28,649 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:28,649 INFO  L225             Difference]: With dead ends: 107
[2025-05-07 17:28:28,650 INFO  L226             Difference]: Without dead ends: 94
[2025-05-07 17:28:28,650 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:28,650 INFO  L437           NwaCegarLoop]: 99 mSDtfsCounter, 1 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 582 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:28,651 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 582 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:28,651 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2025-05-07 17:28:28,655 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94.
[2025-05-07 17:28:28,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 41 states have (on average 1.024390243902439) internal successors, (42), 42 states have internal predecessors, (42), 27 states have call successors, (27), 25 states have call predecessors, (27), 25 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27)
[2025-05-07 17:28:28,656 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions.
[2025-05-07 17:28:28,656 INFO  L79                 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 91
[2025-05-07 17:28:28,657 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:28,657 INFO  L485      AbstractCegarLoop]: Abstraction has 94 states and 96 transitions.
[2025-05-07 17:28:28,657 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 6 states have return successors, (25), 6 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:28:28,657 INFO  L278                IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions.
[2025-05-07 17:28:28,658 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-05-07 17:28:28,658 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:28,658 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:28,658 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:28:28,658 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:28,659 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:28,659 INFO  L85        PathProgramCache]: Analyzing trace with hash -2083109319, now seen corresponding path program 1 times
[2025-05-07 17:28:28,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:28,659 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567357303]
[2025-05-07 17:28:28,659 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:28,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:28,686 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-05-07 17:28:28,699 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-05-07 17:28:28,699 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:28,699 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:28,752 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:28,752 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:28,752 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567357303]
[2025-05-07 17:28:28,752 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567357303] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:28,752 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:28,752 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:28,752 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866756515]
[2025-05-07 17:28:28,752 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:28,753 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:28,753 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:28,753 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:28,753 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:28,753 INFO  L87              Difference]: Start difference. First operand 94 states and 96 transitions. Second operand  has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 4 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:28:28,764 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:28,764 INFO  L93              Difference]: Finished difference Result 96 states and 97 transitions.
[2025-05-07 17:28:28,764 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:28,764 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 4 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 91
[2025-05-07 17:28:28,765 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:28,765 INFO  L225             Difference]: With dead ends: 96
[2025-05-07 17:28:28,765 INFO  L226             Difference]: Without dead ends: 92
[2025-05-07 17:28:28,765 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:28,765 INFO  L437           NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 275 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:28,766 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 275 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:28,766 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-05-07 17:28:28,768 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92.
[2025-05-07 17:28:28,768 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 92 states, 41 states have (on average 1.0) internal successors, (41), 41 states have internal predecessors, (41), 25 states have call successors, (25), 25 states have call predecessors, (25), 25 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25)
[2025-05-07 17:28:28,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 91 transitions.
[2025-05-07 17:28:28,769 INFO  L79                 Accepts]: Start accepts. Automaton has 92 states and 91 transitions. Word has length 91
[2025-05-07 17:28:28,769 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:28,769 INFO  L485      AbstractCegarLoop]: Abstraction has 92 states and 91 transitions.
[2025-05-07 17:28:28,769 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 4 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:28:28,769 INFO  L278                IsEmpty]: Start isEmpty. Operand 92 states and 91 transitions.
[2025-05-07 17:28:28,769 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-05-07 17:28:28,769 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:28,769 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:28,770 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:28:28,770 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:28,770 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:28,770 INFO  L85        PathProgramCache]: Analyzing trace with hash 1813687221, now seen corresponding path program 1 times
[2025-05-07 17:28:28,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:28,770 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994565811]
[2025-05-07 17:28:28,770 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:28,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:28,801 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-05-07 17:28:28,819 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-05-07 17:28:28,819 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:28,819 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:28,916 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:28,916 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:28,916 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994565811]
[2025-05-07 17:28:28,916 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994565811] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:28,916 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:28,916 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:28,916 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177243261]
[2025-05-07 17:28:28,916 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:28,917 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:28,917 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:28,917 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:28,917 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:28,918 INFO  L87              Difference]: Start difference. First operand 92 states and 91 transitions. Second operand  has 7 states, 5 states have (on average 8.2) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:28:28,950 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:28,951 INFO  L93              Difference]: Finished difference Result 71 states and 70 transitions.
[2025-05-07 17:28:28,951 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:28,951 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 8.2) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 91
[2025-05-07 17:28:28,951 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:28,952 INFO  L225             Difference]: With dead ends: 71
[2025-05-07 17:28:28,952 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:28:28,952 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:28:28,952 INFO  L437           NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:28,952 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 394 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:28,953 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:28:28,953 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:28:28,953 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:28,953 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:28:28,953 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91
[2025-05-07 17:28:28,953 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:28,953 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:28:28,954 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 8.2) internal successors, (41), 7 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:28:28,954 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:28:28,954 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:28:28,956 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:28:28,956 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:28:28,959 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:28,961 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:28:28,964 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:28:28 BoogieIcfgContainer
[2025-05-07 17:28:28,964 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:28:28,965 INFO  L158              Benchmark]: Toolchain (without parser) took 3487.63ms. Allocated memory is still 234.9MB. Free memory was 148.5MB in the beginning and 161.0MB in the end (delta: -12.6MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:28,965 INFO  L158              Benchmark]: SmtParser took 0.36ms. Allocated memory is still 234.9MB. Free memory is still 174.2MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:28,965 INFO  L158              Benchmark]: ChcToBoogie took 31.61ms. Allocated memory is still 234.9MB. Free memory was 148.5MB in the beginning and 145.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:28,965 INFO  L158              Benchmark]: Boogie Preprocessor took 58.09ms. Allocated memory is still 234.9MB. Free memory was 145.6MB in the beginning and 140.8MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:28,966 INFO  L158              Benchmark]: RCFGBuilder took 443.48ms. Allocated memory is still 234.9MB. Free memory was 140.8MB in the beginning and 169.7MB in the end (delta: -28.9MB). Peak memory consumption was 26.5MB. Max. memory is 33.6GB.
[2025-05-07 17:28:28,966 INFO  L158              Benchmark]: TraceAbstraction took 2950.09ms. Allocated memory is still 234.9MB. Free memory was 169.1MB in the beginning and 161.0MB in the end (delta: 8.1MB). Peak memory consumption was 6.0MB. Max. memory is 33.6GB.
[2025-05-07 17:28:28,967 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.36ms. Allocated memory is still 234.9MB. Free memory is still 174.2MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 31.61ms. Allocated memory is still 234.9MB. Free memory was 148.5MB in the beginning and 145.6MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 58.09ms. Allocated memory is still 234.9MB. Free memory was 145.6MB in the beginning and 140.8MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 443.48ms. Allocated memory is still 234.9MB. Free memory was 140.8MB in the beginning and 169.7MB in the end (delta: -28.9MB). Peak memory consumption was 26.5MB. Max. memory is 33.6GB.
 * TraceAbstraction took 2950.09ms. Allocated memory is still 234.9MB. Free memory was 169.1MB in the beginning and 161.0MB in the end (delta: 8.1MB). Peak memory consumption was 6.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, 117 locations, 185 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 5397 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4407 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 452 IncrementalHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 990 mSDtfsCounter, 452 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=0, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 669 NumberOfCodeBlocks, 669 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 660 ConstructedInterpolants, 0 QuantifiedInterpolants, 906 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-05-07 17:28:28,979 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
