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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:28:41,077 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:28:41,114 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a23f5a04-a205-4584-9a70-62e56cdaf7c7/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:28:41,117 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:28:41,117 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:28:41,130 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:28:41,130 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:28:41,130 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:28:41,130 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:28:41,130 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:28:41,131 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:28:41,131 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:28:41,131 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:28:41,131 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:28:41,131 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:28:41,131 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:28:41,131 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:28:41,131 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:28:41,131 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:41,131 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:28:41,131 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:28:41,131 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:28:41,132 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:28:41,132 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:28:41,132 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:28:41,132 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:28:41,132 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:28:41,317 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:28:41,325 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:28:41,327 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:28:41,329 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:28:41,329 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:28:41,330 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a23f5a04-a205-4584-9a70-62e56cdaf7c7/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/functions/constructor_hierarchy_diamond_empty_middle_empty_base.sol_0_no_adts_000.smt2
[2025-05-07 17:28:41,330 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:28:41,333 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:28:41,596 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a23f5a04-a205-4584-9a70-62e56cdaf7c7/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/functions/constructor_hierarchy_diamond_empty_middle_empty_base.sol_0_no_adts_000.smt2
[2025-05-07 17:28:41,598 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:28:41,599 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:28:41,600 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:28:41,600 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:28:41,600 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:28:41,602 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:41" (1/1) ...
[2025-05-07 17:28:41,631 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:41 Unit
[2025-05-07 17:28:41,631 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:28:41,632 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:28:41,632 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:28:41,632 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:28:41,644 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:41" (1/1) ...
[2025-05-07 17:28:41,644 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:41" (1/1) ...
[2025-05-07 17:28:41,667 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:41" (1/1) ...
[2025-05-07 17:28:41,667 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:41" (1/1) ...
[2025-05-07 17:28:41,673 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:41" (1/1) ...
[2025-05-07 17:28:41,674 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:41" (1/1) ...
[2025-05-07 17:28:41,675 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:41" (1/1) ...
[2025-05-07 17:28:41,678 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:41" (1/1) ...
[2025-05-07 17:28:41,679 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:41" (1/1) ...
[2025-05-07 17:28:41,690 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:28:41,691 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:28:41,691 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:28:41,691 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:28:41,691 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:41" (1/1) ...
[2025-05-07 17:28:41,693 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:41,702 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:41,710 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:41,713 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:41,720 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:28:41,721 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:28:41,721 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:28:41,721 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_3_0 given in one single declaration
[2025-05-07 17:28:41,721 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_3_0
[2025-05-07 17:28:41,721 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_3_0
[2025-05-07 17:28:41,721 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_10_B2_27_0 given in one single declaration
[2025-05-07 17:28:41,721 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_10_B2_27_0
[2025-05-07 17:28:41,721 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_10_B2_27_0
[2025-05-07 17:28:41,721 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_39_B2_27_0 given in one single declaration
[2025-05-07 17:28:41,721 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_39_B2_27_0
[2025-05-07 17:28:41,721 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_39_B2_27_0
[2025-05-07 17:28:41,721 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_12_constructor_26_27_0 given in one single declaration
[2025-05-07 17:28:41,721 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_12_constructor_26_27_0
[2025-05-07 17:28:41,721 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_12_constructor_26_27_0
[2025-05-07 17:28:41,721 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_38_constructor_26_27_0 given in one single declaration
[2025-05-07 17:28:41,721 INFO  L130     BoogieDeclarations]: Found specification of procedure block_38_constructor_26_27_0
[2025-05-07 17:28:41,721 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_38_constructor_26_27_0
[2025-05-07 17:28:41,722 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_36__25_27_0 given in one single declaration
[2025-05-07 17:28:41,722 INFO  L130     BoogieDeclarations]: Found specification of procedure block_36__25_27_0
[2025-05-07 17:28:41,722 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_36__25_27_0
[2025-05-07 17:28:41,722 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_35_constructor_26_27_0 given in one single declaration
[2025-05-07 17:28:41,722 INFO  L130     BoogieDeclarations]: Found specification of procedure block_35_constructor_26_27_0
[2025-05-07 17:28:41,722 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_35_constructor_26_27_0
[2025-05-07 17:28:41,722 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_37_return_constructor_26_27_0 given in one single declaration
[2025-05-07 17:28:41,722 INFO  L130     BoogieDeclarations]: Found specification of procedure block_37_return_constructor_26_27_0
[2025-05-07 17:28:41,722 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_37_return_constructor_26_27_0
[2025-05-07 17:28:41,722 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_41_B2_27_0 given in one single declaration
[2025-05-07 17:28:41,722 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_41_B2_27_0
[2025-05-07 17:28:41,722 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_41_B2_27_0
[2025-05-07 17:28:41,722 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_40_B2_27_0 given in one single declaration
[2025-05-07 17:28:41,722 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_40_B2_27_0
[2025-05-07 17:28:41,722 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_40_B2_27_0
[2025-05-07 17:28:41,722 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_45_C_11_0 given in one single declaration
[2025-05-07 17:28:41,722 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_45_C_11_0
[2025-05-07 17:28:41,722 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_45_C_11_0
[2025-05-07 17:28:41,722 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_11_constructor_10_27_0 given in one single declaration
[2025-05-07 17:28:41,723 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_11_constructor_10_27_0
[2025-05-07 17:28:41,723 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_11_constructor_10_27_0
[2025-05-07 17:28:41,723 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_44_return_constructor_10_27_0 given in one single declaration
[2025-05-07 17:28:41,723 INFO  L130     BoogieDeclarations]: Found specification of procedure block_44_return_constructor_10_27_0
[2025-05-07 17:28:41,723 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_44_return_constructor_10_27_0
[2025-05-07 17:28:41,723 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_43__9_27_0 given in one single declaration
[2025-05-07 17:28:41,723 INFO  L130     BoogieDeclarations]: Found specification of procedure block_43__9_27_0
[2025-05-07 17:28:41,723 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_43__9_27_0
[2025-05-07 17:28:41,723 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_42_constructor_10_27_0 given in one single declaration
[2025-05-07 17:28:41,723 INFO  L130     BoogieDeclarations]: Found specification of procedure block_42_constructor_10_27_0
[2025-05-07 17:28:41,723 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_42_constructor_10_27_0
[2025-05-07 17:28:41,723 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_47_C_11_0 given in one single declaration
[2025-05-07 17:28:41,723 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_47_C_11_0
[2025-05-07 17:28:41,723 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_47_C_11_0
[2025-05-07 17:28:41,723 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_46_C_11_0 given in one single declaration
[2025-05-07 17:28:41,723 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_46_C_11_0
[2025-05-07 17:28:41,723 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_46_C_11_0
[2025-05-07 17:28:41,723 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_48_B2_27_0 given in one single declaration
[2025-05-07 17:28:41,723 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_48_B2_27_0
[2025-05-07 17:28:41,723 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_48_B2_27_0
[2025-05-07 17:28:41,723 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_15_A_32_0 given in one single declaration
[2025-05-07 17:28:41,724 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_15_A_32_0
[2025-05-07 17:28:41,724 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_15_A_32_0
[2025-05-07 17:28:41,724 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_65_C_11_0 given in one single declaration
[2025-05-07 17:28:41,724 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_65_C_11_0
[2025-05-07 17:28:41,724 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_65_C_11_0
[2025-05-07 17:28:41,724 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_67_C_11_0 given in one single declaration
[2025-05-07 17:28:41,724 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_67_C_11_0
[2025-05-07 17:28:41,724 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_67_C_11_0
[2025-05-07 17:28:41,724 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_66_C_11_0 given in one single declaration
[2025-05-07 17:28:41,724 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_66_C_11_0
[2025-05-07 17:28:41,724 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_66_C_11_0
[2025-05-07 17:28:41,724 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_16_constructor_10_32_0 given in one single declaration
[2025-05-07 17:28:41,724 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_16_constructor_10_32_0
[2025-05-07 17:28:41,724 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_16_constructor_10_32_0
[2025-05-07 17:28:41,724 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_64_return_constructor_10_32_0 given in one single declaration
[2025-05-07 17:28:41,724 INFO  L130     BoogieDeclarations]: Found specification of procedure block_64_return_constructor_10_32_0
[2025-05-07 17:28:41,724 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_64_return_constructor_10_32_0
[2025-05-07 17:28:41,724 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_63__9_32_0 given in one single declaration
[2025-05-07 17:28:41,724 INFO  L130     BoogieDeclarations]: Found specification of procedure block_63__9_32_0
[2025-05-07 17:28:41,725 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_63__9_32_0
[2025-05-07 17:28:41,725 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_62_constructor_10_32_0 given in one single declaration
[2025-05-07 17:28:41,725 INFO  L130     BoogieDeclarations]: Found specification of procedure block_62_constructor_10_32_0
[2025-05-07 17:28:41,725 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_62_constructor_10_32_0
[2025-05-07 17:28:41,725 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_56_B2_27_0 given in one single declaration
[2025-05-07 17:28:41,725 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_56_B2_27_0
[2025-05-07 17:28:41,725 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_56_B2_27_0
[2025-05-07 17:28:41,725 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_17_constructor_26_32_0 given in one single declaration
[2025-05-07 17:28:41,725 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_17_constructor_26_32_0
[2025-05-07 17:28:41,725 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_17_constructor_26_32_0
[2025-05-07 17:28:41,725 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_54_return_constructor_26_32_0 given in one single declaration
[2025-05-07 17:28:41,725 INFO  L130     BoogieDeclarations]: Found specification of procedure block_54_return_constructor_26_32_0
[2025-05-07 17:28:41,725 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_54_return_constructor_26_32_0
[2025-05-07 17:28:41,725 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_53__25_32_0 given in one single declaration
[2025-05-07 17:28:41,725 INFO  L130     BoogieDeclarations]: Found specification of procedure block_53__25_32_0
[2025-05-07 17:28:41,725 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_53__25_32_0
[2025-05-07 17:28:41,725 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_52_constructor_26_32_0 given in one single declaration
[2025-05-07 17:28:41,725 INFO  L130     BoogieDeclarations]: Found specification of procedure block_52_constructor_26_32_0
[2025-05-07 17:28:41,725 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_52_constructor_26_32_0
[2025-05-07 17:28:41,725 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_55_constructor_26_32_0 given in one single declaration
[2025-05-07 17:28:41,725 INFO  L130     BoogieDeclarations]: Found specification of procedure block_55_constructor_26_32_0
[2025-05-07 17:28:41,725 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_55_constructor_26_32_0
[2025-05-07 17:28:41,725 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_58_B2_27_0 given in one single declaration
[2025-05-07 17:28:41,726 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_58_B2_27_0
[2025-05-07 17:28:41,726 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_58_B2_27_0
[2025-05-07 17:28:41,726 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_57_B2_27_0 given in one single declaration
[2025-05-07 17:28:41,726 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_57_B2_27_0
[2025-05-07 17:28:41,726 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_57_B2_27_0
[2025-05-07 17:28:41,726 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_49_A_32_0 given in one single declaration
[2025-05-07 17:28:41,726 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_49_A_32_0
[2025-05-07 17:28:41,726 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_49_A_32_0
[2025-05-07 17:28:41,726 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_51_A_32_0 given in one single declaration
[2025-05-07 17:28:41,726 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_51_A_32_0
[2025-05-07 17:28:41,726 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_51_A_32_0
[2025-05-07 17:28:41,726 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_50_A_32_0 given in one single declaration
[2025-05-07 17:28:41,726 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_50_A_32_0
[2025-05-07 17:28:41,726 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_50_A_32_0
[2025-05-07 17:28:41,726 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_68_A_32_0 given in one single declaration
[2025-05-07 17:28:41,726 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_68_A_32_0
[2025-05-07 17:28:41,726 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_68_A_32_0
[2025-05-07 17:28:41,726 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_59_B_14_0 given in one single declaration
[2025-05-07 17:28:41,726 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_59_B_14_0
[2025-05-07 17:28:41,726 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_59_B_14_0
[2025-05-07 17:28:41,726 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_61_B_14_0 given in one single declaration
[2025-05-07 17:28:41,727 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_61_B_14_0
[2025-05-07 17:28:41,727 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_61_B_14_0
[2025-05-07 17:28:41,727 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_60_B_14_0 given in one single declaration
[2025-05-07 17:28:41,727 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_60_B_14_0
[2025-05-07 17:28:41,727 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_60_B_14_0
[2025-05-07 17:28:41,727 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:28:41,727 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:28:41,727 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:28:41,914 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:28:41,917 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:28:42,206 INFO  L?                        ?]: Removed 382 outVars from TransFormulas that were not future-live.
[2025-05-07 17:28:42,206 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:28:42,215 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:28:42,216 INFO  L312             CfgBuilder]: Removed 19 assume(true) statements.
[2025-05-07 17:28:42,216 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:42 BoogieIcfgContainer
[2025-05-07 17:28:42,216 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:28:42,218 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:28:42,218 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:28:42,221 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:28:42,221 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:41" (1/3) ...
[2025-05-07 17:28:42,221 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60388778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:28:42, skipping insertion in model container
[2025-05-07 17:28:42,221 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:41" (2/3) ...
[2025-05-07 17:28:42,221 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60388778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:28:42, skipping insertion in model container
[2025-05-07 17:28:42,221 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:42" (3/3) ...
[2025-05-07 17:28:42,222 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:28:42,232 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:28:42,234 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 43 procedures, 182 locations, 294 edges, 43 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:28:42,263 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:28:42,271 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;@3cb2a29, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:28:42,271 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:28:42,274 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 182 states, 69 states have (on average 1.173913043478261) internal successors, (81), 81 states have internal predecessors, (81), 69 states have call successors, (71), 42 states have call predecessors, (71), 42 states have return successors, (71), 58 states have call predecessors, (71), 69 states have call successors, (71)
[2025-05-07 17:28:42,282 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:28:42,282 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:42,282 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:42,283 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:42,286 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:42,286 INFO  L85        PathProgramCache]: Analyzing trace with hash 707051217, now seen corresponding path program 1 times
[2025-05-07 17:28:42,291 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:42,291 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584148614]
[2025-05-07 17:28:42,292 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:42,292 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:42,331 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:28:42,378 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:28:42,378 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:42,378 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:42,531 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:42,531 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:42,531 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584148614]
[2025-05-07 17:28:42,532 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584148614] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:42,532 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:42,534 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:42,535 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346766261]
[2025-05-07 17:28:42,535 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:42,538 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:42,538 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:42,572 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:42,572 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:42,574 INFO  L87              Difference]: Start difference. First operand  has 182 states, 69 states have (on average 1.173913043478261) internal successors, (81), 81 states have internal predecessors, (81), 69 states have call successors, (71), 42 states have call predecessors, (71), 42 states have return successors, (71), 58 states have call predecessors, (71), 69 states have call successors, (71) Second operand  has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:28:42,670 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:42,670 INFO  L93              Difference]: Finished difference Result 180 states and 220 transitions.
[2025-05-07 17:28:42,671 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:42,672 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), 3 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11) Word has length 41
[2025-05-07 17:28:42,673 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:42,679 INFO  L225             Difference]: With dead ends: 180
[2025-05-07 17:28:42,679 INFO  L226             Difference]: Without dead ends: 178
[2025-05-07 17:28:42,680 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:42,682 INFO  L437           NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1070 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:42,683 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1070 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:42,694 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 178 states.
[2025-05-07 17:28:42,715 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178.
[2025-05-07 17:28:42,716 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 178 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 78 states have internal predecessors, (78), 67 states have call successors, (69), 42 states have call predecessors, (69), 42 states have return successors, (69), 57 states have call predecessors, (69), 67 states have call successors, (69)
[2025-05-07 17:28:42,719 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 216 transitions.
[2025-05-07 17:28:42,720 INFO  L79                 Accepts]: Start accepts. Automaton has 178 states and 216 transitions. Word has length 41
[2025-05-07 17:28:42,721 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:42,721 INFO  L485      AbstractCegarLoop]: Abstraction has 178 states and 216 transitions.
[2025-05-07 17:28:42,721 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), 3 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:28:42,721 INFO  L278                IsEmpty]: Start isEmpty. Operand 178 states and 216 transitions.
[2025-05-07 17:28:42,723 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:28:42,724 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:42,724 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:42,724 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:28:42,724 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:42,724 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:42,724 INFO  L85        PathProgramCache]: Analyzing trace with hash 1785525069, now seen corresponding path program 1 times
[2025-05-07 17:28:42,725 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:42,725 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219634180]
[2025-05-07 17:28:42,725 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:42,725 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:42,751 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:28:42,766 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:28:42,767 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:42,767 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:42,830 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:42,831 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:42,831 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219634180]
[2025-05-07 17:28:42,831 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219634180] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:42,831 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:42,831 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:42,831 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196781533]
[2025-05-07 17:28:42,831 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:42,832 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:42,832 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:42,832 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:42,832 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:42,833 INFO  L87              Difference]: Start difference. First operand 178 states and 216 transitions. Second operand  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:28:42,874 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:42,874 INFO  L93              Difference]: Finished difference Result 180 states and 217 transitions.
[2025-05-07 17:28:42,874 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:42,874 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), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 41
[2025-05-07 17:28:42,875 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:42,876 INFO  L225             Difference]: With dead ends: 180
[2025-05-07 17:28:42,876 INFO  L226             Difference]: Without dead ends: 178
[2025-05-07 17:28:42,877 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:42,877 INFO  L437           NwaCegarLoop]: 214 mSDtfsCounter, 1 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:42,877 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 627 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:42,878 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 178 states.
[2025-05-07 17:28:42,886 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176.
[2025-05-07 17:28:42,886 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 176 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 77 states have internal predecessors, (77), 65 states have call successors, (67), 42 states have call predecessors, (67), 42 states have return successors, (67), 56 states have call predecessors, (67), 65 states have call successors, (67)
[2025-05-07 17:28:42,887 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 211 transitions.
[2025-05-07 17:28:42,887 INFO  L79                 Accepts]: Start accepts. Automaton has 176 states and 211 transitions. Word has length 41
[2025-05-07 17:28:42,887 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:42,888 INFO  L485      AbstractCegarLoop]: Abstraction has 176 states and 211 transitions.
[2025-05-07 17:28:42,888 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), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:28:42,888 INFO  L278                IsEmpty]: Start isEmpty. Operand 176 states and 211 transitions.
[2025-05-07 17:28:42,889 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:28:42,889 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:42,889 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:42,889 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:28:42,889 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:42,889 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:42,890 INFO  L85        PathProgramCache]: Analyzing trace with hash 1440601465, now seen corresponding path program 1 times
[2025-05-07 17:28:42,890 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:42,890 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506045540]
[2025-05-07 17:28:42,890 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:42,890 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:42,906 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:28:42,909 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:28:42,910 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:42,910 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:42,954 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:42,954 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:42,954 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506045540]
[2025-05-07 17:28:42,954 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506045540] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:42,954 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:42,954 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:42,954 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441540747]
[2025-05-07 17:28:42,955 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:42,955 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:42,955 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:42,955 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:42,956 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:42,956 INFO  L87              Difference]: Start difference. First operand 176 states and 211 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:43,013 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:43,013 INFO  L93              Difference]: Finished difference Result 180 states and 218 transitions.
[2025-05-07 17:28:43,013 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:43,014 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:43,014 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:43,015 INFO  L225             Difference]: With dead ends: 180
[2025-05-07 17:28:43,015 INFO  L226             Difference]: Without dead ends: 180
[2025-05-07 17:28:43,015 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:43,016 INFO  L437           NwaCegarLoop]: 211 mSDtfsCounter, 1 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:43,016 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 603 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:43,017 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 180 states.
[2025-05-07 17:28:43,025 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178.
[2025-05-07 17:28:43,025 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 178 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 78 states have internal predecessors, (78), 65 states have call successors, (67), 42 states have call predecessors, (67), 43 states have return successors, (71), 57 states have call predecessors, (71), 65 states have call successors, (71)
[2025-05-07 17:28:43,026 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 216 transitions.
[2025-05-07 17:28:43,026 INFO  L79                 Accepts]: Start accepts. Automaton has 178 states and 216 transitions. Word has length 41
[2025-05-07 17:28:43,027 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:43,027 INFO  L485      AbstractCegarLoop]: Abstraction has 178 states and 216 transitions.
[2025-05-07 17:28:43,027 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:43,027 INFO  L278                IsEmpty]: Start isEmpty. Operand 178 states and 216 transitions.
[2025-05-07 17:28:43,028 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:28:43,028 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:43,028 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:43,028 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:28:43,028 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:43,028 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:43,028 INFO  L85        PathProgramCache]: Analyzing trace with hash 1838772221, now seen corresponding path program 1 times
[2025-05-07 17:28:43,028 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:43,029 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240663290]
[2025-05-07 17:28:43,029 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:43,029 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:43,045 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:28:43,053 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:28:43,054 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:43,054 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:43,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:43,110 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:43,110 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240663290]
[2025-05-07 17:28:43,110 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240663290] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:43,110 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:43,111 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:43,111 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562656151]
[2025-05-07 17:28:43,111 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:43,111 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:43,111 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:43,111 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:43,111 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:43,112 INFO  L87              Difference]: Start difference. First operand 178 states and 216 transitions. 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:43,161 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:43,161 INFO  L93              Difference]: Finished difference Result 174 states and 205 transitions.
[2025-05-07 17:28:43,162 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:43,162 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:43,162 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:43,163 INFO  L225             Difference]: With dead ends: 174
[2025-05-07 17:28:43,163 INFO  L226             Difference]: Without dead ends: 172
[2025-05-07 17:28:43,163 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:43,164 INFO  L437           NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:43,164 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 994 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:43,165 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 172 states.
[2025-05-07 17:28:43,170 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172.
[2025-05-07 17:28:43,171 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 172 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 75 states have internal predecessors, (75), 61 states have call successors, (63), 42 states have call predecessors, (63), 42 states have return successors, (63), 54 states have call predecessors, (63), 61 states have call successors, (63)
[2025-05-07 17:28:43,172 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 201 transitions.
[2025-05-07 17:28:43,172 INFO  L79                 Accepts]: Start accepts. Automaton has 172 states and 201 transitions. Word has length 41
[2025-05-07 17:28:43,172 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:43,172 INFO  L485      AbstractCegarLoop]: Abstraction has 172 states and 201 transitions.
[2025-05-07 17:28:43,172 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:43,172 INFO  L278                IsEmpty]: Start isEmpty. Operand 172 states and 201 transitions.
[2025-05-07 17:28:43,173 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:28:43,173 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:43,173 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:43,173 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:28:43,173 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:43,173 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:43,173 INFO  L85        PathProgramCache]: Analyzing trace with hash 1311850488, now seen corresponding path program 1 times
[2025-05-07 17:28:43,173 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:43,173 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636180422]
[2025-05-07 17:28:43,174 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:43,174 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:43,191 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:28:43,200 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:28:43,200 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:43,200 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:43,283 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:43,283 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:43,283 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636180422]
[2025-05-07 17:28:43,283 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636180422] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:43,283 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:43,283 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:43,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924179183]
[2025-05-07 17:28:43,283 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:43,283 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:43,284 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:43,284 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:43,284 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:43,284 INFO  L87              Difference]: Start difference. First operand 172 states and 201 transitions. Second operand  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:28:43,341 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:43,341 INFO  L93              Difference]: Finished difference Result 172 states and 198 transitions.
[2025-05-07 17:28:43,342 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:43,342 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:28:43,342 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:43,343 INFO  L225             Difference]: With dead ends: 172
[2025-05-07 17:28:43,344 INFO  L226             Difference]: Without dead ends: 171
[2025-05-07 17:28:43,344 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:43,344 INFO  L437           NwaCegarLoop]: 192 mSDtfsCounter, 1 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:43,344 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 937 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:43,345 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 171 states.
[2025-05-07 17:28:43,350 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169.
[2025-05-07 17:28:43,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 169 states, 68 states have (on average 1.088235294117647) internal successors, (74), 74 states have internal predecessors, (74), 58 states have call successors, (60), 42 states have call predecessors, (60), 42 states have return successors, (60), 52 states have call predecessors, (60), 58 states have call successors, (60)
[2025-05-07 17:28:43,351 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 194 transitions.
[2025-05-07 17:28:43,351 INFO  L79                 Accepts]: Start accepts. Automaton has 169 states and 194 transitions. Word has length 51
[2025-05-07 17:28:43,351 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:43,351 INFO  L485      AbstractCegarLoop]: Abstraction has 169 states and 194 transitions.
[2025-05-07 17:28:43,351 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:28:43,352 INFO  L278                IsEmpty]: Start isEmpty. Operand 169 states and 194 transitions.
[2025-05-07 17:28:43,352 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-05-07 17:28:43,352 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:43,353 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:43,353 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:28:43,353 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:43,353 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:43,353 INFO  L85        PathProgramCache]: Analyzing trace with hash -1831812964, now seen corresponding path program 1 times
[2025-05-07 17:28:43,353 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:43,353 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220795601]
[2025-05-07 17:28:43,353 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:43,353 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:43,378 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-05-07 17:28:43,389 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-05-07 17:28:43,390 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:43,390 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:43,798 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:43,798 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:43,798 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220795601]
[2025-05-07 17:28:43,798 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220795601] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:43,798 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:43,798 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18
[2025-05-07 17:28:43,799 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001203760]
[2025-05-07 17:28:43,799 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:43,799 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2025-05-07 17:28:43,799 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:43,799 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2025-05-07 17:28:43,800 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306
[2025-05-07 17:28:43,800 INFO  L87              Difference]: Start difference. First operand 169 states and 194 transitions. Second operand  has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 8 states have call successors, (21), 1 states have call predecessors, (21), 14 states have return successors, (21), 15 states have call predecessors, (21), 8 states have call successors, (21)
[2025-05-07 17:28:44,159 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:44,159 INFO  L93              Difference]: Finished difference Result 175 states and 202 transitions.
[2025-05-07 17:28:44,160 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2025-05-07 17:28:44,160 INFO  L79                 Accepts]: Start accepts. Automaton has  has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 8 states have call successors, (21), 1 states have call predecessors, (21), 14 states have return successors, (21), 15 states have call predecessors, (21), 8 states have call successors, (21) Word has length 76
[2025-05-07 17:28:44,160 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:44,161 INFO  L225             Difference]: With dead ends: 175
[2025-05-07 17:28:44,162 INFO  L226             Difference]: Without dead ends: 175
[2025-05-07 17:28:44,162 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420
[2025-05-07 17:28:44,163 INFO  L437           NwaCegarLoop]: 179 mSDtfsCounter, 4 mSDsluCounter, 2807 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2986 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:44,163 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2986 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:28:44,164 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 175 states.
[2025-05-07 17:28:44,171 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173.
[2025-05-07 17:28:44,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 173 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 76 states have internal predecessors, (76), 58 states have call successors, (60), 42 states have call predecessors, (60), 44 states have return successors, (64), 54 states have call predecessors, (64), 58 states have call successors, (64)
[2025-05-07 17:28:44,173 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 200 transitions.
[2025-05-07 17:28:44,173 INFO  L79                 Accepts]: Start accepts. Automaton has 173 states and 200 transitions. Word has length 76
[2025-05-07 17:28:44,174 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:44,174 INFO  L485      AbstractCegarLoop]: Abstraction has 173 states and 200 transitions.
[2025-05-07 17:28:44,174 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 15 states have internal predecessors, (34), 8 states have call successors, (21), 1 states have call predecessors, (21), 14 states have return successors, (21), 15 states have call predecessors, (21), 8 states have call successors, (21)
[2025-05-07 17:28:44,174 INFO  L278                IsEmpty]: Start isEmpty. Operand 173 states and 200 transitions.
[2025-05-07 17:28:44,176 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-05-07 17:28:44,176 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:44,176 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:44,176 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:28:44,176 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:44,176 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:44,177 INFO  L85        PathProgramCache]: Analyzing trace with hash 141206900, now seen corresponding path program 1 times
[2025-05-07 17:28:44,177 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:44,177 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695965406]
[2025-05-07 17:28:44,177 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:44,177 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:44,204 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-05-07 17:28:44,215 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-05-07 17:28:44,215 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:44,215 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:44,271 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:44,271 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:44,271 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695965406]
[2025-05-07 17:28:44,271 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695965406] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:44,271 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:44,271 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:44,271 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137838864]
[2025-05-07 17:28:44,272 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:44,272 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:44,272 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:44,273 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:44,273 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:44,273 INFO  L87              Difference]: Start difference. First operand 173 states and 200 transitions. Second operand  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21)
[2025-05-07 17:28:44,300 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:44,300 INFO  L93              Difference]: Finished difference Result 179 states and 208 transitions.
[2025-05-07 17:28:44,300 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:44,301 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21) Word has length 76
[2025-05-07 17:28:44,301 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:44,302 INFO  L225             Difference]: With dead ends: 179
[2025-05-07 17:28:44,302 INFO  L226             Difference]: Without dead ends: 179
[2025-05-07 17:28:44,302 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:44,302 INFO  L437           NwaCegarLoop]: 193 mSDtfsCounter, 1 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 559 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:44,302 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 559 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:44,303 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 179 states.
[2025-05-07 17:28:44,308 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 173.
[2025-05-07 17:28:44,308 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 173 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 76 states have internal predecessors, (76), 58 states have call successors, (60), 42 states have call predecessors, (60), 44 states have return successors, (64), 54 states have call predecessors, (64), 58 states have call successors, (64)
[2025-05-07 17:28:44,309 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 200 transitions.
[2025-05-07 17:28:44,309 INFO  L79                 Accepts]: Start accepts. Automaton has 173 states and 200 transitions. Word has length 76
[2025-05-07 17:28:44,309 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:44,309 INFO  L485      AbstractCegarLoop]: Abstraction has 173 states and 200 transitions.
[2025-05-07 17:28:44,310 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 3 states have call successors, (21)
[2025-05-07 17:28:44,310 INFO  L278                IsEmpty]: Start isEmpty. Operand 173 states and 200 transitions.
[2025-05-07 17:28:44,310 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-05-07 17:28:44,310 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:44,310 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:44,311 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:28:44,311 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:44,311 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:44,311 INFO  L85        PathProgramCache]: Analyzing trace with hash -937266952, now seen corresponding path program 1 times
[2025-05-07 17:28:44,311 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:44,311 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035959484]
[2025-05-07 17:28:44,311 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:44,311 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:44,334 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-05-07 17:28:44,344 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-05-07 17:28:44,345 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:44,345 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:44,418 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:44,418 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:44,418 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035959484]
[2025-05-07 17:28:44,418 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035959484] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:44,418 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:44,418 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:44,418 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533419962]
[2025-05-07 17:28:44,418 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:44,418 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:44,419 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:44,419 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:44,419 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:44,419 INFO  L87              Difference]: Start difference. First operand 173 states and 200 transitions. Second operand  has 7 states, 5 states have (on average 6.8) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:28:44,479 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:44,479 INFO  L93              Difference]: Finished difference Result 173 states and 198 transitions.
[2025-05-07 17:28:44,479 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:44,479 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 6.8) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21) Word has length 76
[2025-05-07 17:28:44,480 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:44,480 INFO  L225             Difference]: With dead ends: 173
[2025-05-07 17:28:44,480 INFO  L226             Difference]: Without dead ends: 169
[2025-05-07 17:28:44,480 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:44,481 INFO  L437           NwaCegarLoop]: 192 mSDtfsCounter, 2 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:44,481 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1130 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:44,481 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 169 states.
[2025-05-07 17:28:44,484 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167.
[2025-05-07 17:28:44,485 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 167 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 74 states have internal predecessors, (74), 54 states have call successors, (56), 42 states have call predecessors, (56), 43 states have return successors, (57), 50 states have call predecessors, (57), 54 states have call successors, (57)
[2025-05-07 17:28:44,485 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 187 transitions.
[2025-05-07 17:28:44,485 INFO  L79                 Accepts]: Start accepts. Automaton has 167 states and 187 transitions. Word has length 76
[2025-05-07 17:28:44,486 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:44,486 INFO  L485      AbstractCegarLoop]: Abstraction has 167 states and 187 transitions.
[2025-05-07 17:28:44,486 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 6.8) internal successors, (34), 7 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:28:44,486 INFO  L278                IsEmpty]: Start isEmpty. Operand 167 states and 187 transitions.
[2025-05-07 17:28:44,486 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:28:44,486 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:44,487 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:44,487 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:28:44,487 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:44,487 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:44,487 INFO  L85        PathProgramCache]: Analyzing trace with hash -1603791373, now seen corresponding path program 1 times
[2025-05-07 17:28:44,487 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:44,487 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269501]
[2025-05-07 17:28:44,487 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:44,487 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:44,508 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:28:44,510 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:28:44,510 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:44,510 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:44,543 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:44,543 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:44,543 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269501]
[2025-05-07 17:28:44,543 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269501] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:44,543 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:44,543 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:44,543 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238353912]
[2025-05-07 17:28:44,543 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:44,544 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:44,544 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:44,544 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:44,544 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:44,544 INFO  L87              Difference]: Start difference. First operand 167 states and 187 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), 3 states have call predecessors, (18), 3 states have call successors, (18)
[2025-05-07 17:28:44,553 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:44,553 INFO  L93              Difference]: Finished difference Result 169 states and 188 transitions.
[2025-05-07 17:28:44,553 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:44,553 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), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 66
[2025-05-07 17:28:44,554 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:44,554 INFO  L225             Difference]: With dead ends: 169
[2025-05-07 17:28:44,554 INFO  L226             Difference]: Without dead ends: 164
[2025-05-07 17:28:44,555 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:44,555 INFO  L437           NwaCegarLoop]: 185 mSDtfsCounter, 1 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:44,555 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 544 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:44,556 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 164 states.
[2025-05-07 17:28:44,558 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164.
[2025-05-07 17:28:44,559 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 164 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 73 states have internal predecessors, (73), 51 states have call successors, (53), 42 states have call predecessors, (53), 43 states have return successors, (54), 48 states have call predecessors, (54), 51 states have call successors, (54)
[2025-05-07 17:28:44,559 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 180 transitions.
[2025-05-07 17:28:44,559 INFO  L79                 Accepts]: Start accepts. Automaton has 164 states and 180 transitions. Word has length 66
[2025-05-07 17:28:44,560 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:44,560 INFO  L485      AbstractCegarLoop]: Abstraction has 164 states and 180 transitions.
[2025-05-07 17:28:44,560 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), 3 states have call predecessors, (18), 3 states have call successors, (18)
[2025-05-07 17:28:44,560 INFO  L278                IsEmpty]: Start isEmpty. Operand 164 states and 180 transitions.
[2025-05-07 17:28:44,560 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:28:44,561 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:44,561 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:44,561 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:28:44,561 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:44,561 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:44,561 INFO  L85        PathProgramCache]: Analyzing trace with hash 1903399002, now seen corresponding path program 1 times
[2025-05-07 17:28:44,561 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:44,561 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094820855]
[2025-05-07 17:28:44,561 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:44,562 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:44,582 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:28:44,585 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:28:44,585 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:44,585 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:44,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:44,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:44,622 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094820855]
[2025-05-07 17:28:44,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094820855] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:44,622 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:44,623 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:44,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933257533]
[2025-05-07 17:28:44,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:44,623 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:44,623 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:44,624 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:44,624 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:44,624 INFO  L87              Difference]: Start difference. First operand 164 states and 180 transitions. Second operand  has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:28:44,636 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:44,636 INFO  L93              Difference]: Finished difference Result 166 states and 181 transitions.
[2025-05-07 17:28:44,637 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:44,637 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), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 66
[2025-05-07 17:28:44,637 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:44,638 INFO  L225             Difference]: With dead ends: 166
[2025-05-07 17:28:44,638 INFO  L226             Difference]: Without dead ends: 162
[2025-05-07 17:28:44,638 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:44,638 INFO  L437           NwaCegarLoop]: 178 mSDtfsCounter, 1 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 522 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:44,638 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 522 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:44,639 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 162 states.
[2025-05-07 17:28:44,641 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162.
[2025-05-07 17:28:44,642 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 162 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 72 states have internal predecessors, (72), 49 states have call successors, (51), 42 states have call predecessors, (51), 43 states have return successors, (52), 47 states have call predecessors, (52), 49 states have call successors, (52)
[2025-05-07 17:28:44,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions.
[2025-05-07 17:28:44,642 INFO  L79                 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 66
[2025-05-07 17:28:44,642 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:44,642 INFO  L485      AbstractCegarLoop]: Abstraction has 162 states and 175 transitions.
[2025-05-07 17:28:44,643 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), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:28:44,643 INFO  L278                IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions.
[2025-05-07 17:28:44,643 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:28:44,643 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:44,643 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:44,643 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:28:44,643 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:44,644 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:44,644 INFO  L85        PathProgramCache]: Analyzing trace with hash -1672339618, now seen corresponding path program 1 times
[2025-05-07 17:28:44,644 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:44,644 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6462965]
[2025-05-07 17:28:44,644 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:44,644 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:44,665 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:28:44,673 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:28:44,673 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:44,673 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:44,932 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:44,933 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:44,933 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6462965]
[2025-05-07 17:28:44,933 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6462965] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:44,933 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:44,933 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:28:44,933 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953376420]
[2025-05-07 17:28:44,933 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:44,933 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:28:44,933 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:44,934 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:28:44,934 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:44,934 INFO  L87              Difference]: Start difference. First operand 162 states and 175 transitions. Second operand  has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 6 states have call successors, (18), 1 states have call predecessors, (18), 11 states have return successors, (18), 12 states have call predecessors, (18), 6 states have call successors, (18)
[2025-05-07 17:28:45,068 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:45,068 INFO  L93              Difference]: Finished difference Result 167 states and 180 transitions.
[2025-05-07 17:28:45,069 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:28:45,069 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 6 states have call successors, (18), 1 states have call predecessors, (18), 11 states have return successors, (18), 12 states have call predecessors, (18), 6 states have call successors, (18) Word has length 66
[2025-05-07 17:28:45,069 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:45,070 INFO  L225             Difference]: With dead ends: 167
[2025-05-07 17:28:45,070 INFO  L226             Difference]: Without dead ends: 158
[2025-05-07 17:28:45,070 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240
[2025-05-07 17:28:45,071 INFO  L437           NwaCegarLoop]: 163 mSDtfsCounter, 3 mSDsluCounter, 1929 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:45,071 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2092 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:45,072 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 158 states.
[2025-05-07 17:28:45,076 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158.
[2025-05-07 17:28:45,076 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 158 states, 67 states have (on average 1.044776119402985) internal successors, (70), 70 states have internal predecessors, (70), 48 states have call successors, (49), 41 states have call predecessors, (49), 42 states have return successors, (50), 46 states have call predecessors, (50), 48 states have call successors, (50)
[2025-05-07 17:28:45,077 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions.
[2025-05-07 17:28:45,077 INFO  L79                 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 66
[2025-05-07 17:28:45,077 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:45,078 INFO  L485      AbstractCegarLoop]: Abstraction has 158 states and 169 transitions.
[2025-05-07 17:28:45,078 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 6 states have call successors, (18), 1 states have call predecessors, (18), 11 states have return successors, (18), 12 states have call predecessors, (18), 6 states have call successors, (18)
[2025-05-07 17:28:45,078 INFO  L278                IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions.
[2025-05-07 17:28:45,079 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2025-05-07 17:28:45,079 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:45,079 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:45,079 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:28:45,079 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:45,079 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:45,079 INFO  L85        PathProgramCache]: Analyzing trace with hash -1775833094, now seen corresponding path program 1 times
[2025-05-07 17:28:45,079 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:45,079 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065959357]
[2025-05-07 17:28:45,080 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:45,080 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:45,102 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes.
[2025-05-07 17:28:45,111 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements.
[2025-05-07 17:28:45,111 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:45,111 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:45,176 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:45,176 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:45,176 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065959357]
[2025-05-07 17:28:45,176 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065959357] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:45,176 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:45,177 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:28:45,177 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087756894]
[2025-05-07 17:28:45,177 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:45,177 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:28:45,177 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:45,177 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:28:45,177 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:28:45,178 INFO  L87              Difference]: Start difference. First operand 158 states and 169 transitions. Second operand  has 7 states, 5 states have (on average 6.0) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18)
[2025-05-07 17:28:45,204 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:45,204 INFO  L93              Difference]: Finished difference Result 129 states and 139 transitions.
[2025-05-07 17:28:45,205 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:28:45,205 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 6.0) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18) Word has length 66
[2025-05-07 17:28:45,205 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:45,206 INFO  L225             Difference]: With dead ends: 129
[2025-05-07 17:28:45,206 INFO  L226             Difference]: Without dead ends: 100
[2025-05-07 17:28:45,206 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:45,207 INFO  L437           NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 795 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:45,207 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 795 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:45,207 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 100 states.
[2025-05-07 17:28:45,210 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100.
[2025-05-07 17:28:45,210 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 100 states, 41 states have (on average 1.048780487804878) internal successors, (43), 43 states have internal predecessors, (43), 32 states have call successors, (33), 25 states have call predecessors, (33), 26 states have return successors, (34), 31 states have call predecessors, (34), 32 states have call successors, (34)
[2025-05-07 17:28:45,211 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions.
[2025-05-07 17:28:45,211 INFO  L79                 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 66
[2025-05-07 17:28:45,211 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:45,211 INFO  L485      AbstractCegarLoop]: Abstraction has 100 states and 110 transitions.
[2025-05-07 17:28:45,211 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 6.0) internal successors, (30), 7 states have internal predecessors, (30), 5 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 6 states have call predecessors, (18), 5 states have call successors, (18)
[2025-05-07 17:28:45,211 INFO  L278                IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions.
[2025-05-07 17:28:45,212 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2025-05-07 17:28:45,212 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:45,212 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:45,212 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-05-07 17:28:45,213 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:45,213 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:45,213 INFO  L85        PathProgramCache]: Analyzing trace with hash 967409444, now seen corresponding path program 1 times
[2025-05-07 17:28:45,213 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:45,213 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030067708]
[2025-05-07 17:28:45,213 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:45,213 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:45,241 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes.
[2025-05-07 17:28:45,251 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements.
[2025-05-07 17:28:45,251 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:45,251 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:45,326 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:45,327 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:45,327 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030067708]
[2025-05-07 17:28:45,327 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030067708] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:45,327 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:45,327 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:45,327 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371159489]
[2025-05-07 17:28:45,327 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:45,327 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:45,327 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:45,328 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:45,328 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:45,328 INFO  L87              Difference]: Start difference. First operand 100 states and 110 transitions. Second operand  has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (24), 1 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24)
[2025-05-07 17:28:45,358 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:45,358 INFO  L93              Difference]: Finished difference Result 98 states and 105 transitions.
[2025-05-07 17:28:45,359 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:45,359 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (24), 1 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) Word has length 86
[2025-05-07 17:28:45,359 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:45,359 INFO  L225             Difference]: With dead ends: 98
[2025-05-07 17:28:45,359 INFO  L226             Difference]: Without dead ends: 95
[2025-05-07 17:28:45,360 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:45,360 INFO  L437           NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:45,360 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:45,361 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2025-05-07 17:28:45,363 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95.
[2025-05-07 17:28:45,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 95 states, 41 states have (on average 1.024390243902439) internal successors, (42), 42 states have internal predecessors, (42), 27 states have call successors, (28), 25 states have call predecessors, (28), 26 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29)
[2025-05-07 17:28:45,364 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions.
[2025-05-07 17:28:45,364 INFO  L79                 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 86
[2025-05-07 17:28:45,364 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:45,364 INFO  L485      AbstractCegarLoop]: Abstraction has 95 states and 99 transitions.
[2025-05-07 17:28:45,365 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (24), 1 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24)
[2025-05-07 17:28:45,365 INFO  L278                IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions.
[2025-05-07 17:28:45,365 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2025-05-07 17:28:45,365 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:45,366 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:45,366 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-05-07 17:28:45,366 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:45,366 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:45,366 INFO  L85        PathProgramCache]: Analyzing trace with hash 1986163175, now seen corresponding path program 1 times
[2025-05-07 17:28:45,366 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:45,366 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201421974]
[2025-05-07 17:28:45,366 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:45,366 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:45,397 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes.
[2025-05-07 17:28:45,399 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements.
[2025-05-07 17:28:45,400 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:45,400 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:45,449 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:45,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:45,449 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201421974]
[2025-05-07 17:28:45,449 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201421974] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:45,449 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:45,449 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:45,449 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713901309]
[2025-05-07 17:28:45,449 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:45,450 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:45,450 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:45,450 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:45,450 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:45,450 INFO  L87              Difference]: Start difference. First operand 95 states and 99 transitions. Second operand  has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (24), 1 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24)
[2025-05-07 17:28:45,454 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:45,454 INFO  L93              Difference]: Finished difference Result 89 states and 93 transitions.
[2025-05-07 17:28:45,455 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:45,455 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (24), 1 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 86
[2025-05-07 17:28:45,455 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:45,455 INFO  L225             Difference]: With dead ends: 89
[2025-05-07 17:28:45,455 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:28:45,455 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:45,456 INFO  L437           NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:45,456 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:45,456 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:28:45,457 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:28:45,457 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:45,457 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:28:45,457 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86
[2025-05-07 17:28:45,457 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:45,457 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:28:45,457 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 3 states have call successors, (24), 1 states have call predecessors, (24), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24)
[2025-05-07 17:28:45,457 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:28:45,457 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:28:45,460 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:28:45,460 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-05-07 17:28:45,463 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:45,465 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:28:45,468 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:28:45 BoogieIcfgContainer
[2025-05-07 17:28:45,468 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:28:45,468 INFO  L158              Benchmark]: Toolchain (without parser) took 3869.28ms. Allocated memory is still 234.9MB. Free memory was 140.9MB in the beginning and 137.0MB in the end (delta: 3.9MB). Peak memory consumption was 18.6MB. Max. memory is 33.6GB.
[2025-05-07 17:28:45,469 INFO  L158              Benchmark]: SmtParser took 0.19ms. Allocated memory is still 234.9MB. Free memory is still 173.2MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:45,469 INFO  L158              Benchmark]: ChcToBoogie took 32.13ms. Allocated memory is still 234.9MB. Free memory was 140.9MB in the beginning and 137.4MB in the end (delta: 3.5MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-05-07 17:28:45,469 INFO  L158              Benchmark]: Boogie Preprocessor took 57.98ms. Allocated memory is still 234.9MB. Free memory was 137.4MB in the beginning and 133.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:45,469 INFO  L158              Benchmark]: RCFGBuilder took 525.60ms. Allocated memory is still 234.9MB. Free memory was 133.5MB in the beginning and 147.3MB in the end (delta: -13.8MB). Peak memory consumption was 27.6MB. Max. memory is 33.6GB.
[2025-05-07 17:28:45,469 INFO  L158              Benchmark]: TraceAbstraction took 3249.95ms. Allocated memory is still 234.9MB. Free memory was 146.7MB in the beginning and 137.0MB in the end (delta: 9.7MB). Peak memory consumption was 7.8MB. Max. memory is 33.6GB.
[2025-05-07 17:28:45,470 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.19ms. Allocated memory is still 234.9MB. Free memory is still 173.2MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 32.13ms. Allocated memory is still 234.9MB. Free memory was 140.9MB in the beginning and 137.4MB in the end (delta: 3.5MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * Boogie Preprocessor took 57.98ms. Allocated memory is still 234.9MB. Free memory was 137.4MB in the beginning and 133.5MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 525.60ms. Allocated memory is still 234.9MB. Free memory was 133.5MB in the beginning and 147.3MB in the end (delta: -13.8MB). Peak memory consumption was 27.6MB. Max. memory is 33.6GB.
 * TraceAbstraction took 3249.95ms. Allocated memory is still 234.9MB. Free memory was 146.7MB in the beginning and 137.0MB in the end (delta: 9.7MB). Peak memory consumption was 7.8MB. 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 43 procedures, 182 locations, 294 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16 mSDsluCounter, 13610 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11158 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 743 IncrementalHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 2452 mSDtfsCounter, 743 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182occurred in iteration=0, InterpolantAutomatonStates: 94, 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, 14 MinimizatonAttempts, 16 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 879 NumberOfCodeBlocks, 879 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 865 ConstructedInterpolants, 0 QuantifiedInterpolants, 1174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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:45,482 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
