./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/base_contract_assertion_fail_9.sol_4_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:29:25,174 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:29:25,212 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf5f7c5-ce59-48f9-8d15-579f98dc162e/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:29:25,215 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:29:25,215 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:29:25,228 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:29:25,228 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:29:25,228 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:29:25,229 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:29:25,229 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:29:25,229 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:29:25,229 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:29:25,229 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:29:25,229 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:29:25,229 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:29:25,229 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:29:25,229 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:29:25,230 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:29:25,230 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:29:25,230 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:29:25,230 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:29:25,230 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:29:25,230 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:29:25,230 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:29:25,230 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:29:25,231 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:29:25,231 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:29:25,411 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:29:25,417 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:29:25,419 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:29:25,419 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:29:25,420 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:29:25,421 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf5f7c5-ce59-48f9-8d15-579f98dc162e/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/base_contract_assertion_fail_9.sol_4_no_adts_000.smt2
[2025-05-07 17:29:25,421 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:29:25,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:29:25,828 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eaf5f7c5-ce59-48f9-8d15-579f98dc162e/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/base_contract_assertion_fail_9.sol_4_no_adts_000.smt2
[2025-05-07 17:29:25,831 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:29:25,832 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:29:25,832 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:29:25,833 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:29:25,833 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:29:25,834 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:29:25" (1/1) ...
[2025-05-07 17:29:25,874 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:25 Unit
[2025-05-07 17:29:25,874 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:29:25,875 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:29:25,875 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:29:25,875 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:29:25,886 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:25" (1/1) ...
[2025-05-07 17:29:25,886 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:25" (1/1) ...
[2025-05-07 17:29:25,915 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:25" (1/1) ...
[2025-05-07 17:29:25,915 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:25" (1/1) ...
[2025-05-07 17:29:25,924 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:25" (1/1) ...
[2025-05-07 17:29:25,926 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:25" (1/1) ...
[2025-05-07 17:29:25,928 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:25" (1/1) ...
[2025-05-07 17:29:25,932 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:25" (1/1) ...
[2025-05-07 17:29:25,935 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:25" (1/1) ...
[2025-05-07 17:29:25,951 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:29:25,952 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:29:25,952 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:29:25,952 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:29:25,953 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:25" (1/1) ...
[2025-05-07 17:29:25,955 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:29:25,964 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:25,973 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-05-07 17:29:25,975 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:29:25,986 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:29:25,986 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:29:25,986 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:29:25,986 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_16_0 given in one single declaration
[2025-05-07 17:29:25,987 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_16_0
[2025-05-07 17:29:25,987 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_16_0
[2025-05-07 17:29:25,987 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_21_function_g__56_66_0 given in one single declaration
[2025-05-07 17:29:25,987 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_21_function_g__56_66_0
[2025-05-07 17:29:25,987 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_21_function_g__56_66_0
[2025-05-07 17:29:25,987 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_20_function_g__56_66_0 given in one single declaration
[2025-05-07 17:29:25,987 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_20_function_g__56_66_0
[2025-05-07 17:29:25,987 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_20_function_g__56_66_0
[2025-05-07 17:29:25,987 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_74_return_function_g__56_66_0 given in one single declaration
[2025-05-07 17:29:25,987 INFO  L130     BoogieDeclarations]: Found specification of procedure block_74_return_function_g__56_66_0
[2025-05-07 17:29:25,987 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_74_return_function_g__56_66_0
[2025-05-07 17:29:25,988 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_75_function_f__42_66_0 given in one single declaration
[2025-05-07 17:29:25,988 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_75_function_f__42_66_0
[2025-05-07 17:29:25,988 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_75_function_f__42_66_0
[2025-05-07 17:29:25,988 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_18_function_f__42_66_0 given in one single declaration
[2025-05-07 17:29:25,988 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_18_function_f__42_66_0
[2025-05-07 17:29:25,988 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_18_function_f__42_66_0
[2025-05-07 17:29:25,988 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_68_f_41_66_0 given in one single declaration
[2025-05-07 17:29:25,988 INFO  L130     BoogieDeclarations]: Found specification of procedure block_68_f_41_66_0
[2025-05-07 17:29:25,988 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_68_f_41_66_0
[2025-05-07 17:29:25,988 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_67_function_f__42_66_0 given in one single declaration
[2025-05-07 17:29:25,988 INFO  L130     BoogieDeclarations]: Found specification of procedure block_67_function_f__42_66_0
[2025-05-07 17:29:25,988 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_67_function_f__42_66_0
[2025-05-07 17:29:25,989 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_70_function_f__21_66_0 given in one single declaration
[2025-05-07 17:29:25,989 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_70_function_f__21_66_0
[2025-05-07 17:29:25,989 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_70_function_f__21_66_0
[2025-05-07 17:29:25,989 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_16_function_f__21_66_0 given in one single declaration
[2025-05-07 17:29:25,989 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_16_function_f__21_66_0
[2025-05-07 17:29:25,989 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_16_function_f__21_66_0
[2025-05-07 17:29:25,989 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_63_function_f__21_66_0 given in one single declaration
[2025-05-07 17:29:25,989 INFO  L130     BoogieDeclarations]: Found specification of procedure block_63_function_f__21_66_0
[2025-05-07 17:29:25,989 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_63_function_f__21_66_0
[2025-05-07 17:29:25,989 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_61_function_v__65_66_0 given in one single declaration
[2025-05-07 17:29:25,989 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_61_function_v__65_66_0
[2025-05-07 17:29:25,989 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_61_function_v__65_66_0
[2025-05-07 17:29:25,989 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_22_function_v__65_66_0 given in one single declaration
[2025-05-07 17:29:25,989 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_22_function_v__65_66_0
[2025-05-07 17:29:25,989 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_22_function_v__65_66_0
[2025-05-07 17:29:25,989 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_79_return_function_v__65_66_0 given in one single declaration
[2025-05-07 17:29:25,989 INFO  L130     BoogieDeclarations]: Found specification of procedure block_79_return_function_v__65_66_0
[2025-05-07 17:29:25,990 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_79_return_function_v__65_66_0
[2025-05-07 17:29:25,990 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_78_v_64_66_0 given in one single declaration
[2025-05-07 17:29:25,990 INFO  L130     BoogieDeclarations]: Found specification of procedure block_78_v_64_66_0
[2025-05-07 17:29:25,990 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_78_v_64_66_0
[2025-05-07 17:29:25,990 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_77_function_v__65_66_0 given in one single declaration
[2025-05-07 17:29:25,990 INFO  L130     BoogieDeclarations]: Found specification of procedure block_77_function_v__65_66_0
[2025-05-07 17:29:25,990 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_77_function_v__65_66_0
[2025-05-07 17:29:25,990 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_59_f_20_66_0 given in one single declaration
[2025-05-07 17:29:25,990 INFO  L130     BoogieDeclarations]: Found specification of procedure block_59_f_20_66_0
[2025-05-07 17:29:25,990 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_59_f_20_66_0
[2025-05-07 17:29:25,990 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_58_function_f__21_66_0 given in one single declaration
[2025-05-07 17:29:25,990 INFO  L130     BoogieDeclarations]: Found specification of procedure block_58_function_f__21_66_0
[2025-05-07 17:29:25,990 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_58_function_f__21_66_0
[2025-05-07 17:29:25,990 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_62_function_f__21_66_0 given in one single declaration
[2025-05-07 17:29:25,990 INFO  L130     BoogieDeclarations]: Found specification of procedure block_62_function_f__21_66_0
[2025-05-07 17:29:25,990 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_62_function_f__21_66_0
[2025-05-07 17:29:25,990 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_60_return_function_f__21_66_0 given in one single declaration
[2025-05-07 17:29:25,990 INFO  L130     BoogieDeclarations]: Found specification of procedure block_60_return_function_f__21_66_0
[2025-05-07 17:29:25,991 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_60_return_function_f__21_66_0
[2025-05-07 17:29:25,991 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_69_return_function_f__42_66_0 given in one single declaration
[2025-05-07 17:29:25,991 INFO  L130     BoogieDeclarations]: Found specification of procedure block_69_return_function_f__42_66_0
[2025-05-07 17:29:25,991 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_69_return_function_f__42_66_0
[2025-05-07 17:29:25,991 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_73_g_55_66_0 given in one single declaration
[2025-05-07 17:29:25,991 INFO  L130     BoogieDeclarations]: Found specification of procedure block_73_g_55_66_0
[2025-05-07 17:29:25,991 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_73_g_55_66_0
[2025-05-07 17:29:25,991 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_72_function_g__56_66_0 given in one single declaration
[2025-05-07 17:29:25,991 INFO  L130     BoogieDeclarations]: Found specification of procedure block_72_function_g__56_66_0
[2025-05-07 17:29:25,991 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_72_function_g__56_66_0
[2025-05-07 17:29:25,991 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_76_function_g__56_66_0 given in one single declaration
[2025-05-07 17:29:25,991 INFO  L130     BoogieDeclarations]: Found specification of procedure block_76_function_g__56_66_0
[2025-05-07 17:29:25,991 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_76_function_g__56_66_0
[2025-05-07 17:29:25,991 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_0_A_30_0 given in one single declaration
[2025-05-07 17:29:25,991 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_0_A_30_0
[2025-05-07 17:29:25,992 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_0_A_30_0
[2025-05-07 17:29:25,992 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_2_A_30_0 given in one single declaration
[2025-05-07 17:29:25,992 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_2_A_30_0
[2025-05-07 17:29:25,992 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_2_A_30_0
[2025-05-07 17:29:25,992 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_36_A_30_0 given in one single declaration
[2025-05-07 17:29:25,992 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_36_A_30_0
[2025-05-07 17:29:25,992 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_36_A_30_0
[2025-05-07 17:29:25,992 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_33_A_30_0 given in one single declaration
[2025-05-07 17:29:25,992 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_33_A_30_0
[2025-05-07 17:29:25,992 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_33_A_30_0
[2025-05-07 17:29:25,992 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_35_A_30_0 given in one single declaration
[2025-05-07 17:29:25,992 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_35_A_30_0
[2025-05-07 17:29:25,992 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_35_A_30_0
[2025-05-07 17:29:25,992 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_34_A_30_0 given in one single declaration
[2025-05-07 17:29:25,992 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_34_A_30_0
[2025-05-07 17:29:25,992 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_34_A_30_0
[2025-05-07 17:29:25,992 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_4_function_f__21_30_0 given in one single declaration
[2025-05-07 17:29:25,992 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_4_function_f__21_30_0
[2025-05-07 17:29:25,992 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_4_function_f__21_30_0
[2025-05-07 17:29:25,992 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_29_function_f__21_30_0 given in one single declaration
[2025-05-07 17:29:25,992 INFO  L130     BoogieDeclarations]: Found specification of procedure block_29_function_f__21_30_0
[2025-05-07 17:29:25,992 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_29_function_f__21_30_0
[2025-05-07 17:29:25,992 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_3_function_f__21_30_0 given in one single declaration
[2025-05-07 17:29:25,993 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_3_function_f__21_30_0
[2025-05-07 17:29:25,993 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_3_function_f__21_30_0
[2025-05-07 17:29:25,993 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_25_return_function_f__21_30_0 given in one single declaration
[2025-05-07 17:29:25,993 INFO  L130     BoogieDeclarations]: Found specification of procedure block_25_return_function_f__21_30_0
[2025-05-07 17:29:25,993 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_25_return_function_f__21_30_0
[2025-05-07 17:29:25,993 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_26_function_v__29_30_0 given in one single declaration
[2025-05-07 17:29:25,993 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_26_function_v__29_30_0
[2025-05-07 17:29:25,993 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_26_function_v__29_30_0
[2025-05-07 17:29:25,993 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_5_function_v__29_30_0 given in one single declaration
[2025-05-07 17:29:25,993 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_5_function_v__29_30_0
[2025-05-07 17:29:25,993 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_5_function_v__29_30_0
[2025-05-07 17:29:25,993 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_32_return_function_v__29_30_0 given in one single declaration
[2025-05-07 17:29:25,993 INFO  L130     BoogieDeclarations]: Found specification of procedure block_32_return_function_v__29_30_0
[2025-05-07 17:29:25,993 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_32_return_function_v__29_30_0
[2025-05-07 17:29:25,993 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_31_v_28_30_0 given in one single declaration
[2025-05-07 17:29:25,993 INFO  L130     BoogieDeclarations]: Found specification of procedure block_31_v_28_30_0
[2025-05-07 17:29:25,993 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_31_v_28_30_0
[2025-05-07 17:29:25,993 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_30_function_v__29_30_0 given in one single declaration
[2025-05-07 17:29:25,993 INFO  L130     BoogieDeclarations]: Found specification of procedure block_30_function_v__29_30_0
[2025-05-07 17:29:25,993 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_30_function_v__29_30_0
[2025-05-07 17:29:25,993 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_24_f_20_30_0 given in one single declaration
[2025-05-07 17:29:25,993 INFO  L130     BoogieDeclarations]: Found specification of procedure block_24_f_20_30_0
[2025-05-07 17:29:25,993 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_24_f_20_30_0
[2025-05-07 17:29:25,994 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_23_function_f__21_30_0 given in one single declaration
[2025-05-07 17:29:25,994 INFO  L130     BoogieDeclarations]: Found specification of procedure block_23_function_f__21_30_0
[2025-05-07 17:29:25,994 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_23_function_f__21_30_0
[2025-05-07 17:29:25,994 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_27_function_f__21_30_0 given in one single declaration
[2025-05-07 17:29:25,994 INFO  L130     BoogieDeclarations]: Found specification of procedure block_27_function_f__21_30_0
[2025-05-07 17:29:25,994 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_27_function_f__21_30_0
[2025-05-07 17:29:25,994 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_28_function_f__21_30_0 given in one single declaration
[2025-05-07 17:29:25,994 INFO  L130     BoogieDeclarations]: Found specification of procedure block_28_function_f__21_30_0
[2025-05-07 17:29:25,994 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_28_function_f__21_30_0
[2025-05-07 17:29:25,994 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_12_function_f__42_43_0 given in one single declaration
[2025-05-07 17:29:25,994 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_12_function_f__42_43_0
[2025-05-07 17:29:25,994 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_12_function_f__42_43_0
[2025-05-07 17:29:25,994 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_11_function_f__42_43_0 given in one single declaration
[2025-05-07 17:29:25,994 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_11_function_f__42_43_0
[2025-05-07 17:29:25,994 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_11_function_f__42_43_0
[2025-05-07 17:29:25,994 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_48_return_function_f__42_43_0 given in one single declaration
[2025-05-07 17:29:25,995 INFO  L130     BoogieDeclarations]: Found specification of procedure block_48_return_function_f__42_43_0
[2025-05-07 17:29:25,995 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_48_return_function_f__42_43_0
[2025-05-07 17:29:25,995 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_49_function_f__21_43_0 given in one single declaration
[2025-05-07 17:29:25,995 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_49_function_f__21_43_0
[2025-05-07 17:29:25,995 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_49_function_f__21_43_0
[2025-05-07 17:29:25,995 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_9_function_f__21_43_0 given in one single declaration
[2025-05-07 17:29:25,995 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_9_function_f__21_43_0
[2025-05-07 17:29:25,995 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_9_function_f__21_43_0
[2025-05-07 17:29:25,995 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_41_function_f__21_43_0 given in one single declaration
[2025-05-07 17:29:25,995 INFO  L130     BoogieDeclarations]: Found specification of procedure block_41_function_f__21_43_0
[2025-05-07 17:29:25,995 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_41_function_f__21_43_0
[2025-05-07 17:29:25,995 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_39_return_function_f__21_43_0 given in one single declaration
[2025-05-07 17:29:25,995 INFO  L130     BoogieDeclarations]: Found specification of procedure block_39_return_function_f__21_43_0
[2025-05-07 17:29:25,995 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_39_return_function_f__21_43_0
[2025-05-07 17:29:25,995 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_40_function_v__29_43_0 given in one single declaration
[2025-05-07 17:29:25,996 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_40_function_v__29_43_0
[2025-05-07 17:29:25,996 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_40_function_v__29_43_0
[2025-05-07 17:29:25,996 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_10_function_v__29_43_0 given in one single declaration
[2025-05-07 17:29:25,996 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_10_function_v__29_43_0
[2025-05-07 17:29:25,996 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_10_function_v__29_43_0
[2025-05-07 17:29:25,996 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_45_return_function_v__29_43_0 given in one single declaration
[2025-05-07 17:29:25,996 INFO  L130     BoogieDeclarations]: Found specification of procedure block_45_return_function_v__29_43_0
[2025-05-07 17:29:25,996 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_45_return_function_v__29_43_0
[2025-05-07 17:29:25,996 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_44_v_28_43_0 given in one single declaration
[2025-05-07 17:29:25,996 INFO  L130     BoogieDeclarations]: Found specification of procedure block_44_v_28_43_0
[2025-05-07 17:29:25,996 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_44_v_28_43_0
[2025-05-07 17:29:25,996 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_43_function_v__29_43_0 given in one single declaration
[2025-05-07 17:29:25,996 INFO  L130     BoogieDeclarations]: Found specification of procedure block_43_function_v__29_43_0
[2025-05-07 17:29:25,996 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_43_function_v__29_43_0
[2025-05-07 17:29:25,996 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_38_f_20_43_0 given in one single declaration
[2025-05-07 17:29:25,996 INFO  L130     BoogieDeclarations]: Found specification of procedure block_38_f_20_43_0
[2025-05-07 17:29:25,997 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_38_f_20_43_0
[2025-05-07 17:29:25,997 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_37_function_f__21_43_0 given in one single declaration
[2025-05-07 17:29:25,997 INFO  L130     BoogieDeclarations]: Found specification of procedure block_37_function_f__21_43_0
[2025-05-07 17:29:25,997 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_37_function_f__21_43_0
[2025-05-07 17:29:25,997 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_42_function_f__21_43_0 given in one single declaration
[2025-05-07 17:29:25,997 INFO  L130     BoogieDeclarations]: Found specification of procedure block_42_function_f__21_43_0
[2025-05-07 17:29:25,997 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_42_function_f__21_43_0
[2025-05-07 17:29:25,997 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_47_f_41_43_0 given in one single declaration
[2025-05-07 17:29:25,997 INFO  L130     BoogieDeclarations]: Found specification of procedure block_47_f_41_43_0
[2025-05-07 17:29:25,997 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_47_f_41_43_0
[2025-05-07 17:29:25,997 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_46_function_f__42_43_0 given in one single declaration
[2025-05-07 17:29:25,997 INFO  L130     BoogieDeclarations]: Found specification of procedure block_46_function_f__42_43_0
[2025-05-07 17:29:25,997 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_46_function_f__42_43_0
[2025-05-07 17:29:25,997 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_50_function_f__42_43_0 given in one single declaration
[2025-05-07 17:29:25,997 INFO  L130     BoogieDeclarations]: Found specification of procedure block_50_function_f__42_43_0
[2025-05-07 17:29:25,997 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_50_function_f__42_43_0
[2025-05-07 17:29:25,997 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_6_B_43_0 given in one single declaration
[2025-05-07 17:29:25,997 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_6_B_43_0
[2025-05-07 17:29:25,997 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_6_B_43_0
[2025-05-07 17:29:25,998 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_8_B_43_0 given in one single declaration
[2025-05-07 17:29:25,998 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_8_B_43_0
[2025-05-07 17:29:25,998 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_8_B_43_0
[2025-05-07 17:29:25,998 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_51_B_43_0 given in one single declaration
[2025-05-07 17:29:25,998 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_51_B_43_0
[2025-05-07 17:29:25,998 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_51_B_43_0
[2025-05-07 17:29:25,998 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_53_B_43_0 given in one single declaration
[2025-05-07 17:29:25,998 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_53_B_43_0
[2025-05-07 17:29:25,998 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_53_B_43_0
[2025-05-07 17:29:25,998 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_52_B_43_0 given in one single declaration
[2025-05-07 17:29:25,998 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_52_B_43_0
[2025-05-07 17:29:25,998 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_52_B_43_0
[2025-05-07 17:29:25,998 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_57_B_43_0 given in one single declaration
[2025-05-07 17:29:25,998 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_57_B_43_0
[2025-05-07 17:29:25,998 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_57_B_43_0
[2025-05-07 17:29:25,998 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_54_A_30_0 given in one single declaration
[2025-05-07 17:29:25,998 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_54_A_30_0
[2025-05-07 17:29:25,999 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_54_A_30_0
[2025-05-07 17:29:25,999 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_56_A_30_0 given in one single declaration
[2025-05-07 17:29:25,999 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_56_A_30_0
[2025-05-07 17:29:25,999 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_56_A_30_0
[2025-05-07 17:29:25,999 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_55_A_30_0 given in one single declaration
[2025-05-07 17:29:25,999 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_55_A_30_0
[2025-05-07 17:29:25,999 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_55_A_30_0
[2025-05-07 17:29:25,999 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_13_C_66_0 given in one single declaration
[2025-05-07 17:29:25,999 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_13_C_66_0
[2025-05-07 17:29:25,999 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_13_C_66_0
[2025-05-07 17:29:25,999 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_15_C_66_0 given in one single declaration
[2025-05-07 17:29:25,999 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_15_C_66_0
[2025-05-07 17:29:25,999 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_15_C_66_0
[2025-05-07 17:29:25,999 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_83_B_43_0 given in one single declaration
[2025-05-07 17:29:25,999 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_83_B_43_0
[2025-05-07 17:29:25,999 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_83_B_43_0
[2025-05-07 17:29:25,999 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_85_B_43_0 given in one single declaration
[2025-05-07 17:29:26,000 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_85_B_43_0
[2025-05-07 17:29:26,000 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_85_B_43_0
[2025-05-07 17:29:26,000 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_84_B_43_0 given in one single declaration
[2025-05-07 17:29:26,000 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_84_B_43_0
[2025-05-07 17:29:26,000 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_84_B_43_0
[2025-05-07 17:29:26,000 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_80_C_66_0 given in one single declaration
[2025-05-07 17:29:26,000 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_80_C_66_0
[2025-05-07 17:29:26,000 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_80_C_66_0
[2025-05-07 17:29:26,000 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_82_C_66_0 given in one single declaration
[2025-05-07 17:29:26,000 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_82_C_66_0
[2025-05-07 17:29:26,000 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_82_C_66_0
[2025-05-07 17:29:26,000 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_81_C_66_0 given in one single declaration
[2025-05-07 17:29:26,000 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_81_C_66_0
[2025-05-07 17:29:26,000 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_81_C_66_0
[2025-05-07 17:29:26,000 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_86_A_30_0 given in one single declaration
[2025-05-07 17:29:26,000 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_86_A_30_0
[2025-05-07 17:29:26,000 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_86_A_30_0
[2025-05-07 17:29:26,000 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_88_A_30_0 given in one single declaration
[2025-05-07 17:29:26,001 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_88_A_30_0
[2025-05-07 17:29:26,001 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_88_A_30_0
[2025-05-07 17:29:26,001 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_87_A_30_0 given in one single declaration
[2025-05-07 17:29:26,001 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_87_A_30_0
[2025-05-07 17:29:26,001 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_87_A_30_0
[2025-05-07 17:29:26,001 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_89_C_66_0 given in one single declaration
[2025-05-07 17:29:26,001 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_89_C_66_0
[2025-05-07 17:29:26,001 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_89_C_66_0
[2025-05-07 17:29:26,001 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_19_function_f__42_66_0 given in one single declaration
[2025-05-07 17:29:26,001 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_19_function_f__42_66_0
[2025-05-07 17:29:26,001 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_19_function_f__42_66_0
[2025-05-07 17:29:26,001 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_71_function_f__42_66_0 given in one single declaration
[2025-05-07 17:29:26,001 INFO  L130     BoogieDeclarations]: Found specification of procedure block_71_function_f__42_66_0
[2025-05-07 17:29:26,001 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_71_function_f__42_66_0
[2025-05-07 17:29:26,001 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:29:26,001 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:29:26,001 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:29:26,334 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:29:26,336 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:29:26,768 INFO  L?                        ?]: Removed 677 outVars from TransFormulas that were not future-live.
[2025-05-07 17:29:26,768 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:29:26,780 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:29:26,781 INFO  L312             CfgBuilder]: Removed 47 assume(true) statements.
[2025-05-07 17:29:26,781 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:29:26 BoogieIcfgContainer
[2025-05-07 17:29:26,781 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:29:26,782 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:29:26,783 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:29:26,785 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:29:26,785 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:29:25" (1/3) ...
[2025-05-07 17:29:26,786 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2733a333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:29:26, skipping insertion in model container
[2025-05-07 17:29:26,786 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:25" (2/3) ...
[2025-05-07 17:29:26,786 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2733a333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:29:26, skipping insertion in model container
[2025-05-07 17:29:26,786 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:29:26" (3/3) ...
[2025-05-07 17:29:26,787 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:29:26,798 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:29:26,800 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 86 procedures, 347 locations, 556 edges, 86 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:29:26,834 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:29:26,843 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;@57d88d6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:29:26,843 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:29:26,847 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 347 states, 137 states have (on average 1.102189781021898) internal successors, (151), 151 states have internal predecessors, (151), 129 states have call successors, (135), 85 states have call predecessors, (135), 85 states have return successors, (135), 110 states have call predecessors, (135), 129 states have call successors, (135)
[2025-05-07 17:29:26,860 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2025-05-07 17:29:26,860 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:26,860 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:26,861 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:26,864 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:26,865 INFO  L85        PathProgramCache]: Analyzing trace with hash -648681653, now seen corresponding path program 1 times
[2025-05-07 17:29:26,870 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:26,871 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107163443]
[2025-05-07 17:29:26,871 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:26,871 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:26,929 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes.
[2025-05-07 17:29:26,948 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements.
[2025-05-07 17:29:26,948 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:26,948 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:27,161 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:27,161 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:27,161 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107163443]
[2025-05-07 17:29:27,162 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107163443] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:27,162 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:27,164 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:27,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517709638]
[2025-05-07 17:29:27,166 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:27,169 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:27,169 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:27,208 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:27,208 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:27,211 INFO  L87              Difference]: Start difference. First operand  has 347 states, 137 states have (on average 1.102189781021898) internal successors, (151), 151 states have internal predecessors, (151), 129 states have call successors, (135), 85 states have call predecessors, (135), 85 states have return successors, (135), 110 states have call predecessors, (135), 129 states have call successors, (135) Second operand  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (22), 1 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22)
[2025-05-07 17:29:27,280 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:27,281 INFO  L93              Difference]: Finished difference Result 349 states and 423 transitions.
[2025-05-07 17:29:27,282 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:27,283 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (22), 1 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 79
[2025-05-07 17:29:27,283 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:27,291 INFO  L225             Difference]: With dead ends: 349
[2025-05-07 17:29:27,291 INFO  L226             Difference]: Without dead ends: 342
[2025-05-07 17:29:27,292 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:27,294 INFO  L437           NwaCegarLoop]: 419 mSDtfsCounter, 1 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1246 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:29:27,295 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1246 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:27,305 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 342 states.
[2025-05-07 17:29:27,332 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340.
[2025-05-07 17:29:27,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 340 states, 136 states have (on average 1.0808823529411764) internal successors, (147), 147 states have internal predecessors, (147), 124 states have call successors, (130), 85 states have call predecessors, (130), 85 states have return successors, (130), 107 states have call predecessors, (130), 124 states have call successors, (130)
[2025-05-07 17:29:27,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 407 transitions.
[2025-05-07 17:29:27,338 INFO  L79                 Accepts]: Start accepts. Automaton has 340 states and 407 transitions. Word has length 79
[2025-05-07 17:29:27,339 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:27,339 INFO  L485      AbstractCegarLoop]: Abstraction has 340 states and 407 transitions.
[2025-05-07 17:29:27,339 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (22), 1 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22)
[2025-05-07 17:29:27,339 INFO  L278                IsEmpty]: Start isEmpty. Operand 340 states and 407 transitions.
[2025-05-07 17:29:27,341 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-05-07 17:29:27,341 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:27,342 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]
[2025-05-07 17:29:27,342 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:29:27,343 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:27,343 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:27,343 INFO  L85        PathProgramCache]: Analyzing trace with hash 1441380894, now seen corresponding path program 1 times
[2025-05-07 17:29:27,343 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:27,343 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575942052]
[2025-05-07 17:29:27,343 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:27,343 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:27,375 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-05-07 17:29:27,412 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-05-07 17:29:27,412 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:27,412 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:27,547 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:27,547 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:27,547 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575942052]
[2025-05-07 17:29:27,547 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575942052] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:27,547 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:27,547 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:29:27,547 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881182263]
[2025-05-07 17:29:27,548 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:27,549 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:29:27,549 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:27,549 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:29:27,550 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:27,550 INFO  L87              Difference]: Start difference. First operand 340 states and 407 transitions. Second operand  has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (18), 7 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:29:27,624 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:27,624 INFO  L93              Difference]: Finished difference Result 340 states and 406 transitions.
[2025-05-07 17:29:27,625 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:29:27,625 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (18), 7 states have call predecessors, (18), 4 states have call successors, (18) Word has length 65
[2025-05-07 17:29:27,625 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:27,627 INFO  L225             Difference]: With dead ends: 340
[2025-05-07 17:29:27,627 INFO  L226             Difference]: Without dead ends: 338
[2025-05-07 17:29:27,627 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:27,628 INFO  L437           NwaCegarLoop]: 400 mSDtfsCounter, 0 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:27,628 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2384 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:27,629 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 338 states.
[2025-05-07 17:29:27,641 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338.
[2025-05-07 17:29:27,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 338 states, 135 states have (on average 1.0814814814814815) internal successors, (146), 146 states have internal predecessors, (146), 122 states have call successors, (128), 85 states have call predecessors, (128), 85 states have return successors, (128), 106 states have call predecessors, (128), 122 states have call successors, (128)
[2025-05-07 17:29:27,643 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 402 transitions.
[2025-05-07 17:29:27,644 INFO  L79                 Accepts]: Start accepts. Automaton has 338 states and 402 transitions. Word has length 65
[2025-05-07 17:29:27,644 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:27,644 INFO  L485      AbstractCegarLoop]: Abstraction has 338 states and 402 transitions.
[2025-05-07 17:29:27,644 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 4 states have call successors, (18), 1 states have call predecessors, (18), 6 states have return successors, (18), 7 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:29:27,644 INFO  L278                IsEmpty]: Start isEmpty. Operand 338 states and 402 transitions.
[2025-05-07 17:29:27,646 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2025-05-07 17:29:27,646 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:27,646 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:27,646 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:29:27,646 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:27,646 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:27,647 INFO  L85        PathProgramCache]: Analyzing trace with hash -1602293521, now seen corresponding path program 1 times
[2025-05-07 17:29:27,647 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:27,647 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311639066]
[2025-05-07 17:29:27,647 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:27,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:27,674 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes.
[2025-05-07 17:29:27,690 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements.
[2025-05-07 17:29:27,690 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:27,690 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:27,779 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:27,780 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:27,780 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311639066]
[2025-05-07 17:29:27,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311639066] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:27,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:27,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:27,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685800888]
[2025-05-07 17:29:27,780 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:27,780 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:27,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:27,781 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:27,781 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:27,782 INFO  L87              Difference]: Start difference. First operand 338 states and 402 transitions. Second operand  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (22), 1 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22)
[2025-05-07 17:29:27,798 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:27,798 INFO  L93              Difference]: Finished difference Result 342 states and 408 transitions.
[2025-05-07 17:29:27,798 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:27,798 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (22), 1 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 79
[2025-05-07 17:29:27,799 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:27,800 INFO  L225             Difference]: With dead ends: 342
[2025-05-07 17:29:27,801 INFO  L226             Difference]: Without dead ends: 331
[2025-05-07 17:29:27,801 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:27,801 INFO  L437           NwaCegarLoop]: 402 mSDtfsCounter, 1 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:27,801 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1190 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:27,802 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 331 states.
[2025-05-07 17:29:27,811 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329.
[2025-05-07 17:29:27,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 329 states, 135 states have (on average 1.0592592592592593) internal successors, (143), 143 states have internal predecessors, (143), 113 states have call successors, (119), 85 states have call predecessors, (119), 85 states have return successors, (119), 100 states have call predecessors, (119), 113 states have call successors, (119)
[2025-05-07 17:29:27,813 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 381 transitions.
[2025-05-07 17:29:27,813 INFO  L79                 Accepts]: Start accepts. Automaton has 329 states and 381 transitions. Word has length 79
[2025-05-07 17:29:27,814 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:27,814 INFO  L485      AbstractCegarLoop]: Abstraction has 329 states and 381 transitions.
[2025-05-07 17:29:27,814 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (22), 1 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22)
[2025-05-07 17:29:27,814 INFO  L278                IsEmpty]: Start isEmpty. Operand 329 states and 381 transitions.
[2025-05-07 17:29:27,815 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2025-05-07 17:29:27,815 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:27,816 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]
[2025-05-07 17:29:27,816 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:29:27,816 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:27,816 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:27,816 INFO  L85        PathProgramCache]: Analyzing trace with hash 560512299, now seen corresponding path program 1 times
[2025-05-07 17:29:27,816 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:27,816 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477114915]
[2025-05-07 17:29:27,817 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:27,817 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:27,854 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes.
[2025-05-07 17:29:27,863 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements.
[2025-05-07 17:29:27,864 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:27,864 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:28,022 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:28,022 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:28,022 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477114915]
[2025-05-07 17:29:28,022 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477114915] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:28,022 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:28,022 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:29:28,022 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21147175]
[2025-05-07 17:29:28,023 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:28,023 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:28,023 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:28,024 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:28,024 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:28,024 INFO  L87              Difference]: Start difference. First operand 329 states and 381 transitions. Second operand  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:29:28,072 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:28,072 INFO  L93              Difference]: Finished difference Result 326 states and 376 transitions.
[2025-05-07 17:29:28,073 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:28,073 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 68
[2025-05-07 17:29:28,073 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:28,075 INFO  L225             Difference]: With dead ends: 326
[2025-05-07 17:29:28,075 INFO  L226             Difference]: Without dead ends: 324
[2025-05-07 17:29:28,075 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:28,076 INFO  L437           NwaCegarLoop]: 372 mSDtfsCounter, 0 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1848 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:28,076 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1848 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:28,077 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 324 states.
[2025-05-07 17:29:28,084 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324.
[2025-05-07 17:29:28,084 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 324 states, 133 states have (on average 1.0601503759398496) internal successors, (141), 141 states have internal predecessors, (141), 111 states have call successors, (116), 84 states have call predecessors, (116), 84 states have return successors, (116), 98 states have call predecessors, (116), 111 states have call successors, (116)
[2025-05-07 17:29:28,086 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 373 transitions.
[2025-05-07 17:29:28,086 INFO  L79                 Accepts]: Start accepts. Automaton has 324 states and 373 transitions. Word has length 68
[2025-05-07 17:29:28,087 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:28,087 INFO  L485      AbstractCegarLoop]: Abstraction has 324 states and 373 transitions.
[2025-05-07 17:29:28,087 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:29:28,087 INFO  L278                IsEmpty]: Start isEmpty. Operand 324 states and 373 transitions.
[2025-05-07 17:29:28,088 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2025-05-07 17:29:28,088 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:28,088 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]
[2025-05-07 17:29:28,088 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:29:28,089 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:28,089 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:28,089 INFO  L85        PathProgramCache]: Analyzing trace with hash -868379189, now seen corresponding path program 1 times
[2025-05-07 17:29:28,089 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:28,089 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552475700]
[2025-05-07 17:29:28,089 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:28,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:28,115 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes.
[2025-05-07 17:29:28,129 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements.
[2025-05-07 17:29:28,129 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:28,129 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:28,322 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:28,322 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:28,322 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552475700]
[2025-05-07 17:29:28,322 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552475700] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:28,323 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:28,323 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:29:28,323 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701132034]
[2025-05-07 17:29:28,323 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:28,323 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:29:28,323 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:28,324 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:29:28,324 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:28,324 INFO  L87              Difference]: Start difference. First operand 324 states and 373 transitions. Second operand  has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 6 states have return successors, (19), 6 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:29:28,387 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:28,387 INFO  L93              Difference]: Finished difference Result 328 states and 377 transitions.
[2025-05-07 17:29:28,387 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:29:28,387 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 6 states have return successors, (19), 6 states have call predecessors, (19), 4 states have call successors, (19) Word has length 68
[2025-05-07 17:29:28,388 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:28,390 INFO  L225             Difference]: With dead ends: 328
[2025-05-07 17:29:28,390 INFO  L226             Difference]: Without dead ends: 324
[2025-05-07 17:29:28,390 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:28,391 INFO  L437           NwaCegarLoop]: 370 mSDtfsCounter, 1 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2203 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:28,391 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2203 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:28,391 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 324 states.
[2025-05-07 17:29:28,398 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322.
[2025-05-07 17:29:28,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 322 states, 133 states have (on average 1.0526315789473684) internal successors, (140), 140 states have internal predecessors, (140), 109 states have call successors, (114), 84 states have call predecessors, (114), 84 states have return successors, (114), 97 states have call predecessors, (114), 109 states have call successors, (114)
[2025-05-07 17:29:28,400 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 368 transitions.
[2025-05-07 17:29:28,400 INFO  L79                 Accepts]: Start accepts. Automaton has 322 states and 368 transitions. Word has length 68
[2025-05-07 17:29:28,400 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:28,400 INFO  L485      AbstractCegarLoop]: Abstraction has 322 states and 368 transitions.
[2025-05-07 17:29:28,400 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 4 states have call successors, (19), 1 states have call predecessors, (19), 6 states have return successors, (19), 6 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:29:28,400 INFO  L278                IsEmpty]: Start isEmpty. Operand 322 states and 368 transitions.
[2025-05-07 17:29:28,402 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2025-05-07 17:29:28,402 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:28,402 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]
[2025-05-07 17:29:28,402 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:29:28,402 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:28,403 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:28,403 INFO  L85        PathProgramCache]: Analyzing trace with hash -1508441329, now seen corresponding path program 1 times
[2025-05-07 17:29:28,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:28,403 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145838150]
[2025-05-07 17:29:28,403 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:28,403 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:28,430 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes.
[2025-05-07 17:29:28,445 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements.
[2025-05-07 17:29:28,445 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:28,445 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:28,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:29:28,544 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:28,544 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145838150]
[2025-05-07 17:29:28,544 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145838150] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:28,544 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:28,544 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:29:28,544 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108599751]
[2025-05-07 17:29:28,544 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:28,544 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:28,544 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:28,545 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:28,545 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:28,545 INFO  L87              Difference]: Start difference. First operand 322 states and 368 transitions. Second operand  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19)
[2025-05-07 17:29:28,591 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:28,591 INFO  L93              Difference]: Finished difference Result 327 states and 374 transitions.
[2025-05-07 17:29:28,591 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:28,592 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 68
[2025-05-07 17:29:28,592 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:28,594 INFO  L225             Difference]: With dead ends: 327
[2025-05-07 17:29:28,594 INFO  L226             Difference]: Without dead ends: 327
[2025-05-07 17:29:28,594 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:28,595 INFO  L437           NwaCegarLoop]: 368 mSDtfsCounter, 1 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1818 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:28,595 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1818 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:28,596 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 327 states.
[2025-05-07 17:29:28,604 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327.
[2025-05-07 17:29:28,604 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 327 states, 135 states have (on average 1.0518518518518518) internal successors, (142), 142 states have internal predecessors, (142), 110 states have call successors, (115), 84 states have call predecessors, (115), 86 states have return successors, (117), 100 states have call predecessors, (117), 110 states have call successors, (117)
[2025-05-07 17:29:28,605 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 374 transitions.
[2025-05-07 17:29:28,606 INFO  L79                 Accepts]: Start accepts. Automaton has 327 states and 374 transitions. Word has length 68
[2025-05-07 17:29:28,606 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:28,606 INFO  L485      AbstractCegarLoop]: Abstraction has 327 states and 374 transitions.
[2025-05-07 17:29:28,606 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19)
[2025-05-07 17:29:28,606 INFO  L278                IsEmpty]: Start isEmpty. Operand 327 states and 374 transitions.
[2025-05-07 17:29:28,607 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2025-05-07 17:29:28,607 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:28,607 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]
[2025-05-07 17:29:28,607 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:29:28,607 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:28,607 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:28,607 INFO  L85        PathProgramCache]: Analyzing trace with hash -1597509553, now seen corresponding path program 1 times
[2025-05-07 17:29:28,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:28,607 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877714615]
[2025-05-07 17:29:28,607 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:28,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:28,634 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes.
[2025-05-07 17:29:28,648 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements.
[2025-05-07 17:29:28,648 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:28,648 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:28,727 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:28,727 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:28,728 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877714615]
[2025-05-07 17:29:28,728 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877714615] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:28,728 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:28,728 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:29:28,728 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746524638]
[2025-05-07 17:29:28,728 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:28,728 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:28,728 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:28,729 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:28,729 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:28,729 INFO  L87              Difference]: Start difference. First operand 327 states and 374 transitions. Second operand  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19)
[2025-05-07 17:29:28,765 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:28,765 INFO  L93              Difference]: Finished difference Result 303 states and 345 transitions.
[2025-05-07 17:29:28,765 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:28,766 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 68
[2025-05-07 17:29:28,766 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:28,767 INFO  L225             Difference]: With dead ends: 303
[2025-05-07 17:29:28,767 INFO  L226             Difference]: Without dead ends: 255
[2025-05-07 17:29:28,767 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:28,768 INFO  L437           NwaCegarLoop]: 341 mSDtfsCounter, 1 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:28,768 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1686 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:28,769 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 255 states.
[2025-05-07 17:29:28,773 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255.
[2025-05-07 17:29:28,773 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 255 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 110 states have internal predecessors, (110), 88 states have call successors, (92), 66 states have call predecessors, (92), 66 states have return successors, (92), 78 states have call predecessors, (92), 88 states have call successors, (92)
[2025-05-07 17:29:28,774 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 294 transitions.
[2025-05-07 17:29:28,775 INFO  L79                 Accepts]: Start accepts. Automaton has 255 states and 294 transitions. Word has length 68
[2025-05-07 17:29:28,775 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:28,775 INFO  L485      AbstractCegarLoop]: Abstraction has 255 states and 294 transitions.
[2025-05-07 17:29:28,775 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 5 states have call successors, (19), 1 states have call predecessors, (19), 5 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19)
[2025-05-07 17:29:28,775 INFO  L278                IsEmpty]: Start isEmpty. Operand 255 states and 294 transitions.
[2025-05-07 17:29:28,776 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2025-05-07 17:29:28,776 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:28,776 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:28,776 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:29:28,776 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:28,776 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:28,776 INFO  L85        PathProgramCache]: Analyzing trace with hash -1152583210, now seen corresponding path program 1 times
[2025-05-07 17:29:28,776 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:28,776 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563617988]
[2025-05-07 17:29:28,776 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:28,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:28,810 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-05-07 17:29:28,826 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-05-07 17:29:28,826 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:28,826 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:28,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:28,924 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:28,924 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563617988]
[2025-05-07 17:29:28,924 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563617988] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:28,924 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:28,924 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:29:28,924 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722361047]
[2025-05-07 17:29:28,924 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:28,924 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:29:28,925 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:28,925 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:29:28,925 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:28,925 INFO  L87              Difference]: Start difference. First operand 255 states and 294 transitions. Second operand  has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (25), 1 states have call predecessors, (25), 6 states have return successors, (25), 7 states have call predecessors, (25), 3 states have call successors, (25)
[2025-05-07 17:29:28,990 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:28,990 INFO  L93              Difference]: Finished difference Result 255 states and 293 transitions.
[2025-05-07 17:29:28,991 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:29:28,991 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (25), 1 states have call predecessors, (25), 6 states have return successors, (25), 7 states have call predecessors, (25), 3 states have call successors, (25) Word has length 89
[2025-05-07 17:29:28,991 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:28,992 INFO  L225             Difference]: With dead ends: 255
[2025-05-07 17:29:28,992 INFO  L226             Difference]: Without dead ends: 253
[2025-05-07 17:29:28,992 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:28,992 INFO  L437           NwaCegarLoop]: 287 mSDtfsCounter, 0 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:28,993 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1706 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:28,993 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 253 states.
[2025-05-07 17:29:28,997 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253.
[2025-05-07 17:29:28,997 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 253 states, 104 states have (on average 1.0480769230769231) internal successors, (109), 109 states have internal predecessors, (109), 86 states have call successors, (90), 66 states have call predecessors, (90), 66 states have return successors, (90), 77 states have call predecessors, (90), 86 states have call successors, (90)
[2025-05-07 17:29:28,998 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 289 transitions.
[2025-05-07 17:29:28,999 INFO  L79                 Accepts]: Start accepts. Automaton has 253 states and 289 transitions. Word has length 89
[2025-05-07 17:29:28,999 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:28,999 INFO  L485      AbstractCegarLoop]: Abstraction has 253 states and 289 transitions.
[2025-05-07 17:29:28,999 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (25), 1 states have call predecessors, (25), 6 states have return successors, (25), 7 states have call predecessors, (25), 3 states have call successors, (25)
[2025-05-07 17:29:28,999 INFO  L278                IsEmpty]: Start isEmpty. Operand 253 states and 289 transitions.
[2025-05-07 17:29:29,000 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-05-07 17:29:29,000 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:29,000 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:29,000 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:29:29,000 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:29,000 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:29,000 INFO  L85        PathProgramCache]: Analyzing trace with hash -1102893078, now seen corresponding path program 1 times
[2025-05-07 17:29:29,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:29,001 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687281357]
[2025-05-07 17:29:29,001 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:29,001 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:29,026 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-05-07 17:29:29,036 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-05-07 17:29:29,036 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:29,037 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:29,139 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:29,140 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:29,140 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687281357]
[2025-05-07 17:29:29,140 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687281357] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:29,140 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:29,140 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:29:29,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935950475]
[2025-05-07 17:29:29,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:29,140 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:29:29,140 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:29,141 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:29:29,141 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:29:29,141 INFO  L87              Difference]: Start difference. First operand 253 states and 289 transitions. Second operand  has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (26), 1 states have call predecessors, (26), 7 states have return successors, (26), 8 states have call predecessors, (26), 3 states have call successors, (26)
[2025-05-07 17:29:29,201 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:29,201 INFO  L93              Difference]: Finished difference Result 261 states and 298 transitions.
[2025-05-07 17:29:29,201 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:29:29,202 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (26), 1 states have call predecessors, (26), 7 states have return successors, (26), 8 states have call predecessors, (26), 3 states have call successors, (26) Word has length 92
[2025-05-07 17:29:29,202 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:29,203 INFO  L225             Difference]: With dead ends: 261
[2025-05-07 17:29:29,203 INFO  L226             Difference]: Without dead ends: 261
[2025-05-07 17:29:29,203 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:29:29,203 INFO  L437           NwaCegarLoop]: 290 mSDtfsCounter, 1 mSDsluCounter, 1714 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:29,203 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2004 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:29,204 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 261 states.
[2025-05-07 17:29:29,217 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261.
[2025-05-07 17:29:29,218 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 261 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 113 states have internal predecessors, (113), 86 states have call successors, (90), 66 states have call predecessors, (90), 70 states have return successors, (95), 81 states have call predecessors, (95), 86 states have call successors, (95)
[2025-05-07 17:29:29,220 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 298 transitions.
[2025-05-07 17:29:29,220 INFO  L79                 Accepts]: Start accepts. Automaton has 261 states and 298 transitions. Word has length 92
[2025-05-07 17:29:29,220 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:29,221 INFO  L485      AbstractCegarLoop]: Abstraction has 261 states and 298 transitions.
[2025-05-07 17:29:29,221 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (26), 1 states have call predecessors, (26), 7 states have return successors, (26), 8 states have call predecessors, (26), 3 states have call successors, (26)
[2025-05-07 17:29:29,221 INFO  L278                IsEmpty]: Start isEmpty. Operand 261 states and 298 transitions.
[2025-05-07 17:29:29,222 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-05-07 17:29:29,222 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:29,222 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:29,223 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:29:29,223 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:29,223 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:29,223 INFO  L85        PathProgramCache]: Analyzing trace with hash -524179574, now seen corresponding path program 1 times
[2025-05-07 17:29:29,223 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:29,224 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396975757]
[2025-05-07 17:29:29,224 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:29,224 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:29,257 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-05-07 17:29:29,267 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-05-07 17:29:29,267 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:29,267 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:29,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:29,395 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:29,395 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396975757]
[2025-05-07 17:29:29,395 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396975757] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:29,395 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:29,395 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:29:29,395 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863837114]
[2025-05-07 17:29:29,395 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:29,396 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:29,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:29,396 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:29,396 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:29,397 INFO  L87              Difference]: Start difference. First operand 261 states and 298 transitions. Second operand  has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (26), 1 states have call predecessors, (26), 5 states have return successors, (26), 6 states have call predecessors, (26), 3 states have call successors, (26)
[2025-05-07 17:29:29,439 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:29,439 INFO  L93              Difference]: Finished difference Result 267 states and 304 transitions.
[2025-05-07 17:29:29,439 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:29,439 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (26), 1 states have call predecessors, (26), 5 states have return successors, (26), 6 states have call predecessors, (26), 3 states have call successors, (26) Word has length 92
[2025-05-07 17:29:29,439 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:29,440 INFO  L225             Difference]: With dead ends: 267
[2025-05-07 17:29:29,441 INFO  L226             Difference]: Without dead ends: 267
[2025-05-07 17:29:29,441 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:29,441 INFO  L437           NwaCegarLoop]: 286 mSDtfsCounter, 1 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1419 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:29:29,441 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1419 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:29,442 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 267 states.
[2025-05-07 17:29:29,448 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265.
[2025-05-07 17:29:29,448 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 265 states, 110 states have (on average 1.0454545454545454) internal successors, (115), 115 states have internal predecessors, (115), 86 states have call successors, (90), 66 states have call predecessors, (90), 72 states have return successors, (97), 83 states have call predecessors, (97), 86 states have call successors, (97)
[2025-05-07 17:29:29,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 302 transitions.
[2025-05-07 17:29:29,450 INFO  L79                 Accepts]: Start accepts. Automaton has 265 states and 302 transitions. Word has length 92
[2025-05-07 17:29:29,450 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:29,450 INFO  L485      AbstractCegarLoop]: Abstraction has 265 states and 302 transitions.
[2025-05-07 17:29:29,450 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (26), 1 states have call predecessors, (26), 5 states have return successors, (26), 6 states have call predecessors, (26), 3 states have call successors, (26)
[2025-05-07 17:29:29,451 INFO  L278                IsEmpty]: Start isEmpty. Operand 265 states and 302 transitions.
[2025-05-07 17:29:29,452 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2025-05-07 17:29:29,452 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:29,452 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:29,452 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:29:29,452 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:29,452 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:29,453 INFO  L85        PathProgramCache]: Analyzing trace with hash -1536490980, now seen corresponding path program 1 times
[2025-05-07 17:29:29,453 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:29,453 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54777217]
[2025-05-07 17:29:29,453 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:29,453 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:29,488 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes.
[2025-05-07 17:29:29,498 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements.
[2025-05-07 17:29:29,498 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:29,498 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:29,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:29,566 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:29,566 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54777217]
[2025-05-07 17:29:29,566 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54777217] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:29,566 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:29,566 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:29:29,566 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517611816]
[2025-05-07 17:29:29,566 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:29,567 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:29,567 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:29,567 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:29,567 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:29,568 INFO  L87              Difference]: Start difference. First operand 265 states and 302 transitions. Second operand  has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 3 states have call successors, (27)
[2025-05-07 17:29:29,600 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:29,600 INFO  L93              Difference]: Finished difference Result 269 states and 306 transitions.
[2025-05-07 17:29:29,600 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:29,600 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 3 states have call successors, (27) Word has length 95
[2025-05-07 17:29:29,600 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:29,601 INFO  L225             Difference]: With dead ends: 269
[2025-05-07 17:29:29,601 INFO  L226             Difference]: Without dead ends: 269
[2025-05-07 17:29:29,601 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:29,602 INFO  L437           NwaCegarLoop]: 290 mSDtfsCounter, 1 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:29,602 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1429 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:29,602 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 269 states.
[2025-05-07 17:29:29,607 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 265.
[2025-05-07 17:29:29,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 265 states, 110 states have (on average 1.0454545454545454) internal successors, (115), 115 states have internal predecessors, (115), 86 states have call successors, (90), 66 states have call predecessors, (90), 72 states have return successors, (97), 83 states have call predecessors, (97), 86 states have call successors, (97)
[2025-05-07 17:29:29,608 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 302 transitions.
[2025-05-07 17:29:29,608 INFO  L79                 Accepts]: Start accepts. Automaton has 265 states and 302 transitions. Word has length 95
[2025-05-07 17:29:29,609 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:29,609 INFO  L485      AbstractCegarLoop]: Abstraction has 265 states and 302 transitions.
[2025-05-07 17:29:29,609 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 3 states have call successors, (27)
[2025-05-07 17:29:29,609 INFO  L278                IsEmpty]: Start isEmpty. Operand 265 states and 302 transitions.
[2025-05-07 17:29:29,610 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-05-07 17:29:29,610 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:29,610 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:29,610 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:29:29,610 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:29,610 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:29,610 INFO  L85        PathProgramCache]: Analyzing trace with hash 1547399168, now seen corresponding path program 1 times
[2025-05-07 17:29:29,611 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:29,611 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747291577]
[2025-05-07 17:29:29,611 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:29,611 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:29,639 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-05-07 17:29:29,647 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-05-07 17:29:29,648 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:29,648 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:29,773 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:29,773 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:29,774 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747291577]
[2025-05-07 17:29:29,774 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747291577] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:29,774 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:29,774 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:29:29,774 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052998075]
[2025-05-07 17:29:29,774 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:29,774 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:29,774 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:29,775 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:29,775 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:29,775 INFO  L87              Difference]: Start difference. First operand 265 states and 302 transitions. Second operand  has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (26), 1 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26)
[2025-05-07 17:29:29,812 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:29,812 INFO  L93              Difference]: Finished difference Result 254 states and 287 transitions.
[2025-05-07 17:29:29,812 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:29,812 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (26), 1 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 92
[2025-05-07 17:29:29,812 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:29,813 INFO  L225             Difference]: With dead ends: 254
[2025-05-07 17:29:29,813 INFO  L226             Difference]: Without dead ends: 152
[2025-05-07 17:29:29,813 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:29,814 INFO  L437           NwaCegarLoop]: 279 mSDtfsCounter, 0 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:29,814 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1383 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:29,814 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 152 states.
[2025-05-07 17:29:29,816 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152.
[2025-05-07 17:29:29,817 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 152 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 65 states have internal predecessors, (65), 53 states have call successors, (55), 39 states have call predecessors, (55), 39 states have return successors, (55), 47 states have call predecessors, (55), 53 states have call successors, (55)
[2025-05-07 17:29:29,817 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions.
[2025-05-07 17:29:29,817 INFO  L79                 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 92
[2025-05-07 17:29:29,817 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:29,817 INFO  L485      AbstractCegarLoop]: Abstraction has 152 states and 175 transitions.
[2025-05-07 17:29:29,817 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 8.0) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (26), 1 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26)
[2025-05-07 17:29:29,818 INFO  L278                IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions.
[2025-05-07 17:29:29,818 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 114
[2025-05-07 17:29:29,818 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:29,818 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:29,818 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-05-07 17:29:29,819 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:29,819 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:29,819 INFO  L85        PathProgramCache]: Analyzing trace with hash 1561970507, now seen corresponding path program 1 times
[2025-05-07 17:29:29,819 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:29,819 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17270959]
[2025-05-07 17:29:29,819 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:29,819 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:29,847 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes.
[2025-05-07 17:29:29,858 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements.
[2025-05-07 17:29:29,858 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:29,858 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:29,950 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:29,950 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:29,951 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17270959]
[2025-05-07 17:29:29,951 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17270959] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:29,951 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:29,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:29:29,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996551592]
[2025-05-07 17:29:29,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:29,951 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:29:29,951 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:29,952 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:29:29,952 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:29,952 INFO  L87              Difference]: Start difference. First operand 152 states and 175 transitions. Second operand  has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (32), 1 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 4 states have call successors, (32)
[2025-05-07 17:29:30,000 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:30,000 INFO  L93              Difference]: Finished difference Result 152 states and 174 transitions.
[2025-05-07 17:29:30,000 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:29:30,000 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (32), 1 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 4 states have call successors, (32) Word has length 113
[2025-05-07 17:29:30,000 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:30,001 INFO  L225             Difference]: With dead ends: 152
[2025-05-07 17:29:30,001 INFO  L226             Difference]: Without dead ends: 150
[2025-05-07 17:29:30,001 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:29:30,001 INFO  L437           NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:30,002 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 992 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:30,002 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2025-05-07 17:29:30,005 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150.
[2025-05-07 17:29:30,005 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 150 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 64 states have internal predecessors, (64), 51 states have call successors, (53), 39 states have call predecessors, (53), 39 states have return successors, (53), 46 states have call predecessors, (53), 51 states have call successors, (53)
[2025-05-07 17:29:30,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions.
[2025-05-07 17:29:30,006 INFO  L79                 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 113
[2025-05-07 17:29:30,006 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:30,006 INFO  L485      AbstractCegarLoop]: Abstraction has 150 states and 170 transitions.
[2025-05-07 17:29:30,006 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 4 states have call successors, (32), 1 states have call predecessors, (32), 6 states have return successors, (32), 7 states have call predecessors, (32), 4 states have call successors, (32)
[2025-05-07 17:29:30,006 INFO  L278                IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions.
[2025-05-07 17:29:30,007 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2025-05-07 17:29:30,007 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:30,007 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:30,007 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-05-07 17:29:30,007 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:30,007 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:30,007 INFO  L85        PathProgramCache]: Analyzing trace with hash 532134771, now seen corresponding path program 1 times
[2025-05-07 17:29:30,007 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:30,008 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838369546]
[2025-05-07 17:29:30,008 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:30,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:30,045 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes.
[2025-05-07 17:29:30,060 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements.
[2025-05-07 17:29:30,060 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:30,060 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:30,178 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:30,178 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:30,178 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838369546]
[2025-05-07 17:29:30,179 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838369546] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:30,179 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:30,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:29:30,179 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452457076]
[2025-05-07 17:29:30,179 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:30,179 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:30,179 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:30,180 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:30,180 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:30,180 INFO  L87              Difference]: Start difference. First operand 150 states and 170 transitions. Second operand  has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (33), 1 states have call predecessors, (33), 5 states have return successors, (33), 5 states have call predecessors, (33), 4 states have call successors, (33)
[2025-05-07 17:29:30,221 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:30,221 INFO  L93              Difference]: Finished difference Result 156 states and 177 transitions.
[2025-05-07 17:29:30,222 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:30,222 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (33), 1 states have call predecessors, (33), 5 states have return successors, (33), 5 states have call predecessors, (33), 4 states have call successors, (33) Word has length 116
[2025-05-07 17:29:30,222 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:30,223 INFO  L225             Difference]: With dead ends: 156
[2025-05-07 17:29:30,223 INFO  L226             Difference]: Without dead ends: 156
[2025-05-07 17:29:30,223 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:30,223 INFO  L437           NwaCegarLoop]: 166 mSDtfsCounter, 1 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:30,224 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 818 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:30,224 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 156 states.
[2025-05-07 17:29:30,226 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154.
[2025-05-07 17:29:30,227 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 154 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 66 states have internal predecessors, (66), 51 states have call successors, (53), 39 states have call predecessors, (53), 41 states have return successors, (55), 48 states have call predecessors, (55), 51 states have call successors, (55)
[2025-05-07 17:29:30,227 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 174 transitions.
[2025-05-07 17:29:30,227 INFO  L79                 Accepts]: Start accepts. Automaton has 154 states and 174 transitions. Word has length 116
[2025-05-07 17:29:30,228 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:30,228 INFO  L485      AbstractCegarLoop]: Abstraction has 154 states and 174 transitions.
[2025-05-07 17:29:30,228 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (33), 1 states have call predecessors, (33), 5 states have return successors, (33), 5 states have call predecessors, (33), 4 states have call successors, (33)
[2025-05-07 17:29:30,228 INFO  L278                IsEmpty]: Start isEmpty. Operand 154 states and 174 transitions.
[2025-05-07 17:29:30,229 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:29:30,229 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:30,229 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:30,229 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-05-07 17:29:30,229 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:30,229 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:30,229 INFO  L85        PathProgramCache]: Analyzing trace with hash 1834891466, now seen corresponding path program 1 times
[2025-05-07 17:29:30,229 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:30,229 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289509849]
[2025-05-07 17:29:30,229 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:30,230 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:30,254 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:29:30,258 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:29:30,259 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:30,259 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:30,373 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:30,373 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:30,373 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289509849]
[2025-05-07 17:29:30,374 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289509849] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:30,374 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:30,374 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:29:30,374 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120516712]
[2025-05-07 17:29:30,374 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:30,374 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:30,374 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:30,374 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:30,374 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:30,375 INFO  L87              Difference]: Start difference. First operand 154 states and 174 transitions. Second operand  has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (29), 1 states have call predecessors, (29), 5 states have return successors, (29), 6 states have call predecessors, (29), 4 states have call successors, (29)
[2025-05-07 17:29:30,415 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:30,415 INFO  L93              Difference]: Finished difference Result 152 states and 171 transitions.
[2025-05-07 17:29:30,415 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:30,416 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (29), 1 states have call predecessors, (29), 5 states have return successors, (29), 6 states have call predecessors, (29), 4 states have call successors, (29) Word has length 102
[2025-05-07 17:29:30,416 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:30,416 INFO  L225             Difference]: With dead ends: 152
[2025-05-07 17:29:30,417 INFO  L226             Difference]: Without dead ends: 149
[2025-05-07 17:29:30,417 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:30,417 INFO  L437           NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:30,417 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 802 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:30,418 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 149 states.
[2025-05-07 17:29:30,422 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149.
[2025-05-07 17:29:30,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 149 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 64 states have internal predecessors, (64), 49 states have call successors, (50), 38 states have call predecessors, (50), 40 states have return successors, (52), 46 states have call predecessors, (52), 49 states have call successors, (52)
[2025-05-07 17:29:30,423 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 166 transitions.
[2025-05-07 17:29:30,424 INFO  L79                 Accepts]: Start accepts. Automaton has 149 states and 166 transitions. Word has length 102
[2025-05-07 17:29:30,424 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:30,424 INFO  L485      AbstractCegarLoop]: Abstraction has 149 states and 166 transitions.
[2025-05-07 17:29:30,424 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (29), 1 states have call predecessors, (29), 5 states have return successors, (29), 6 states have call predecessors, (29), 4 states have call successors, (29)
[2025-05-07 17:29:30,424 INFO  L278                IsEmpty]: Start isEmpty. Operand 149 states and 166 transitions.
[2025-05-07 17:29:30,425 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2025-05-07 17:29:30,425 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:30,425 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:30,426 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-05-07 17:29:30,426 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:30,426 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:30,426 INFO  L85        PathProgramCache]: Analyzing trace with hash -1835547362, now seen corresponding path program 1 times
[2025-05-07 17:29:30,426 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:30,426 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625590155]
[2025-05-07 17:29:30,426 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:30,426 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:30,464 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes.
[2025-05-07 17:29:30,475 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements.
[2025-05-07 17:29:30,475 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:30,475 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:30,552 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:30,552 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:30,552 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625590155]
[2025-05-07 17:29:30,552 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625590155] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:30,552 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:30,552 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:29:30,552 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905414321]
[2025-05-07 17:29:30,552 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:30,552 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:30,553 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:30,553 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:30,553 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:30,553 INFO  L87              Difference]: Start difference. First operand 149 states and 166 transitions. Second operand  has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (34), 1 states have call predecessors, (34), 5 states have return successors, (34), 6 states have call predecessors, (34), 4 states have call successors, (34)
[2025-05-07 17:29:30,593 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:30,593 INFO  L93              Difference]: Finished difference Result 155 states and 173 transitions.
[2025-05-07 17:29:30,593 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:30,593 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (34), 1 states have call predecessors, (34), 5 states have return successors, (34), 6 states have call predecessors, (34), 4 states have call successors, (34) Word has length 119
[2025-05-07 17:29:30,594 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:30,595 INFO  L225             Difference]: With dead ends: 155
[2025-05-07 17:29:30,595 INFO  L226             Difference]: Without dead ends: 155
[2025-05-07 17:29:30,595 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:30,595 INFO  L437           NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:30,595 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 781 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:30,596 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 155 states.
[2025-05-07 17:29:30,598 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153.
[2025-05-07 17:29:30,599 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 153 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 66 states have internal predecessors, (66), 49 states have call successors, (50), 38 states have call predecessors, (50), 42 states have return successors, (55), 48 states have call predecessors, (55), 49 states have call successors, (55)
[2025-05-07 17:29:30,599 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 171 transitions.
[2025-05-07 17:29:30,599 INFO  L79                 Accepts]: Start accepts. Automaton has 153 states and 171 transitions. Word has length 119
[2025-05-07 17:29:30,600 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:30,600 INFO  L485      AbstractCegarLoop]: Abstraction has 153 states and 171 transitions.
[2025-05-07 17:29:30,600 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 10.2) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (34), 1 states have call predecessors, (34), 5 states have return successors, (34), 6 states have call predecessors, (34), 4 states have call successors, (34)
[2025-05-07 17:29:30,600 INFO  L278                IsEmpty]: Start isEmpty. Operand 153 states and 171 transitions.
[2025-05-07 17:29:30,601 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2025-05-07 17:29:30,601 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:30,601 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:30,601 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-05-07 17:29:30,601 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:30,601 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:30,601 INFO  L85        PathProgramCache]: Analyzing trace with hash -152695201, now seen corresponding path program 1 times
[2025-05-07 17:29:30,601 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:30,602 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675786395]
[2025-05-07 17:29:30,602 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:30,602 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:30,636 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes.
[2025-05-07 17:29:30,646 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements.
[2025-05-07 17:29:30,646 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:30,646 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:30,771 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:30,771 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:30,771 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675786395]
[2025-05-07 17:29:30,771 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675786395] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:30,771 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:30,771 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-05-07 17:29:30,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379096743]
[2025-05-07 17:29:30,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:30,772 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-05-07 17:29:30,772 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:30,772 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-05-07 17:29:30,773 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:29:30,773 INFO  L87              Difference]: Start difference. First operand 153 states and 171 transitions. Second operand  has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 5 states have call successors, (33), 1 states have call predecessors, (33), 9 states have return successors, (33), 9 states have call predecessors, (33), 5 states have call successors, (33)
[2025-05-07 17:29:30,865 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:30,865 INFO  L93              Difference]: Finished difference Result 157 states and 175 transitions.
[2025-05-07 17:29:30,866 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-05-07 17:29:30,866 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 5 states have call successors, (33), 1 states have call predecessors, (33), 9 states have return successors, (33), 9 states have call predecessors, (33), 5 states have call successors, (33) Word has length 116
[2025-05-07 17:29:30,866 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:30,867 INFO  L225             Difference]: With dead ends: 157
[2025-05-07 17:29:30,867 INFO  L226             Difference]: Without dead ends: 157
[2025-05-07 17:29:30,867 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:29:30,867 INFO  L437           NwaCegarLoop]: 165 mSDtfsCounter, 1 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:30,868 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1454 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:29:30,868 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 157 states.
[2025-05-07 17:29:30,871 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157.
[2025-05-07 17:29:30,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 157 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 68 states have internal predecessors, (68), 49 states have call successors, (50), 38 states have call predecessors, (50), 44 states have return successors, (57), 50 states have call predecessors, (57), 49 states have call successors, (57)
[2025-05-07 17:29:30,872 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 175 transitions.
[2025-05-07 17:29:30,872 INFO  L79                 Accepts]: Start accepts. Automaton has 157 states and 175 transitions. Word has length 116
[2025-05-07 17:29:30,872 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:30,872 INFO  L485      AbstractCegarLoop]: Abstraction has 157 states and 175 transitions.
[2025-05-07 17:29:30,872 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 5 states have call successors, (33), 1 states have call predecessors, (33), 9 states have return successors, (33), 9 states have call predecessors, (33), 5 states have call successors, (33)
[2025-05-07 17:29:30,872 INFO  L278                IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions.
[2025-05-07 17:29:30,873 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-05-07 17:29:30,873 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:30,873 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:30,873 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-05-07 17:29:30,873 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:30,874 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:30,874 INFO  L85        PathProgramCache]: Analyzing trace with hash 1624765057, now seen corresponding path program 1 times
[2025-05-07 17:29:30,874 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:30,874 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663698434]
[2025-05-07 17:29:30,874 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:30,874 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:30,905 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-05-07 17:29:30,914 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-05-07 17:29:30,915 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:30,915 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:31,008 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:31,008 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:31,008 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663698434]
[2025-05-07 17:29:31,008 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663698434] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:31,008 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:31,008 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:29:31,008 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938954871]
[2025-05-07 17:29:31,008 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:31,009 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:31,009 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:31,009 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:31,009 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:31,010 INFO  L87              Difference]: Start difference. First operand 157 states and 175 transitions. Second operand  has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 5 states have call successors, (30), 1 states have call predecessors, (30), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30)
[2025-05-07 17:29:31,044 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:31,044 INFO  L93              Difference]: Finished difference Result 160 states and 179 transitions.
[2025-05-07 17:29:31,044 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:31,044 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 5 states have call successors, (30), 1 states have call predecessors, (30), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30) Word has length 105
[2025-05-07 17:29:31,044 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:31,045 INFO  L225             Difference]: With dead ends: 160
[2025-05-07 17:29:31,045 INFO  L226             Difference]: Without dead ends: 160
[2025-05-07 17:29:31,045 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:31,046 INFO  L437           NwaCegarLoop]: 159 mSDtfsCounter, 1 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:31,046 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 779 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:31,046 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 160 states.
[2025-05-07 17:29:31,050 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160.
[2025-05-07 17:29:31,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 160 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 69 states have internal predecessors, (69), 50 states have call successors, (51), 38 states have call predecessors, (51), 45 states have return successors, (59), 52 states have call predecessors, (59), 50 states have call successors, (59)
[2025-05-07 17:29:31,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions.
[2025-05-07 17:29:31,051 INFO  L79                 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 105
[2025-05-07 17:29:31,052 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:31,052 INFO  L485      AbstractCegarLoop]: Abstraction has 160 states and 179 transitions.
[2025-05-07 17:29:31,052 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 5 states have call successors, (30), 1 states have call predecessors, (30), 5 states have return successors, (30), 5 states have call predecessors, (30), 5 states have call successors, (30)
[2025-05-07 17:29:31,052 INFO  L278                IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions.
[2025-05-07 17:29:31,053 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:29:31,053 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:31,053 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:31,053 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-05-07 17:29:31,053 INFO  L403      AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:31,054 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:31,054 INFO  L85        PathProgramCache]: Analyzing trace with hash 715284958, now seen corresponding path program 1 times
[2025-05-07 17:29:31,054 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:31,054 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180644821]
[2025-05-07 17:29:31,054 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:31,054 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:31,083 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:29:31,092 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:29:31,092 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:31,092 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:31,213 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:31,213 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:31,213 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180644821]
[2025-05-07 17:29:31,213 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180644821] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:31,213 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:31,213 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:29:31,213 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645808063]
[2025-05-07 17:29:31,213 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:31,214 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:29:31,214 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:31,214 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:29:31,215 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:29:31,215 INFO  L87              Difference]: Start difference. First operand 160 states and 179 transitions. Second operand  has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 6 states have call successors, (29), 1 states have call predecessors, (29), 7 states have return successors, (29), 7 states have call predecessors, (29), 6 states have call successors, (29)
[2025-05-07 17:29:31,276 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:31,277 INFO  L93              Difference]: Finished difference Result 159 states and 176 transitions.
[2025-05-07 17:29:31,277 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:29:31,277 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 6 states have call successors, (29), 1 states have call predecessors, (29), 7 states have return successors, (29), 7 states have call predecessors, (29), 6 states have call successors, (29) Word has length 102
[2025-05-07 17:29:31,277 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:31,278 INFO  L225             Difference]: With dead ends: 159
[2025-05-07 17:29:31,278 INFO  L226             Difference]: Without dead ends: 158
[2025-05-07 17:29:31,278 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:29:31,279 INFO  L437           NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:31,279 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1110 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:29:31,280 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 158 states.
[2025-05-07 17:29:31,283 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155.
[2025-05-07 17:29:31,283 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 155 states, 65 states have (on average 1.0307692307692307) internal successors, (67), 67 states have internal predecessors, (67), 47 states have call successors, (48), 38 states have call predecessors, (48), 44 states have return successors, (55), 49 states have call predecessors, (55), 47 states have call successors, (55)
[2025-05-07 17:29:31,284 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 170 transitions.
[2025-05-07 17:29:31,284 INFO  L79                 Accepts]: Start accepts. Automaton has 155 states and 170 transitions. Word has length 102
[2025-05-07 17:29:31,285 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:31,285 INFO  L485      AbstractCegarLoop]: Abstraction has 155 states and 170 transitions.
[2025-05-07 17:29:31,285 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 6 states have call successors, (29), 1 states have call predecessors, (29), 7 states have return successors, (29), 7 states have call predecessors, (29), 6 states have call successors, (29)
[2025-05-07 17:29:31,285 INFO  L278                IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions.
[2025-05-07 17:29:31,286 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-05-07 17:29:31,286 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:31,286 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:31,286 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-05-07 17:29:31,286 INFO  L403      AbstractCegarLoop]: === Iteration 20 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:31,286 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:31,286 INFO  L85        PathProgramCache]: Analyzing trace with hash 990165350, now seen corresponding path program 1 times
[2025-05-07 17:29:31,287 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:31,287 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917272733]
[2025-05-07 17:29:31,287 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:31,287 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:31,322 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-05-07 17:29:31,333 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-05-07 17:29:31,333 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:31,333 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:31,411 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:31,411 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:31,411 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917272733]
[2025-05-07 17:29:31,411 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917272733] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:31,411 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:31,411 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:29:31,411 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258506491]
[2025-05-07 17:29:31,411 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:31,412 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:31,412 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:31,412 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:31,412 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:31,412 INFO  L87              Difference]: Start difference. First operand 155 states and 170 transitions. Second operand  has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (35), 1 states have call predecessors, (35), 5 states have return successors, (35), 5 states have call predecessors, (35), 4 states have call successors, (35)
[2025-05-07 17:29:31,430 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:31,430 INFO  L93              Difference]: Finished difference Result 96 states and 103 transitions.
[2025-05-07 17:29:31,430 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:31,430 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (35), 1 states have call predecessors, (35), 5 states have return successors, (35), 5 states have call predecessors, (35), 4 states have call successors, (35) Word has length 122
[2025-05-07 17:29:31,431 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:31,431 INFO  L225             Difference]: With dead ends: 96
[2025-05-07 17:29:31,431 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:29:31,431 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:31,431 INFO  L437           NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:31,432 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 442 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:31,432 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:29:31,432 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:29:31,432 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-05-07 17:29:31,432 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:29:31,432 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122
[2025-05-07 17:29:31,432 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:31,432 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:29:31,433 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 4 states have call successors, (35), 1 states have call predecessors, (35), 5 states have return successors, (35), 5 states have call predecessors, (35), 4 states have call successors, (35)
[2025-05-07 17:29:31,433 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:29:31,433 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:29:31,435 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:29:31,436 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-05-07 17:29:31,438 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:31,440 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:29:31,443 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:29:31 BoogieIcfgContainer
[2025-05-07 17:29:31,443 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:29:31,443 INFO  L158              Benchmark]: Toolchain (without parser) took 5611.61ms. Allocated memory was 234.9MB in the beginning and 436.2MB in the end (delta: 201.3MB). Free memory was 186.9MB in the beginning and 191.3MB in the end (delta: -4.5MB). Peak memory consumption was 206.6MB. Max. memory is 33.6GB.
[2025-05-07 17:29:31,444 INFO  L158              Benchmark]: SmtParser took 0.21ms. Allocated memory is still 234.9MB. Free memory is still 173.3MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:31,444 INFO  L158              Benchmark]: ChcToBoogie took 42.13ms. Allocated memory is still 234.9MB. Free memory was 186.9MB in the beginning and 179.4MB in the end (delta: 7.5MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-05-07 17:29:31,444 INFO  L158              Benchmark]: Boogie Preprocessor took 76.46ms. Allocated memory is still 234.9MB. Free memory was 179.4MB in the beginning and 173.3MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:31,444 INFO  L158              Benchmark]: RCFGBuilder took 829.34ms. Allocated memory was 234.9MB in the beginning and 302.0MB in the end (delta: 67.1MB). Free memory was 173.3MB in the beginning and 207.3MB in the end (delta: -34.0MB). Peak memory consumption was 77.4MB. Max. memory is 33.6GB.
[2025-05-07 17:29:31,444 INFO  L158              Benchmark]: TraceAbstraction took 4660.47ms. Allocated memory was 302.0MB in the beginning and 436.2MB in the end (delta: 134.2MB). Free memory was 207.3MB in the beginning and 191.3MB in the end (delta: 15.9MB). Peak memory consumption was 162.8MB. Max. memory is 33.6GB.
[2025-05-07 17:29:31,446 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.21ms. Allocated memory is still 234.9MB. Free memory is still 173.3MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 42.13ms. Allocated memory is still 234.9MB. Free memory was 186.9MB in the beginning and 179.4MB in the end (delta: 7.5MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * Boogie Preprocessor took 76.46ms. Allocated memory is still 234.9MB. Free memory was 179.4MB in the beginning and 173.3MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 829.34ms. Allocated memory was 234.9MB in the beginning and 302.0MB in the end (delta: 67.1MB). Free memory was 173.3MB in the beginning and 207.3MB in the end (delta: -34.0MB). Peak memory consumption was 77.4MB. Max. memory is 33.6GB.
 * TraceAbstraction took 4660.47ms. Allocated memory was 302.0MB in the beginning and 436.2MB in the end (delta: 134.2MB). Free memory was 207.3MB in the beginning and 191.3MB in the end (delta: 15.9MB). Peak memory consumption was 162.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 86 procedures, 347 locations, 556 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 64 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 27494 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22158 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 588 IncrementalHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 5336 mSDtfsCounter, 588 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=347occurred in iteration=0, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 19 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1850 NumberOfCodeBlocks, 1850 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1830 ConstructedInterpolants, 0 QuantifiedInterpolants, 2248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-05-07 17:29:31,460 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
