./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/control_flow/return_2.sol_2_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:28:32,756 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:28:32,793 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_514096c1-45f0-4f47-af48-ab185734d5dd/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:28:32,796 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:28:32,796 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:28:32,809 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:28:32,809 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:28:32,809 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:28:32,810 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:28:32,810 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:28:32,810 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:28:32,810 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:28:32,810 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:28:32,810 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:28:32,810 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:28:32,810 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:28:32,810 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:28:32,810 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:28:32,810 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:32,810 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:28:32,810 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:28:32,811 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:28:32,811 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:28:32,811 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:28:32,811 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:28:32,811 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:28:32,811 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:28:33,017 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:28:33,025 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:28:33,027 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:28:33,029 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:28:33,029 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:28:33,030 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_514096c1-45f0-4f47-af48-ab185734d5dd/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/control_flow/return_2.sol_2_no_adts_000.smt2
[2025-05-07 17:28:33,031 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:28:33,033 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:28:33,458 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_514096c1-45f0-4f47-af48-ab185734d5dd/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/control_flow/return_2.sol_2_no_adts_000.smt2
[2025-05-07 17:28:33,460 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:28:33,461 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:28:33,461 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:28:33,462 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:28:33,462 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:28:33,463 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:33" (1/1) ...
[2025-05-07 17:28:33,504 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:33 Unit
[2025-05-07 17:28:33,504 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:28:33,505 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:28:33,505 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:28:33,505 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:28:33,517 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:33" (1/1) ...
[2025-05-07 17:28:33,517 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:33" (1/1) ...
[2025-05-07 17:28:33,543 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:33" (1/1) ...
[2025-05-07 17:28:33,543 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:33" (1/1) ...
[2025-05-07 17:28:33,552 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:33" (1/1) ...
[2025-05-07 17:28:33,553 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:33" (1/1) ...
[2025-05-07 17:28:33,554 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:33" (1/1) ...
[2025-05-07 17:28:33,557 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:33" (1/1) ...
[2025-05-07 17:28:33,559 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:33" (1/1) ...
[2025-05-07 17:28:33,575 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:28:33,576 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:28:33,576 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:28:33,576 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:28:33,577 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:33" (1/1) ...
[2025-05-07 17:28:33,579 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:28:33,588 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:33,598 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-05-07 17:28:33,601 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:28:33,612 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:28:33,612 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:28:33,612 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:28:33,612 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_13_0 given in one single declaration
[2025-05-07 17:28:33,612 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_13_0
[2025-05-07 17:28:33,613 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_13_0
[2025-05-07 17:28:33,613 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_5_function_f__117_118_0 given in one single declaration
[2025-05-07 17:28:33,613 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_5_function_f__117_118_0
[2025-05-07 17:28:33,613 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_5_function_f__117_118_0
[2025-05-07 17:28:33,613 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_37_function_f__117_118_0 given in one single declaration
[2025-05-07 17:28:33,613 INFO  L130     BoogieDeclarations]: Found specification of procedure block_37_function_f__117_118_0
[2025-05-07 17:28:33,613 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_37_function_f__117_118_0
[2025-05-07 17:28:33,613 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_4_function_f__117_118_0 given in one single declaration
[2025-05-07 17:28:33,613 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_4_function_f__117_118_0
[2025-05-07 17:28:33,613 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_4_function_f__117_118_0
[2025-05-07 17:28:33,613 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_34_function_add__53_118_0 given in one single declaration
[2025-05-07 17:28:33,614 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_34_function_add__53_118_0
[2025-05-07 17:28:33,614 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_34_function_add__53_118_0
[2025-05-07 17:28:33,614 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_3_function_add__53_118_0 given in one single declaration
[2025-05-07 17:28:33,614 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_3_function_add__53_118_0
[2025-05-07 17:28:33,614 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_3_function_add__53_118_0
[2025-05-07 17:28:33,614 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_8_return_function_add__53_118_0 given in one single declaration
[2025-05-07 17:28:33,614 INFO  L130     BoogieDeclarations]: Found specification of procedure block_8_return_function_add__53_118_0
[2025-05-07 17:28:33,614 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_8_return_function_add__53_118_0
[2025-05-07 17:28:33,614 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_18_if_true_add_42_118_0 given in one single declaration
[2025-05-07 17:28:33,614 INFO  L130     BoogieDeclarations]: Found specification of procedure block_18_if_true_add_42_118_0
[2025-05-07 17:28:33,614 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_18_if_true_add_42_118_0
[2025-05-07 17:28:33,614 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_17_if_header_add_43_118_0 given in one single declaration
[2025-05-07 17:28:33,614 INFO  L130     BoogieDeclarations]: Found specification of procedure block_17_if_header_add_43_118_0
[2025-05-07 17:28:33,615 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_17_if_header_add_43_118_0
[2025-05-07 17:28:33,615 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_15_add_52_118_0 given in one single declaration
[2025-05-07 17:28:33,615 INFO  L130     BoogieDeclarations]: Found specification of procedure block_15_add_52_118_0
[2025-05-07 17:28:33,615 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_15_add_52_118_0
[2025-05-07 17:28:33,615 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_13_if_header_add_31_118_0 given in one single declaration
[2025-05-07 17:28:33,615 INFO  L130     BoogieDeclarations]: Found specification of procedure block_13_if_header_add_31_118_0
[2025-05-07 17:28:33,615 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_13_if_header_add_31_118_0
[2025-05-07 17:28:33,615 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_11_add_52_118_0 given in one single declaration
[2025-05-07 17:28:33,615 INFO  L130     BoogieDeclarations]: Found specification of procedure block_11_add_52_118_0
[2025-05-07 17:28:33,615 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_11_add_52_118_0
[2025-05-07 17:28:33,615 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_9_if_header_add_20_118_0 given in one single declaration
[2025-05-07 17:28:33,615 INFO  L130     BoogieDeclarations]: Found specification of procedure block_9_if_header_add_20_118_0
[2025-05-07 17:28:33,615 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_9_if_header_add_20_118_0
[2025-05-07 17:28:33,615 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_7_add_52_118_0 given in one single declaration
[2025-05-07 17:28:33,616 INFO  L130     BoogieDeclarations]: Found specification of procedure block_7_add_52_118_0
[2025-05-07 17:28:33,616 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_7_add_52_118_0
[2025-05-07 17:28:33,616 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_6_function_add__53_118_0 given in one single declaration
[2025-05-07 17:28:33,616 INFO  L130     BoogieDeclarations]: Found specification of procedure block_6_function_add__53_118_0
[2025-05-07 17:28:33,616 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_6_function_add__53_118_0
[2025-05-07 17:28:33,616 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_10_if_true_add_19_118_0 given in one single declaration
[2025-05-07 17:28:33,616 INFO  L130     BoogieDeclarations]: Found specification of procedure block_10_if_true_add_19_118_0
[2025-05-07 17:28:33,616 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_10_if_true_add_19_118_0
[2025-05-07 17:28:33,616 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_19_add_52_118_0 given in one single declaration
[2025-05-07 17:28:33,616 INFO  L130     BoogieDeclarations]: Found specification of procedure block_19_add_52_118_0
[2025-05-07 17:28:33,616 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_19_add_52_118_0
[2025-05-07 17:28:33,616 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_14_if_true_add_30_118_0 given in one single declaration
[2025-05-07 17:28:33,616 INFO  L130     BoogieDeclarations]: Found specification of procedure block_14_if_true_add_30_118_0
[2025-05-07 17:28:33,616 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_14_if_true_add_30_118_0
[2025-05-07 17:28:33,616 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_27_function_f__117_118_0 given in one single declaration
[2025-05-07 17:28:33,616 INFO  L130     BoogieDeclarations]: Found specification of procedure block_27_function_f__117_118_0
[2025-05-07 17:28:33,617 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_27_function_f__117_118_0
[2025-05-07 17:28:33,617 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_24_return_function_f__117_118_0 given in one single declaration
[2025-05-07 17:28:33,617 INFO  L130     BoogieDeclarations]: Found specification of procedure block_24_return_function_f__117_118_0
[2025-05-07 17:28:33,617 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_24_return_function_f__117_118_0
[2025-05-07 17:28:33,617 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_29_function_f__117_118_0 given in one single declaration
[2025-05-07 17:28:33,617 INFO  L130     BoogieDeclarations]: Found specification of procedure block_29_function_f__117_118_0
[2025-05-07 17:28:33,617 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_29_function_f__117_118_0
[2025-05-07 17:28:33,617 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_30_function_f__117_118_0 given in one single declaration
[2025-05-07 17:28:33,617 INFO  L130     BoogieDeclarations]: Found specification of procedure block_30_function_f__117_118_0
[2025-05-07 17:28:33,617 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_30_function_f__117_118_0
[2025-05-07 17:28:33,617 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_26_function_f__117_118_0 given in one single declaration
[2025-05-07 17:28:33,617 INFO  L130     BoogieDeclarations]: Found specification of procedure block_26_function_f__117_118_0
[2025-05-07 17:28:33,617 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_26_function_f__117_118_0
[2025-05-07 17:28:33,617 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_36_function_f__117_118_0 given in one single declaration
[2025-05-07 17:28:33,618 INFO  L130     BoogieDeclarations]: Found specification of procedure block_36_function_f__117_118_0
[2025-05-07 17:28:33,618 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_36_function_f__117_118_0
[2025-05-07 17:28:33,618 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_32_function_f__117_118_0 given in one single declaration
[2025-05-07 17:28:33,618 INFO  L130     BoogieDeclarations]: Found specification of procedure block_32_function_f__117_118_0
[2025-05-07 17:28:33,618 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_32_function_f__117_118_0
[2025-05-07 17:28:33,618 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_35_function_f__117_118_0 given in one single declaration
[2025-05-07 17:28:33,618 INFO  L130     BoogieDeclarations]: Found specification of procedure block_35_function_f__117_118_0
[2025-05-07 17:28:33,618 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_35_function_f__117_118_0
[2025-05-07 17:28:33,618 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_33_function_f__117_118_0 given in one single declaration
[2025-05-07 17:28:33,618 INFO  L130     BoogieDeclarations]: Found specification of procedure block_33_function_f__117_118_0
[2025-05-07 17:28:33,618 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_33_function_f__117_118_0
[2025-05-07 17:28:33,618 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_28_function_add__53_118_0 given in one single declaration
[2025-05-07 17:28:33,618 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_28_function_add__53_118_0
[2025-05-07 17:28:33,618 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_28_function_add__53_118_0
[2025-05-07 17:28:33,618 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_23_f_116_118_0 given in one single declaration
[2025-05-07 17:28:33,618 INFO  L130     BoogieDeclarations]: Found specification of procedure block_23_f_116_118_0
[2025-05-07 17:28:33,619 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_23_f_116_118_0
[2025-05-07 17:28:33,619 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_22_function_f__117_118_0 given in one single declaration
[2025-05-07 17:28:33,619 INFO  L130     BoogieDeclarations]: Found specification of procedure block_22_function_f__117_118_0
[2025-05-07 17:28:33,619 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_22_function_f__117_118_0
[2025-05-07 17:28:33,619 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_31_function_add__53_118_0 given in one single declaration
[2025-05-07 17:28:33,619 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_31_function_add__53_118_0
[2025-05-07 17:28:33,619 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_31_function_add__53_118_0
[2025-05-07 17:28:33,619 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_25_function_add__53_118_0 given in one single declaration
[2025-05-07 17:28:33,619 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_25_function_add__53_118_0
[2025-05-07 17:28:33,619 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_25_function_add__53_118_0
[2025-05-07 17:28:33,619 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_0_C_118_0 given in one single declaration
[2025-05-07 17:28:33,619 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_0_C_118_0
[2025-05-07 17:28:33,619 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_0_C_118_0
[2025-05-07 17:28:33,619 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_2_C_118_0 given in one single declaration
[2025-05-07 17:28:33,619 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_2_C_118_0
[2025-05-07 17:28:33,619 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_2_C_118_0
[2025-05-07 17:28:33,620 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_38_C_118_0 given in one single declaration
[2025-05-07 17:28:33,620 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_38_C_118_0
[2025-05-07 17:28:33,620 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_38_C_118_0
[2025-05-07 17:28:33,620 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_40_C_118_0 given in one single declaration
[2025-05-07 17:28:33,620 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_40_C_118_0
[2025-05-07 17:28:33,620 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_40_C_118_0
[2025-05-07 17:28:33,620 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_39_C_118_0 given in one single declaration
[2025-05-07 17:28:33,620 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_39_C_118_0
[2025-05-07 17:28:33,620 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_39_C_118_0
[2025-05-07 17:28:33,620 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_41_C_118_0 given in one single declaration
[2025-05-07 17:28:33,620 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_41_C_118_0
[2025-05-07 17:28:33,620 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_41_C_118_0
[2025-05-07 17:28:33,620 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:28:33,620 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:28:33,620 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:28:33,848 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:28:33,850 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:28:34,236 INFO  L?                        ?]: Removed 391 outVars from TransFormulas that were not future-live.
[2025-05-07 17:28:34,236 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:28:34,245 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:28:34,245 INFO  L312             CfgBuilder]: Removed 20 assume(true) statements.
[2025-05-07 17:28:34,246 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:34 BoogieIcfgContainer
[2025-05-07 17:28:34,246 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:28:34,247 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:28:34,247 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:28:34,250 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:28:34,250 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:28:33" (1/3) ...
[2025-05-07 17:28:34,251 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37052eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:28:34, skipping insertion in model container
[2025-05-07 17:28:34,251 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:28:33" (2/3) ...
[2025-05-07 17:28:34,251 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37052eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:28:34, skipping insertion in model container
[2025-05-07 17:28:34,251 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:28:34" (3/3) ...
[2025-05-07 17:28:34,252 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:28:34,262 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:28:34,264 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 40 procedures, 192 locations, 351 edges, 40 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:28:34,295 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:28:34,304 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;@9cedc7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:28:34,304 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:28:34,307 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 192 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 78 states have internal predecessors, (78), 83 states have call successors, (91), 39 states have call predecessors, (91), 39 states have return successors, (91), 74 states have call predecessors, (91), 83 states have call successors, (91)
[2025-05-07 17:28:34,317 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-05-07 17:28:34,317 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:34,318 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:34,318 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:34,322 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:34,322 INFO  L85        PathProgramCache]: Analyzing trace with hash 1034678699, now seen corresponding path program 1 times
[2025-05-07 17:28:34,328 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:34,328 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369814924]
[2025-05-07 17:28:34,328 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:34,329 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:34,376 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-05-07 17:28:34,453 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-05-07 17:28:34,453 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:34,453 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:34,894 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:34,894 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:34,894 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369814924]
[2025-05-07 17:28:34,895 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369814924] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:34,895 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:34,897 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:28:34,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010374973]
[2025-05-07 17:28:34,898 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:34,909 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:28:34,910 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:34,930 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:28:34,930 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:28:34,932 INFO  L87              Difference]: Start difference. First operand  has 192 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 78 states have internal predecessors, (78), 83 states have call successors, (91), 39 states have call predecessors, (91), 39 states have return successors, (91), 74 states have call predecessors, (91), 83 states have call successors, (91) Second operand  has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (21), 8 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:28:35,187 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:35,188 INFO  L93              Difference]: Finished difference Result 196 states and 278 transitions.
[2025-05-07 17:28:35,189 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:28:35,190 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (21), 8 states have call predecessors, (21), 4 states have call successors, (21) Word has length 76
[2025-05-07 17:28:35,190 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:35,197 INFO  L225             Difference]: With dead ends: 196
[2025-05-07 17:28:35,197 INFO  L226             Difference]: Without dead ends: 196
[2025-05-07 17:28:35,198 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:28:35,200 INFO  L437           NwaCegarLoop]: 239 mSDtfsCounter, 1 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:35,201 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1644 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:35,210 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2025-05-07 17:28:35,233 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196.
[2025-05-07 17:28:35,234 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 196 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 79 states have internal predecessors, (79), 83 states have call successors, (91), 39 states have call predecessors, (91), 42 states have return successors, (108), 77 states have call predecessors, (108), 83 states have call successors, (108)
[2025-05-07 17:28:35,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 278 transitions.
[2025-05-07 17:28:35,239 INFO  L79                 Accepts]: Start accepts. Automaton has 196 states and 278 transitions. Word has length 76
[2025-05-07 17:28:35,240 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:35,241 INFO  L485      AbstractCegarLoop]: Abstraction has 196 states and 278 transitions.
[2025-05-07 17:28:35,241 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (21), 8 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:28:35,241 INFO  L278                IsEmpty]: Start isEmpty. Operand 196 states and 278 transitions.
[2025-05-07 17:28:35,243 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2025-05-07 17:28:35,243 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:35,244 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]
[2025-05-07 17:28:35,244 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:28:35,244 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:35,244 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:35,245 INFO  L85        PathProgramCache]: Analyzing trace with hash -2107072233, now seen corresponding path program 1 times
[2025-05-07 17:28:35,245 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:35,245 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120518346]
[2025-05-07 17:28:35,245 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:35,245 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:35,269 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes.
[2025-05-07 17:28:35,285 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements.
[2025-05-07 17:28:35,285 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:35,285 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:35,430 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:35,430 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:35,430 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120518346]
[2025-05-07 17:28:35,430 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120518346] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:35,430 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:35,430 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-05-07 17:28:35,430 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464903202]
[2025-05-07 17:28:35,430 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:35,431 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-05-07 17:28:35,431 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:35,432 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-05-07 17:28:35,432 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-05-07 17:28:35,432 INFO  L87              Difference]: Start difference. First operand 196 states and 278 transitions. Second operand  has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (20), 8 states have call predecessors, (20), 4 states have call successors, (20)
[2025-05-07 17:28:35,665 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:35,666 INFO  L93              Difference]: Finished difference Result 198 states and 279 transitions.
[2025-05-07 17:28:35,666 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-05-07 17:28:35,666 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (20), 8 states have call predecessors, (20), 4 states have call successors, (20) Word has length 73
[2025-05-07 17:28:35,667 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:35,668 INFO  L225             Difference]: With dead ends: 198
[2025-05-07 17:28:35,669 INFO  L226             Difference]: Without dead ends: 198
[2025-05-07 17:28:35,669 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-05-07 17:28:35,669 INFO  L437           NwaCegarLoop]: 241 mSDtfsCounter, 1 mSDsluCounter, 1645 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:35,670 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1886 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:35,670 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2025-05-07 17:28:35,681 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196.
[2025-05-07 17:28:35,682 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 196 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 79 states have internal predecessors, (79), 83 states have call successors, (91), 39 states have call predecessors, (91), 42 states have return successors, (107), 77 states have call predecessors, (107), 83 states have call successors, (107)
[2025-05-07 17:28:35,683 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 277 transitions.
[2025-05-07 17:28:35,684 INFO  L79                 Accepts]: Start accepts. Automaton has 196 states and 277 transitions. Word has length 73
[2025-05-07 17:28:35,684 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:35,684 INFO  L485      AbstractCegarLoop]: Abstraction has 196 states and 277 transitions.
[2025-05-07 17:28:35,684 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (20), 8 states have call predecessors, (20), 4 states have call successors, (20)
[2025-05-07 17:28:35,684 INFO  L278                IsEmpty]: Start isEmpty. Operand 196 states and 277 transitions.
[2025-05-07 17:28:35,686 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-05-07 17:28:35,686 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:35,686 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:35,686 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:28:35,686 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:35,687 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:35,687 INFO  L85        PathProgramCache]: Analyzing trace with hash 1581697007, now seen corresponding path program 1 times
[2025-05-07 17:28:35,687 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:35,687 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883140898]
[2025-05-07 17:28:35,687 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:35,687 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:35,729 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-05-07 17:28:35,742 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-05-07 17:28:35,742 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:35,742 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:35,831 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:35,832 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:35,832 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883140898]
[2025-05-07 17:28:35,832 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883140898] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:35,832 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:35,832 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:35,832 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431497473]
[2025-05-07 17:28:35,832 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:35,833 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:35,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:35,833 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:35,833 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:35,834 INFO  L87              Difference]: Start difference. First operand 196 states and 277 transitions. Second operand  has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:28:35,881 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:35,881 INFO  L93              Difference]: Finished difference Result 201 states and 283 transitions.
[2025-05-07 17:28:35,882 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:35,882 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21) Word has length 76
[2025-05-07 17:28:35,883 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:35,884 INFO  L225             Difference]: With dead ends: 201
[2025-05-07 17:28:35,884 INFO  L226             Difference]: Without dead ends: 201
[2025-05-07 17:28:35,884 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:35,885 INFO  L437           NwaCegarLoop]: 260 mSDtfsCounter, 1 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:35,885 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1281 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:35,886 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 201 states.
[2025-05-07 17:28:35,895 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201.
[2025-05-07 17:28:35,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 201 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 81 states have internal predecessors, (81), 84 states have call successors, (92), 39 states have call predecessors, (92), 44 states have return successors, (110), 80 states have call predecessors, (110), 84 states have call successors, (110)
[2025-05-07 17:28:35,896 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 283 transitions.
[2025-05-07 17:28:35,896 INFO  L79                 Accepts]: Start accepts. Automaton has 201 states and 283 transitions. Word has length 76
[2025-05-07 17:28:35,897 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:35,897 INFO  L485      AbstractCegarLoop]: Abstraction has 201 states and 283 transitions.
[2025-05-07 17:28:35,897 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 5 states have return successors, (21), 6 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:28:35,897 INFO  L278                IsEmpty]: Start isEmpty. Operand 201 states and 283 transitions.
[2025-05-07 17:28:35,898 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2025-05-07 17:28:35,898 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:35,899 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:35,899 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:28:35,899 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:35,899 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:35,899 INFO  L85        PathProgramCache]: Analyzing trace with hash 1377007033, now seen corresponding path program 1 times
[2025-05-07 17:28:35,899 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:35,899 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853795259]
[2025-05-07 17:28:35,899 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:35,900 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:35,927 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes.
[2025-05-07 17:28:35,941 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements.
[2025-05-07 17:28:35,941 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:35,941 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:36,233 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:36,233 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:36,233 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853795259]
[2025-05-07 17:28:36,233 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853795259] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:36,233 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:36,233 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-05-07 17:28:36,234 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259944879]
[2025-05-07 17:28:36,234 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:36,234 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-05-07 17:28:36,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:36,235 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-05-07 17:28:36,235 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132
[2025-05-07 17:28:36,235 INFO  L87              Difference]: Start difference. First operand 201 states and 283 transitions. Second operand  has 12 states, 10 states have (on average 3.8) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (23), 11 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:28:36,529 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:36,530 INFO  L93              Difference]: Finished difference Result 207 states and 303 transitions.
[2025-05-07 17:28:36,530 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-05-07 17:28:36,530 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 10 states have (on average 3.8) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (23), 11 states have call predecessors, (23), 5 states have call successors, (23) Word has length 84
[2025-05-07 17:28:36,531 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:36,532 INFO  L225             Difference]: With dead ends: 207
[2025-05-07 17:28:36,533 INFO  L226             Difference]: Without dead ends: 207
[2025-05-07 17:28:36,533 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:28:36,534 INFO  L437           NwaCegarLoop]: 252 mSDtfsCounter, 2 mSDsluCounter, 2477 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2729 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:36,534 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2729 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:28:36,535 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 207 states.
[2025-05-07 17:28:36,548 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207.
[2025-05-07 17:28:36,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 207 states, 76 states have (on average 1.105263157894737) internal successors, (84), 84 states have internal predecessors, (84), 84 states have call successors, (92), 39 states have call predecessors, (92), 47 states have return successors, (127), 83 states have call predecessors, (127), 84 states have call successors, (127)
[2025-05-07 17:28:36,551 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 303 transitions.
[2025-05-07 17:28:36,551 INFO  L79                 Accepts]: Start accepts. Automaton has 207 states and 303 transitions. Word has length 84
[2025-05-07 17:28:36,551 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:36,551 INFO  L485      AbstractCegarLoop]: Abstraction has 207 states and 303 transitions.
[2025-05-07 17:28:36,551 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 10 states have (on average 3.8) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (23), 11 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:28:36,551 INFO  L278                IsEmpty]: Start isEmpty. Operand 207 states and 303 transitions.
[2025-05-07 17:28:36,553 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2025-05-07 17:28:36,553 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:36,554 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:36,554 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:28:36,554 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:36,554 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:36,554 INFO  L85        PathProgramCache]: Analyzing trace with hash -106151646, now seen corresponding path program 1 times
[2025-05-07 17:28:36,555 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:36,555 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637252806]
[2025-05-07 17:28:36,555 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:36,555 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:36,590 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes.
[2025-05-07 17:28:36,611 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements.
[2025-05-07 17:28:36,611 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:36,611 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:36,925 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-05-07 17:28:36,925 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:36,925 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637252806]
[2025-05-07 17:28:36,925 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637252806] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:36,925 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:36,925 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-05-07 17:28:36,925 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860440189]
[2025-05-07 17:28:36,925 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:36,926 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-05-07 17:28:36,926 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:36,926 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-05-07 17:28:36,927 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:28:36,927 INFO  L87              Difference]: Start difference. First operand 207 states and 303 transitions. Second operand  has 10 states, 8 states have (on average 5.125) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 8 states have return successors, (27), 9 states have call predecessors, (27), 5 states have call successors, (27)
[2025-05-07 17:28:37,097 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:37,097 INFO  L93              Difference]: Finished difference Result 211 states and 315 transitions.
[2025-05-07 17:28:37,098 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-05-07 17:28:37,098 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 5.125) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 8 states have return successors, (27), 9 states have call predecessors, (27), 5 states have call successors, (27) Word has length 98
[2025-05-07 17:28:37,098 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:37,099 INFO  L225             Difference]: With dead ends: 211
[2025-05-07 17:28:37,099 INFO  L226             Difference]: Without dead ends: 211
[2025-05-07 17:28:37,099 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:28:37,100 INFO  L437           NwaCegarLoop]: 246 mSDtfsCounter, 2 mSDsluCounter, 1935 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2181 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:37,100 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2181 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:37,101 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2025-05-07 17:28:37,108 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209.
[2025-05-07 17:28:37,108 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 209 states, 77 states have (on average 1.103896103896104) internal successors, (85), 85 states have internal predecessors, (85), 84 states have call successors, (92), 39 states have call predecessors, (92), 48 states have return successors, (136), 84 states have call predecessors, (136), 84 states have call successors, (136)
[2025-05-07 17:28:37,110 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 313 transitions.
[2025-05-07 17:28:37,110 INFO  L79                 Accepts]: Start accepts. Automaton has 209 states and 313 transitions. Word has length 98
[2025-05-07 17:28:37,110 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:37,110 INFO  L485      AbstractCegarLoop]: Abstraction has 209 states and 313 transitions.
[2025-05-07 17:28:37,110 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 5.125) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 8 states have return successors, (27), 9 states have call predecessors, (27), 5 states have call successors, (27)
[2025-05-07 17:28:37,110 INFO  L278                IsEmpty]: Start isEmpty. Operand 209 states and 313 transitions.
[2025-05-07 17:28:37,111 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2025-05-07 17:28:37,111 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:37,111 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]
[2025-05-07 17:28:37,112 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:28:37,112 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:37,112 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:37,112 INFO  L85        PathProgramCache]: Analyzing trace with hash -1478021175, now seen corresponding path program 1 times
[2025-05-07 17:28:37,112 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:37,112 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564508963]
[2025-05-07 17:28:37,112 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:37,112 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:37,138 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes.
[2025-05-07 17:28:37,147 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-05-07 17:28:37,147 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:37,148 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:37,383 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:37,383 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:37,383 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564508963]
[2025-05-07 17:28:37,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564508963] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:37,384 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:37,384 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-05-07 17:28:37,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537185136]
[2025-05-07 17:28:37,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:37,384 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-05-07 17:28:37,384 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:37,385 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-05-07 17:28:37,385 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132
[2025-05-07 17:28:37,385 INFO  L87              Difference]: Start difference. First operand 209 states and 313 transitions. Second operand  has 12 states, 10 states have (on average 3.7) internal successors, (37), 12 states have internal predecessors, (37), 5 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (22), 10 states have call predecessors, (22), 5 states have call successors, (22)
[2025-05-07 17:28:37,633 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:37,633 INFO  L93              Difference]: Finished difference Result 211 states and 313 transitions.
[2025-05-07 17:28:37,633 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-05-07 17:28:37,633 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 10 states have (on average 3.7) internal successors, (37), 12 states have internal predecessors, (37), 5 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (22), 10 states have call predecessors, (22), 5 states have call successors, (22) Word has length 81
[2025-05-07 17:28:37,633 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:37,634 INFO  L225             Difference]: With dead ends: 211
[2025-05-07 17:28:37,634 INFO  L226             Difference]: Without dead ends: 211
[2025-05-07 17:28:37,634 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:28:37,635 INFO  L437           NwaCegarLoop]: 254 mSDtfsCounter, 2 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:37,635 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2744 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:37,636 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2025-05-07 17:28:37,641 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209.
[2025-05-07 17:28:37,642 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 209 states, 77 states have (on average 1.103896103896104) internal successors, (85), 85 states have internal predecessors, (85), 84 states have call successors, (92), 39 states have call predecessors, (92), 48 states have return successors, (134), 84 states have call predecessors, (134), 84 states have call successors, (134)
[2025-05-07 17:28:37,643 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 311 transitions.
[2025-05-07 17:28:37,643 INFO  L79                 Accepts]: Start accepts. Automaton has 209 states and 311 transitions. Word has length 81
[2025-05-07 17:28:37,643 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:37,643 INFO  L485      AbstractCegarLoop]: Abstraction has 209 states and 311 transitions.
[2025-05-07 17:28:37,643 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 10 states have (on average 3.7) internal successors, (37), 12 states have internal predecessors, (37), 5 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (22), 10 states have call predecessors, (22), 5 states have call successors, (22)
[2025-05-07 17:28:37,643 INFO  L278                IsEmpty]: Start isEmpty. Operand 209 states and 311 transitions.
[2025-05-07 17:28:37,645 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 107
[2025-05-07 17:28:37,645 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:37,645 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:37,645 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:28:37,645 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:37,645 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:37,645 INFO  L85        PathProgramCache]: Analyzing trace with hash 1517956308, now seen corresponding path program 1 times
[2025-05-07 17:28:37,646 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:37,646 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240514481]
[2025-05-07 17:28:37,646 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:37,646 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:37,675 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes.
[2025-05-07 17:28:37,694 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements.
[2025-05-07 17:28:37,694 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:37,694 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:37,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-05-07 17:28:37,881 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:37,882 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240514481]
[2025-05-07 17:28:37,882 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240514481] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:37,882 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:37,882 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-05-07 17:28:37,882 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139617717]
[2025-05-07 17:28:37,882 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:37,882 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-05-07 17:28:37,883 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:37,883 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-05-07 17:28:37,883 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:28:37,883 INFO  L87              Difference]: Start difference. First operand 209 states and 311 transitions. Second operand  has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (29), 11 states have call predecessors, (29), 4 states have call successors, (29)
[2025-05-07 17:28:38,103 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:38,104 INFO  L93              Difference]: Finished difference Result 213 states and 323 transitions.
[2025-05-07 17:28:38,104 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-05-07 17:28:38,104 INFO  L79                 Accepts]: Start accepts. Automaton has  has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (29), 11 states have call predecessors, (29), 4 states have call successors, (29) Word has length 106
[2025-05-07 17:28:38,105 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:38,106 INFO  L225             Difference]: With dead ends: 213
[2025-05-07 17:28:38,106 INFO  L226             Difference]: Without dead ends: 213
[2025-05-07 17:28:38,106 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:28:38,106 INFO  L437           NwaCegarLoop]: 253 mSDtfsCounter, 1 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2478 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:38,107 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2478 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:38,107 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 213 states.
[2025-05-07 17:28:38,113 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 209.
[2025-05-07 17:28:38,113 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 209 states, 77 states have (on average 1.103896103896104) internal successors, (85), 85 states have internal predecessors, (85), 84 states have call successors, (92), 39 states have call predecessors, (92), 48 states have return successors, (134), 84 states have call predecessors, (134), 84 states have call successors, (134)
[2025-05-07 17:28:38,114 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 311 transitions.
[2025-05-07 17:28:38,114 INFO  L79                 Accepts]: Start accepts. Automaton has 209 states and 311 transitions. Word has length 106
[2025-05-07 17:28:38,115 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:38,115 INFO  L485      AbstractCegarLoop]: Abstraction has 209 states and 311 transitions.
[2025-05-07 17:28:38,115 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (29), 11 states have call predecessors, (29), 4 states have call successors, (29)
[2025-05-07 17:28:38,115 INFO  L278                IsEmpty]: Start isEmpty. Operand 209 states and 311 transitions.
[2025-05-07 17:28:38,116 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2025-05-07 17:28:38,116 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:38,116 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:38,116 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:28:38,116 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:38,117 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:38,117 INFO  L85        PathProgramCache]: Analyzing trace with hash 1061153525, now seen corresponding path program 1 times
[2025-05-07 17:28:38,117 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:38,117 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040598769]
[2025-05-07 17:28:38,117 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:38,117 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:38,148 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes.
[2025-05-07 17:28:38,164 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements.
[2025-05-07 17:28:38,164 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:38,164 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:38,356 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-05-07 17:28:38,357 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:38,357 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040598769]
[2025-05-07 17:28:38,357 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040598769] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:38,357 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:38,357 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-05-07 17:28:38,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478124336]
[2025-05-07 17:28:38,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:38,357 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-05-07 17:28:38,358 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:38,358 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-05-07 17:28:38,358 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:28:38,358 INFO  L87              Difference]: Start difference. First operand 209 states and 311 transitions. Second operand  has 10 states, 8 states have (on average 5.25) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 8 states have return successors, (28), 9 states have call predecessors, (28), 5 states have call successors, (28)
[2025-05-07 17:28:38,524 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:38,524 INFO  L93              Difference]: Finished difference Result 211 states and 320 transitions.
[2025-05-07 17:28:38,525 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-05-07 17:28:38,525 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 5.25) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 8 states have return successors, (28), 9 states have call predecessors, (28), 5 states have call successors, (28) Word has length 101
[2025-05-07 17:28:38,525 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:38,527 INFO  L225             Difference]: With dead ends: 211
[2025-05-07 17:28:38,527 INFO  L226             Difference]: Without dead ends: 211
[2025-05-07 17:28:38,527 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:28:38,528 INFO  L437           NwaCegarLoop]: 246 mSDtfsCounter, 2 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:38,528 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2183 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:38,529 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2025-05-07 17:28:38,537 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211.
[2025-05-07 17:28:38,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 211 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 86 states have internal predecessors, (86), 84 states have call successors, (92), 39 states have call predecessors, (92), 49 states have return successors, (142), 85 states have call predecessors, (142), 84 states have call successors, (142)
[2025-05-07 17:28:38,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 320 transitions.
[2025-05-07 17:28:38,540 INFO  L79                 Accepts]: Start accepts. Automaton has 211 states and 320 transitions. Word has length 101
[2025-05-07 17:28:38,540 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:38,540 INFO  L485      AbstractCegarLoop]: Abstraction has 211 states and 320 transitions.
[2025-05-07 17:28:38,540 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 5.25) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 8 states have return successors, (28), 9 states have call predecessors, (28), 5 states have call successors, (28)
[2025-05-07 17:28:38,540 INFO  L278                IsEmpty]: Start isEmpty. Operand 211 states and 320 transitions.
[2025-05-07 17:28:38,542 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-05-07 17:28:38,542 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:38,542 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:38,543 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:28:38,543 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:38,543 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:38,543 INFO  L85        PathProgramCache]: Analyzing trace with hash 245758551, now seen corresponding path program 1 times
[2025-05-07 17:28:38,543 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:38,543 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303208935]
[2025-05-07 17:28:38,543 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:38,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:38,575 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-05-07 17:28:38,576 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-05-07 17:28:38,576 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:38,576 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:38,634 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-05-07 17:28:38,634 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:38,634 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303208935]
[2025-05-07 17:28:38,634 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303208935] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:38,634 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:38,634 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:38,634 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058408256]
[2025-05-07 17:28:38,635 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:38,635 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:38,635 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:38,635 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:38,636 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:38,636 INFO  L87              Difference]: Start difference. First operand 211 states and 320 transitions. Second operand  has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (27), 1 states have call predecessors, (27), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:28:38,646 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:38,646 INFO  L93              Difference]: Finished difference Result 215 states and 324 transitions.
[2025-05-07 17:28:38,646 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:38,647 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (27), 1 states have call predecessors, (27), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 109
[2025-05-07 17:28:38,647 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:38,648 INFO  L225             Difference]: With dead ends: 215
[2025-05-07 17:28:38,648 INFO  L226             Difference]: Without dead ends: 211
[2025-05-07 17:28:38,649 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:38,649 INFO  L437           NwaCegarLoop]: 258 mSDtfsCounter, 1 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:38,649 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 767 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:38,650 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2025-05-07 17:28:38,666 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209.
[2025-05-07 17:28:38,667 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 209 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 85 states have internal predecessors, (85), 82 states have call successors, (90), 39 states have call predecessors, (90), 49 states have return successors, (140), 84 states have call predecessors, (140), 82 states have call successors, (140)
[2025-05-07 17:28:38,668 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 315 transitions.
[2025-05-07 17:28:38,668 INFO  L79                 Accepts]: Start accepts. Automaton has 209 states and 315 transitions. Word has length 109
[2025-05-07 17:28:38,669 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:38,669 INFO  L485      AbstractCegarLoop]: Abstraction has 209 states and 315 transitions.
[2025-05-07 17:28:38,669 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (27), 1 states have call predecessors, (27), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:28:38,669 INFO  L278                IsEmpty]: Start isEmpty. Operand 209 states and 315 transitions.
[2025-05-07 17:28:38,671 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-05-07 17:28:38,671 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:38,671 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:38,671 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:28:38,671 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:38,672 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:38,672 INFO  L85        PathProgramCache]: Analyzing trace with hash -1546746029, now seen corresponding path program 1 times
[2025-05-07 17:28:38,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:38,672 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753062419]
[2025-05-07 17:28:38,672 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:38,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:38,705 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-05-07 17:28:38,722 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-05-07 17:28:38,722 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:38,722 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:38,981 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-05-07 17:28:38,981 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:38,981 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753062419]
[2025-05-07 17:28:38,981 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753062419] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:38,981 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:38,981 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:28:38,981 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343190816]
[2025-05-07 17:28:38,981 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:38,982 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:28:38,982 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:38,982 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:28:38,982 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:28:38,982 INFO  L87              Difference]: Start difference. First operand 209 states and 315 transitions. Second operand  has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 8 states have internal predecessors, (44), 4 states have call successors, (27), 1 states have call predecessors, (27), 7 states have return successors, (28), 8 states have call predecessors, (28), 4 states have call successors, (28)
[2025-05-07 17:28:39,129 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:39,129 INFO  L93              Difference]: Finished difference Result 209 states and 314 transitions.
[2025-05-07 17:28:39,130 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:28:39,130 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), 4 states have call successors, (27), 1 states have call predecessors, (27), 7 states have return successors, (28), 8 states have call predecessors, (28), 4 states have call successors, (28) Word has length 109
[2025-05-07 17:28:39,130 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:39,132 INFO  L225             Difference]: With dead ends: 209
[2025-05-07 17:28:39,132 INFO  L226             Difference]: Without dead ends: 209
[2025-05-07 17:28:39,132 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:28:39,132 INFO  L437           NwaCegarLoop]: 251 mSDtfsCounter, 1 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:39,133 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1725 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:39,133 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 209 states.
[2025-05-07 17:28:39,142 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209.
[2025-05-07 17:28:39,142 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 209 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 85 states have internal predecessors, (85), 82 states have call successors, (90), 39 states have call predecessors, (90), 49 states have return successors, (139), 84 states have call predecessors, (139), 82 states have call successors, (139)
[2025-05-07 17:28:39,144 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 314 transitions.
[2025-05-07 17:28:39,144 INFO  L79                 Accepts]: Start accepts. Automaton has 209 states and 314 transitions. Word has length 109
[2025-05-07 17:28:39,144 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:39,144 INFO  L485      AbstractCegarLoop]: Abstraction has 209 states and 314 transitions.
[2025-05-07 17:28:39,144 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), 4 states have call successors, (27), 1 states have call predecessors, (27), 7 states have return successors, (28), 8 states have call predecessors, (28), 4 states have call successors, (28)
[2025-05-07 17:28:39,144 INFO  L278                IsEmpty]: Start isEmpty. Operand 209 states and 314 transitions.
[2025-05-07 17:28:39,146 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2025-05-07 17:28:39,146 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:39,146 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:39,146 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:28:39,146 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:39,147 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:39,147 INFO  L85        PathProgramCache]: Analyzing trace with hash 89523269, now seen corresponding path program 1 times
[2025-05-07 17:28:39,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:39,147 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482546565]
[2025-05-07 17:28:39,147 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:39,147 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:39,178 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes.
[2025-05-07 17:28:39,192 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements.
[2025-05-07 17:28:39,192 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:39,192 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:39,417 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-05-07 17:28:39,417 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:39,417 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482546565]
[2025-05-07 17:28:39,417 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482546565] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:39,417 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:39,418 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-05-07 17:28:39,418 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741649354]
[2025-05-07 17:28:39,418 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:39,418 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-05-07 17:28:39,418 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:39,419 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-05-07 17:28:39,419 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:28:39,419 INFO  L87              Difference]: Start difference. First operand 209 states and 314 transitions. Second operand  has 10 states, 8 states have (on average 5.25) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 8 states have return successors, (28), 9 states have call predecessors, (28), 5 states have call successors, (28)
[2025-05-07 17:28:39,591 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:39,591 INFO  L93              Difference]: Finished difference Result 209 states and 313 transitions.
[2025-05-07 17:28:39,591 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-05-07 17:28:39,592 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 5.25) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 8 states have return successors, (28), 9 states have call predecessors, (28), 5 states have call successors, (28) Word has length 101
[2025-05-07 17:28:39,592 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:39,593 INFO  L225             Difference]: With dead ends: 209
[2025-05-07 17:28:39,593 INFO  L226             Difference]: Without dead ends: 209
[2025-05-07 17:28:39,594 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:28:39,594 INFO  L437           NwaCegarLoop]: 241 mSDtfsCounter, 2 mSDsluCounter, 1897 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:39,594 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2138 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:39,595 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 209 states.
[2025-05-07 17:28:39,605 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209.
[2025-05-07 17:28:39,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 209 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 85 states have internal predecessors, (85), 82 states have call successors, (90), 39 states have call predecessors, (90), 49 states have return successors, (138), 84 states have call predecessors, (138), 82 states have call successors, (138)
[2025-05-07 17:28:39,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 313 transitions.
[2025-05-07 17:28:39,607 INFO  L79                 Accepts]: Start accepts. Automaton has 209 states and 313 transitions. Word has length 101
[2025-05-07 17:28:39,607 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:39,607 INFO  L485      AbstractCegarLoop]: Abstraction has 209 states and 313 transitions.
[2025-05-07 17:28:39,608 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 5.25) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 8 states have return successors, (28), 9 states have call predecessors, (28), 5 states have call successors, (28)
[2025-05-07 17:28:39,608 INFO  L278                IsEmpty]: Start isEmpty. Operand 209 states and 313 transitions.
[2025-05-07 17:28:39,609 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-05-07 17:28:39,609 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:39,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:28:39,610 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:28:39,610 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:39,610 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:39,610 INFO  L85        PathProgramCache]: Analyzing trace with hash 667846284, now seen corresponding path program 1 times
[2025-05-07 17:28:39,610 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:39,610 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909732772]
[2025-05-07 17:28:39,610 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:39,610 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:39,645 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-05-07 17:28:39,658 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-05-07 17:28:39,658 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:39,658 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:39,934 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:39,934 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:39,934 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909732772]
[2025-05-07 17:28:39,934 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909732772] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:39,934 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:39,934 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:28:39,934 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950620935]
[2025-05-07 17:28:39,935 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:39,935 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:28:39,935 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:39,935 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:28:39,936 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:39,936 INFO  L87              Difference]: Start difference. First operand 209 states and 313 transitions. Second operand  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 13 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:28:40,272 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:40,272 INFO  L93              Difference]: Finished difference Result 215 states and 333 transitions.
[2025-05-07 17:28:40,273 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:28:40,273 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 13 states have call predecessors, (25), 5 states have call successors, (25) Word has length 92
[2025-05-07 17:28:40,273 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:40,274 INFO  L225             Difference]: With dead ends: 215
[2025-05-07 17:28:40,274 INFO  L226             Difference]: Without dead ends: 215
[2025-05-07 17:28:40,275 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:28:40,275 INFO  L437           NwaCegarLoop]: 246 mSDtfsCounter, 2 mSDsluCounter, 2904 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3150 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:40,275 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3150 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:28:40,276 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 215 states.
[2025-05-07 17:28:40,282 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215.
[2025-05-07 17:28:40,282 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 215 states, 81 states have (on average 1.0864197530864197) internal successors, (88), 88 states have internal predecessors, (88), 82 states have call successors, (90), 39 states have call predecessors, (90), 52 states have return successors, (155), 87 states have call predecessors, (155), 82 states have call successors, (155)
[2025-05-07 17:28:40,284 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 333 transitions.
[2025-05-07 17:28:40,284 INFO  L79                 Accepts]: Start accepts. Automaton has 215 states and 333 transitions. Word has length 92
[2025-05-07 17:28:40,284 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:40,284 INFO  L485      AbstractCegarLoop]: Abstraction has 215 states and 333 transitions.
[2025-05-07 17:28:40,284 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 13 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:28:40,284 INFO  L278                IsEmpty]: Start isEmpty. Operand 215 states and 333 transitions.
[2025-05-07 17:28:40,285 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-05-07 17:28:40,286 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:40,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]
[2025-05-07 17:28:40,286 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-05-07 17:28:40,286 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:40,286 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:40,286 INFO  L85        PathProgramCache]: Analyzing trace with hash 750128854, now seen corresponding path program 1 times
[2025-05-07 17:28:40,286 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:40,286 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37619488]
[2025-05-07 17:28:40,286 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:40,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:40,310 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-05-07 17:28:40,319 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-05-07 17:28:40,319 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:40,319 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:40,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:40,585 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:40,586 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37619488]
[2025-05-07 17:28:40,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37619488] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:40,586 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:40,586 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:28:40,586 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663916369]
[2025-05-07 17:28:40,586 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:40,586 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:28:40,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:40,587 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:28:40,587 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:40,587 INFO  L87              Difference]: Start difference. First operand 215 states and 333 transitions. Second operand  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 13 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:28:40,891 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:40,891 INFO  L93              Difference]: Finished difference Result 213 states and 330 transitions.
[2025-05-07 17:28:40,892 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:28:40,892 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 13 states have call predecessors, (25), 5 states have call successors, (25) Word has length 92
[2025-05-07 17:28:40,892 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:40,893 INFO  L225             Difference]: With dead ends: 213
[2025-05-07 17:28:40,893 INFO  L226             Difference]: Without dead ends: 210
[2025-05-07 17:28:40,893 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:28:40,894 INFO  L437           NwaCegarLoop]: 242 mSDtfsCounter, 1 mSDsluCounter, 2856 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3098 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:40,894 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3098 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:28:40,894 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 210 states.
[2025-05-07 17:28:40,900 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 204.
[2025-05-07 17:28:40,900 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 204 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 83 states have internal predecessors, (83), 80 states have call successors, (87), 38 states have call predecessors, (87), 48 states have return successors, (135), 82 states have call predecessors, (135), 80 states have call successors, (135)
[2025-05-07 17:28:40,901 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 305 transitions.
[2025-05-07 17:28:40,901 INFO  L79                 Accepts]: Start accepts. Automaton has 204 states and 305 transitions. Word has length 92
[2025-05-07 17:28:40,901 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:40,901 INFO  L485      AbstractCegarLoop]: Abstraction has 204 states and 305 transitions.
[2025-05-07 17:28:40,901 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 13 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:28:40,901 INFO  L278                IsEmpty]: Start isEmpty. Operand 204 states and 305 transitions.
[2025-05-07 17:28:40,902 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-05-07 17:28:40,902 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:40,902 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:40,902 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-05-07 17:28:40,902 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:40,903 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:40,903 INFO  L85        PathProgramCache]: Analyzing trace with hash 28458791, now seen corresponding path program 1 times
[2025-05-07 17:28:40,903 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:40,903 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663681912]
[2025-05-07 17:28:40,903 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:40,903 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:40,934 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-05-07 17:28:40,945 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-05-07 17:28:40,945 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:40,945 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:41,017 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-05-07 17:28:41,017 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:41,018 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663681912]
[2025-05-07 17:28:41,018 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663681912] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:41,018 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:41,018 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:41,018 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413624698]
[2025-05-07 17:28:41,018 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:41,018 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:41,018 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:41,019 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:41,019 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:41,019 INFO  L87              Difference]: Start difference. First operand 204 states and 305 transitions. Second operand  has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:28:41,053 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:41,053 INFO  L93              Difference]: Finished difference Result 209 states and 311 transitions.
[2025-05-07 17:28:41,054 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:41,054 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27) Word has length 109
[2025-05-07 17:28:41,054 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:41,055 INFO  L225             Difference]: With dead ends: 209
[2025-05-07 17:28:41,055 INFO  L226             Difference]: Without dead ends: 209
[2025-05-07 17:28:41,056 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:41,056 INFO  L437           NwaCegarLoop]: 248 mSDtfsCounter, 1 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:41,056 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1220 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:41,057 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 209 states.
[2025-05-07 17:28:41,061 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 204.
[2025-05-07 17:28:41,061 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 204 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 83 states have internal predecessors, (83), 80 states have call successors, (87), 38 states have call predecessors, (87), 48 states have return successors, (135), 82 states have call predecessors, (135), 80 states have call successors, (135)
[2025-05-07 17:28:41,062 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 305 transitions.
[2025-05-07 17:28:41,062 INFO  L79                 Accepts]: Start accepts. Automaton has 204 states and 305 transitions. Word has length 109
[2025-05-07 17:28:41,063 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:41,063 INFO  L485      AbstractCegarLoop]: Abstraction has 204 states and 305 transitions.
[2025-05-07 17:28:41,063 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:28:41,063 INFO  L278                IsEmpty]: Start isEmpty. Operand 204 states and 305 transitions.
[2025-05-07 17:28:41,064 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2025-05-07 17:28:41,064 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:41,064 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:41,064 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-05-07 17:28:41,064 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:41,064 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:41,064 INFO  L85        PathProgramCache]: Analyzing trace with hash 588455792, now seen corresponding path program 1 times
[2025-05-07 17:28:41,064 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:41,064 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685883489]
[2025-05-07 17:28:41,064 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:41,065 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:41,094 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-05-07 17:28:41,104 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-05-07 17:28:41,104 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:41,104 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:41,352 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-05-07 17:28:41,352 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:41,352 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685883489]
[2025-05-07 17:28:41,352 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685883489] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:41,352 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:41,352 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:28:41,352 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456642013]
[2025-05-07 17:28:41,352 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:41,352 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:28:41,352 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:41,353 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:28:41,353 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:41,353 INFO  L87              Difference]: Start difference. First operand 204 states and 305 transitions. Second operand  has 14 states, 12 states have (on average 4.25) internal successors, (51), 14 states have internal predecessors, (51), 5 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (32), 13 states have call predecessors, (32), 5 states have call successors, (32)
[2025-05-07 17:28:41,608 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:41,608 INFO  L93              Difference]: Finished difference Result 210 states and 322 transitions.
[2025-05-07 17:28:41,608 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:28:41,608 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 4.25) internal successors, (51), 14 states have internal predecessors, (51), 5 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (32), 13 states have call predecessors, (32), 5 states have call successors, (32) Word has length 117
[2025-05-07 17:28:41,608 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:41,610 INFO  L225             Difference]: With dead ends: 210
[2025-05-07 17:28:41,610 INFO  L226             Difference]: Without dead ends: 210
[2025-05-07 17:28:41,610 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:28:41,610 INFO  L437           NwaCegarLoop]: 237 mSDtfsCounter, 2 mSDsluCounter, 2797 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3034 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:41,611 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3034 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:41,611 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 210 states.
[2025-05-07 17:28:41,620 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210.
[2025-05-07 17:28:41,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 210 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 86 states have internal predecessors, (86), 80 states have call successors, (87), 38 states have call predecessors, (87), 51 states have return successors, (149), 85 states have call predecessors, (149), 80 states have call successors, (149)
[2025-05-07 17:28:41,621 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 322 transitions.
[2025-05-07 17:28:41,622 INFO  L79                 Accepts]: Start accepts. Automaton has 210 states and 322 transitions. Word has length 117
[2025-05-07 17:28:41,622 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:41,622 INFO  L485      AbstractCegarLoop]: Abstraction has 210 states and 322 transitions.
[2025-05-07 17:28:41,622 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 12 states have (on average 4.25) internal successors, (51), 14 states have internal predecessors, (51), 5 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (32), 13 states have call predecessors, (32), 5 states have call successors, (32)
[2025-05-07 17:28:41,622 INFO  L278                IsEmpty]: Start isEmpty. Operand 210 states and 322 transitions.
[2025-05-07 17:28:41,624 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2025-05-07 17:28:41,624 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:41,624 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:41,624 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-05-07 17:28:41,624 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:41,625 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:41,625 INFO  L85        PathProgramCache]: Analyzing trace with hash 506173222, now seen corresponding path program 1 times
[2025-05-07 17:28:41,625 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:41,625 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949543290]
[2025-05-07 17:28:41,625 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:41,625 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:41,666 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-05-07 17:28:41,682 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-05-07 17:28:41,683 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:41,683 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:42,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-05-07 17:28:42,032 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:42,032 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949543290]
[2025-05-07 17:28:42,032 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949543290] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:42,032 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:42,032 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:28:42,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14942173]
[2025-05-07 17:28:42,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:42,032 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:28:42,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:42,033 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:28:42,033 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:42,033 INFO  L87              Difference]: Start difference. First operand 210 states and 322 transitions. Second operand  has 14 states, 12 states have (on average 4.25) internal successors, (51), 14 states have internal predecessors, (51), 5 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (32), 13 states have call predecessors, (32), 5 states have call successors, (32)
[2025-05-07 17:28:42,313 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:42,313 INFO  L93              Difference]: Finished difference Result 208 states and 319 transitions.
[2025-05-07 17:28:42,313 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:28:42,313 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 4.25) internal successors, (51), 14 states have internal predecessors, (51), 5 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (32), 13 states have call predecessors, (32), 5 states have call successors, (32) Word has length 117
[2025-05-07 17:28:42,314 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:42,315 INFO  L225             Difference]: With dead ends: 208
[2025-05-07 17:28:42,315 INFO  L226             Difference]: Without dead ends: 204
[2025-05-07 17:28:42,316 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:28:42,316 INFO  L437           NwaCegarLoop]: 232 mSDtfsCounter, 1 mSDsluCounter, 2739 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2971 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:42,316 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2971 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:28:42,317 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 204 states.
[2025-05-07 17:28:42,323 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 198.
[2025-05-07 17:28:42,323 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 198 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 81 states have internal predecessors, (81), 77 states have call successors, (83), 37 states have call predecessors, (83), 47 states have return successors, (129), 79 states have call predecessors, (129), 77 states have call successors, (129)
[2025-05-07 17:28:42,324 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 293 transitions.
[2025-05-07 17:28:42,324 INFO  L79                 Accepts]: Start accepts. Automaton has 198 states and 293 transitions. Word has length 117
[2025-05-07 17:28:42,324 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:42,324 INFO  L485      AbstractCegarLoop]: Abstraction has 198 states and 293 transitions.
[2025-05-07 17:28:42,324 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 12 states have (on average 4.25) internal successors, (51), 14 states have internal predecessors, (51), 5 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (32), 13 states have call predecessors, (32), 5 states have call successors, (32)
[2025-05-07 17:28:42,324 INFO  L278                IsEmpty]: Start isEmpty. Operand 198 states and 293 transitions.
[2025-05-07 17:28:42,325 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 140
[2025-05-07 17:28:42,325 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:42,325 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:42,325 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-05-07 17:28:42,325 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:42,326 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:42,326 INFO  L85        PathProgramCache]: Analyzing trace with hash -608969433, now seen corresponding path program 1 times
[2025-05-07 17:28:42,326 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:42,326 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90320964]
[2025-05-07 17:28:42,326 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:42,326 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:42,364 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes.
[2025-05-07 17:28:42,372 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements.
[2025-05-07 17:28:42,372 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:42,372 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:42,621 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2025-05-07 17:28:42,621 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:42,621 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90320964]
[2025-05-07 17:28:42,621 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90320964] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:42,621 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218198682]
[2025-05-07 17:28:42,621 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:42,621 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:42,623 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:42,625 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:42,625 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:28:42,957 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes.
[2025-05-07 17:28:43,133 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements.
[2025-05-07 17:28:43,134 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:43,134 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:43,141 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2202 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:43,149 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:43,307 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2025-05-07 17:28:43,307 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:45,061 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2025-05-07 17:28:45,061 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218198682] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:28:45,062 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:28:45,062 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 20
[2025-05-07 17:28:45,062 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492129249]
[2025-05-07 17:28:45,062 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:45,062 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-05-07 17:28:45,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:45,063 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-05-07 17:28:45,063 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380
[2025-05-07 17:28:45,063 INFO  L87              Difference]: Start difference. First operand 198 states and 293 transitions. Second operand  has 20 states, 16 states have (on average 4.0625) internal successors, (65), 20 states have internal predecessors, (65), 10 states have call successors, (42), 1 states have call predecessors, (42), 16 states have return successors, (51), 19 states have call predecessors, (51), 10 states have call successors, (51)
[2025-05-07 17:28:45,342 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:45,342 INFO  L93              Difference]: Finished difference Result 202 states and 302 transitions.
[2025-05-07 17:28:45,343 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-05-07 17:28:45,343 INFO  L79                 Accepts]: Start accepts. Automaton has  has 20 states, 16 states have (on average 4.0625) internal successors, (65), 20 states have internal predecessors, (65), 10 states have call successors, (42), 1 states have call predecessors, (42), 16 states have return successors, (51), 19 states have call predecessors, (51), 10 states have call successors, (51) Word has length 139
[2025-05-07 17:28:45,343 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:45,344 INFO  L225             Difference]: With dead ends: 202
[2025-05-07 17:28:45,344 INFO  L226             Difference]: Without dead ends: 202
[2025-05-07 17:28:45,344 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 261 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650
[2025-05-07 17:28:45,344 INFO  L437           NwaCegarLoop]: 227 mSDtfsCounter, 4 mSDsluCounter, 3799 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4026 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:45,344 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4026 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:45,345 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 202 states.
[2025-05-07 17:28:45,349 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200.
[2025-05-07 17:28:45,349 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 200 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 82 states have internal predecessors, (82), 77 states have call successors, (83), 37 states have call predecessors, (83), 48 states have return successors, (135), 80 states have call predecessors, (135), 77 states have call successors, (135)
[2025-05-07 17:28:45,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 300 transitions.
[2025-05-07 17:28:45,350 INFO  L79                 Accepts]: Start accepts. Automaton has 200 states and 300 transitions. Word has length 139
[2025-05-07 17:28:45,351 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:45,351 INFO  L485      AbstractCegarLoop]: Abstraction has 200 states and 300 transitions.
[2025-05-07 17:28:45,351 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 16 states have (on average 4.0625) internal successors, (65), 20 states have internal predecessors, (65), 10 states have call successors, (42), 1 states have call predecessors, (42), 16 states have return successors, (51), 19 states have call predecessors, (51), 10 states have call successors, (51)
[2025-05-07 17:28:45,351 INFO  L278                IsEmpty]: Start isEmpty. Operand 200 states and 300 transitions.
[2025-05-07 17:28:45,352 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2025-05-07 17:28:45,352 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:45,352 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:45,358 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:28:45,552 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2025-05-07 17:28:45,553 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:45,554 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:45,555 INFO  L85        PathProgramCache]: Analyzing trace with hash 587348149, now seen corresponding path program 1 times
[2025-05-07 17:28:45,555 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:45,555 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648657638]
[2025-05-07 17:28:45,556 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:45,556 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:45,623 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-05-07 17:28:45,632 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-05-07 17:28:45,632 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:45,632 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:45,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2025-05-07 17:28:45,918 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:45,918 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648657638]
[2025-05-07 17:28:45,918 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648657638] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:45,918 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167872262]
[2025-05-07 17:28:45,918 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:45,918 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:45,920 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:45,921 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:45,922 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-05-07 17:28:46,235 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-05-07 17:28:46,474 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-05-07 17:28:46,475 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:46,475 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:46,481 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2340 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:46,485 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:46,610 INFO  L134       CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2025-05-07 17:28:46,610 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:48,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2025-05-07 17:28:48,854 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [167872262] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:28:48,854 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:28:48,854 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 24
[2025-05-07 17:28:48,854 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98654177]
[2025-05-07 17:28:48,854 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:48,855 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2025-05-07 17:28:48,855 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:48,856 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2025-05-07 17:28:48,856 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552
[2025-05-07 17:28:48,857 INFO  L87              Difference]: Start difference. First operand 200 states and 300 transitions. Second operand  has 24 states, 20 states have (on average 3.55) internal successors, (71), 24 states have internal predecessors, (71), 10 states have call successors, (44), 1 states have call predecessors, (44), 20 states have return successors, (55), 23 states have call predecessors, (55), 10 states have call successors, (55)
[2025-05-07 17:28:49,156 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:49,156 INFO  L93              Difference]: Finished difference Result 204 states and 309 transitions.
[2025-05-07 17:28:49,156 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-05-07 17:28:49,157 INFO  L79                 Accepts]: Start accepts. Automaton has  has 24 states, 20 states have (on average 3.55) internal successors, (71), 24 states have internal predecessors, (71), 10 states have call successors, (44), 1 states have call predecessors, (44), 20 states have return successors, (55), 23 states have call predecessors, (55), 10 states have call successors, (55) Word has length 147
[2025-05-07 17:28:49,157 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:49,159 INFO  L225             Difference]: With dead ends: 204
[2025-05-07 17:28:49,159 INFO  L226             Difference]: Without dead ends: 204
[2025-05-07 17:28:49,159 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 274 SyntacticMatches, 10 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=913, Unknown=0, NotChecked=0, Total=992
[2025-05-07 17:28:49,160 INFO  L437           NwaCegarLoop]: 229 mSDtfsCounter, 4 mSDsluCounter, 4728 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4957 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:49,160 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4957 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:49,161 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 204 states.
[2025-05-07 17:28:49,168 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200.
[2025-05-07 17:28:49,168 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 200 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 82 states have internal predecessors, (82), 77 states have call successors, (83), 37 states have call predecessors, (83), 48 states have return successors, (135), 80 states have call predecessors, (135), 77 states have call successors, (135)
[2025-05-07 17:28:49,170 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 300 transitions.
[2025-05-07 17:28:49,170 INFO  L79                 Accepts]: Start accepts. Automaton has 200 states and 300 transitions. Word has length 147
[2025-05-07 17:28:49,170 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:49,170 INFO  L485      AbstractCegarLoop]: Abstraction has 200 states and 300 transitions.
[2025-05-07 17:28:49,170 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 20 states have (on average 3.55) internal successors, (71), 24 states have internal predecessors, (71), 10 states have call successors, (44), 1 states have call predecessors, (44), 20 states have return successors, (55), 23 states have call predecessors, (55), 10 states have call successors, (55)
[2025-05-07 17:28:49,170 INFO  L278                IsEmpty]: Start isEmpty. Operand 200 states and 300 transitions.
[2025-05-07 17:28:49,172 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-05-07 17:28:49,172 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:49,172 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:49,178 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-05-07 17:28:49,373 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:49,373 INFO  L403      AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:49,374 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:49,374 INFO  L85        PathProgramCache]: Analyzing trace with hash -905256493, now seen corresponding path program 1 times
[2025-05-07 17:28:49,374 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:49,375 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594747668]
[2025-05-07 17:28:49,375 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:49,375 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:49,445 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-05-07 17:28:49,458 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-05-07 17:28:49,458 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:49,458 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:49,669 INFO  L134       CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked.
[2025-05-07 17:28:49,669 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:49,669 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594747668]
[2025-05-07 17:28:49,669 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594747668] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:49,669 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76524428]
[2025-05-07 17:28:49,669 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:49,669 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:49,671 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:49,672 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:49,673 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-05-07 17:28:50,187 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-05-07 17:28:50,400 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-05-07 17:28:50,400 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:50,400 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:50,406 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1998 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:50,409 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:50,448 INFO  L134       CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2025-05-07 17:28:50,448 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:28:50,448 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [76524428] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:50,448 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:28:50,448 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14
[2025-05-07 17:28:50,448 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456945968]
[2025-05-07 17:28:50,448 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:50,448 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:50,449 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:50,449 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:50,449 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:50,449 INFO  L87              Difference]: Start difference. First operand 200 states and 300 transitions. Second operand  has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:28:50,480 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:50,480 INFO  L93              Difference]: Finished difference Result 205 states and 306 transitions.
[2025-05-07 17:28:50,480 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:50,480 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25) Word has length 126
[2025-05-07 17:28:50,480 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:50,481 INFO  L225             Difference]: With dead ends: 205
[2025-05-07 17:28:50,481 INFO  L226             Difference]: Without dead ends: 205
[2025-05-07 17:28:50,481 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:50,482 INFO  L437           NwaCegarLoop]: 238 mSDtfsCounter, 1 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:50,482 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1169 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:50,482 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 205 states.
[2025-05-07 17:28:50,486 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200.
[2025-05-07 17:28:50,486 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 200 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 82 states have internal predecessors, (82), 77 states have call successors, (83), 37 states have call predecessors, (83), 48 states have return successors, (135), 80 states have call predecessors, (135), 77 states have call successors, (135)
[2025-05-07 17:28:50,487 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 300 transitions.
[2025-05-07 17:28:50,487 INFO  L79                 Accepts]: Start accepts. Automaton has 200 states and 300 transitions. Word has length 126
[2025-05-07 17:28:50,487 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:50,487 INFO  L485      AbstractCegarLoop]: Abstraction has 200 states and 300 transitions.
[2025-05-07 17:28:50,487 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:28:50,487 INFO  L278                IsEmpty]: Start isEmpty. Operand 200 states and 300 transitions.
[2025-05-07 17:28:50,488 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2025-05-07 17:28:50,488 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:50,488 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:28:50,494 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-05-07 17:28:50,688 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:50,688 INFO  L403      AbstractCegarLoop]: === Iteration 20 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:50,689 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:50,689 INFO  L85        PathProgramCache]: Analyzing trace with hash -49382708, now seen corresponding path program 1 times
[2025-05-07 17:28:50,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:50,689 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634254059]
[2025-05-07 17:28:50,689 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:50,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:50,714 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-05-07 17:28:50,721 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-05-07 17:28:50,721 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:50,721 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:50,938 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:50,939 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:50,939 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634254059]
[2025-05-07 17:28:50,939 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634254059] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:50,939 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:50,939 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:28:50,939 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879326156]
[2025-05-07 17:28:50,939 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:50,939 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:28:50,939 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:50,939 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:28:50,939 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:50,939 INFO  L87              Difference]: Start difference. First operand 200 states and 300 transitions. Second operand  has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (24), 12 states have call predecessors, (24), 5 states have call successors, (24)
[2025-05-07 17:28:51,217 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:51,217 INFO  L93              Difference]: Finished difference Result 208 states and 319 transitions.
[2025-05-07 17:28:51,218 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:28:51,218 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (24), 12 states have call predecessors, (24), 5 states have call successors, (24) Word has length 89
[2025-05-07 17:28:51,218 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:51,220 INFO  L225             Difference]: With dead ends: 208
[2025-05-07 17:28:51,220 INFO  L226             Difference]: Without dead ends: 208
[2025-05-07 17:28:51,220 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:28:51,220 INFO  L437           NwaCegarLoop]: 230 mSDtfsCounter, 2 mSDsluCounter, 2706 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2936 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:51,220 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2936 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:28:51,221 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 208 states.
[2025-05-07 17:28:51,226 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204.
[2025-05-07 17:28:51,226 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 204 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 84 states have internal predecessors, (84), 77 states have call successors, (83), 37 states have call predecessors, (83), 50 states have return successors, (140), 82 states have call predecessors, (140), 77 states have call successors, (140)
[2025-05-07 17:28:51,228 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 307 transitions.
[2025-05-07 17:28:51,228 INFO  L79                 Accepts]: Start accepts. Automaton has 204 states and 307 transitions. Word has length 89
[2025-05-07 17:28:51,228 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:51,228 INFO  L485      AbstractCegarLoop]: Abstraction has 204 states and 307 transitions.
[2025-05-07 17:28:51,228 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (24), 12 states have call predecessors, (24), 5 states have call successors, (24)
[2025-05-07 17:28:51,228 INFO  L278                IsEmpty]: Start isEmpty. Operand 204 states and 307 transitions.
[2025-05-07 17:28:51,230 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2025-05-07 17:28:51,230 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:51,230 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:51,231 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-05-07 17:28:51,231 INFO  L403      AbstractCegarLoop]: === Iteration 21 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:51,231 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:51,231 INFO  L85        PathProgramCache]: Analyzing trace with hash 138663127, now seen corresponding path program 1 times
[2025-05-07 17:28:51,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:51,231 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050076643]
[2025-05-07 17:28:51,231 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:51,231 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:51,263 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes.
[2025-05-07 17:28:51,272 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements.
[2025-05-07 17:28:51,272 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:51,272 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:51,596 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-05-07 17:28:51,596 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:51,596 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050076643]
[2025-05-07 17:28:51,596 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050076643] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:51,596 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:51,596 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:28:51,596 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869282260]
[2025-05-07 17:28:51,597 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:51,597 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:28:51,597 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:51,597 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:28:51,598 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:51,598 INFO  L87              Difference]: Start difference. First operand 204 states and 307 transitions. Second operand  has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 5 states have call successors, (29), 1 states have call predecessors, (29), 12 states have return successors, (31), 13 states have call predecessors, (31), 5 states have call successors, (31)
[2025-05-07 17:28:51,846 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:51,846 INFO  L93              Difference]: Finished difference Result 208 states and 318 transitions.
[2025-05-07 17:28:51,847 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:28:51,847 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 5 states have call successors, (29), 1 states have call predecessors, (29), 12 states have return successors, (31), 13 states have call predecessors, (31), 5 states have call successors, (31) Word has length 114
[2025-05-07 17:28:51,847 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:51,848 INFO  L225             Difference]: With dead ends: 208
[2025-05-07 17:28:51,848 INFO  L226             Difference]: Without dead ends: 208
[2025-05-07 17:28:51,849 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:28:51,849 INFO  L437           NwaCegarLoop]: 230 mSDtfsCounter, 2 mSDsluCounter, 2711 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2941 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:51,849 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2941 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:51,850 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 208 states.
[2025-05-07 17:28:51,857 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204.
[2025-05-07 17:28:51,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 204 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 84 states have internal predecessors, (84), 77 states have call successors, (83), 37 states have call predecessors, (83), 50 states have return successors, (140), 82 states have call predecessors, (140), 77 states have call successors, (140)
[2025-05-07 17:28:51,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 307 transitions.
[2025-05-07 17:28:51,859 INFO  L79                 Accepts]: Start accepts. Automaton has 204 states and 307 transitions. Word has length 114
[2025-05-07 17:28:51,859 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:51,860 INFO  L485      AbstractCegarLoop]: Abstraction has 204 states and 307 transitions.
[2025-05-07 17:28:51,860 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 5 states have call successors, (29), 1 states have call predecessors, (29), 12 states have return successors, (31), 13 states have call predecessors, (31), 5 states have call successors, (31)
[2025-05-07 17:28:51,860 INFO  L278                IsEmpty]: Start isEmpty. Operand 204 states and 307 transitions.
[2025-05-07 17:28:51,861 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2025-05-07 17:28:51,861 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:51,861 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:28:51,862 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-05-07 17:28:51,862 INFO  L403      AbstractCegarLoop]: === Iteration 22 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:51,862 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:51,862 INFO  L85        PathProgramCache]: Analyzing trace with hash 2017092822, now seen corresponding path program 1 times
[2025-05-07 17:28:51,862 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:51,862 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652761379]
[2025-05-07 17:28:51,862 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:51,862 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:51,890 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-05-07 17:28:51,897 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-05-07 17:28:51,897 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:51,897 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:52,096 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:28:52,096 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:52,096 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652761379]
[2025-05-07 17:28:52,096 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652761379] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:52,096 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:52,096 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:28:52,096 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473298890]
[2025-05-07 17:28:52,096 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:52,096 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:28:52,096 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:52,097 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:28:52,097 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:52,097 INFO  L87              Difference]: Start difference. First operand 204 states and 307 transitions. Second operand  has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (24), 12 states have call predecessors, (24), 5 states have call successors, (24)
[2025-05-07 17:28:52,309 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:52,309 INFO  L93              Difference]: Finished difference Result 205 states and 305 transitions.
[2025-05-07 17:28:52,309 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:28:52,309 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (24), 12 states have call predecessors, (24), 5 states have call successors, (24) Word has length 89
[2025-05-07 17:28:52,310 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:52,311 INFO  L225             Difference]: With dead ends: 205
[2025-05-07 17:28:52,311 INFO  L226             Difference]: Without dead ends: 204
[2025-05-07 17:28:52,311 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:28:52,312 INFO  L437           NwaCegarLoop]: 227 mSDtfsCounter, 2 mSDsluCounter, 2674 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2901 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:52,313 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2901 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:52,313 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 204 states.
[2025-05-07 17:28:52,318 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200.
[2025-05-07 17:28:52,318 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 200 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 82 states have internal predecessors, (82), 75 states have call successors, (81), 37 states have call predecessors, (81), 49 states have return successors, (128), 80 states have call predecessors, (128), 75 states have call successors, (128)
[2025-05-07 17:28:52,319 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 291 transitions.
[2025-05-07 17:28:52,319 INFO  L79                 Accepts]: Start accepts. Automaton has 200 states and 291 transitions. Word has length 89
[2025-05-07 17:28:52,320 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:52,320 INFO  L485      AbstractCegarLoop]: Abstraction has 200 states and 291 transitions.
[2025-05-07 17:28:52,320 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (24), 12 states have call predecessors, (24), 5 states have call successors, (24)
[2025-05-07 17:28:52,320 INFO  L278                IsEmpty]: Start isEmpty. Operand 200 states and 291 transitions.
[2025-05-07 17:28:52,321 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2025-05-07 17:28:52,321 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:52,321 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:52,321 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-05-07 17:28:52,321 INFO  L403      AbstractCegarLoop]: === Iteration 23 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:52,321 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:52,321 INFO  L85        PathProgramCache]: Analyzing trace with hash -2089828639, now seen corresponding path program 1 times
[2025-05-07 17:28:52,321 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:52,321 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090529223]
[2025-05-07 17:28:52,322 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:52,322 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:52,346 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes.
[2025-05-07 17:28:52,354 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements.
[2025-05-07 17:28:52,355 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:52,355 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:52,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-05-07 17:28:52,588 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:52,588 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090529223]
[2025-05-07 17:28:52,588 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090529223] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:52,588 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:52,589 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:28:52,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109910796]
[2025-05-07 17:28:52,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:52,589 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:28:52,589 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:52,590 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:28:52,590 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:52,590 INFO  L87              Difference]: Start difference. First operand 200 states and 291 transitions. Second operand  has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 5 states have call successors, (29), 1 states have call predecessors, (29), 12 states have return successors, (31), 13 states have call predecessors, (31), 5 states have call successors, (31)
[2025-05-07 17:28:52,848 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:52,848 INFO  L93              Difference]: Finished difference Result 199 states and 288 transitions.
[2025-05-07 17:28:52,848 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:28:52,849 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 5 states have call successors, (29), 1 states have call predecessors, (29), 12 states have return successors, (31), 13 states have call predecessors, (31), 5 states have call successors, (31) Word has length 114
[2025-05-07 17:28:52,849 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:52,849 INFO  L225             Difference]: With dead ends: 199
[2025-05-07 17:28:52,849 INFO  L226             Difference]: Without dead ends: 197
[2025-05-07 17:28:52,850 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:28:52,850 INFO  L437           NwaCegarLoop]: 220 mSDtfsCounter, 1 mSDsluCounter, 2595 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2815 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:52,850 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2815 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:52,850 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 197 states.
[2025-05-07 17:28:52,856 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189.
[2025-05-07 17:28:52,856 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 189 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 77 states have internal predecessors, (77), 72 states have call successors, (78), 37 states have call predecessors, (78), 45 states have return successors, (103), 74 states have call predecessors, (103), 72 states have call successors, (103)
[2025-05-07 17:28:52,857 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 258 transitions.
[2025-05-07 17:28:52,857 INFO  L79                 Accepts]: Start accepts. Automaton has 189 states and 258 transitions. Word has length 114
[2025-05-07 17:28:52,858 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:52,858 INFO  L485      AbstractCegarLoop]: Abstraction has 189 states and 258 transitions.
[2025-05-07 17:28:52,858 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 5 states have call successors, (29), 1 states have call predecessors, (29), 12 states have return successors, (31), 13 states have call predecessors, (31), 5 states have call successors, (31)
[2025-05-07 17:28:52,858 INFO  L278                IsEmpty]: Start isEmpty. Operand 189 states and 258 transitions.
[2025-05-07 17:28:52,859 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 165
[2025-05-07 17:28:52,859 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:52,859 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:52,859 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-05-07 17:28:52,859 INFO  L403      AbstractCegarLoop]: === Iteration 24 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:52,860 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:52,860 INFO  L85        PathProgramCache]: Analyzing trace with hash 1834417923, now seen corresponding path program 1 times
[2025-05-07 17:28:52,860 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:52,860 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028285181]
[2025-05-07 17:28:52,860 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:52,860 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:52,903 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes.
[2025-05-07 17:28:52,910 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements.
[2025-05-07 17:28:52,911 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:52,911 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:53,248 INFO  L134       CoverageAnalysis]: Checked inductivity of 111 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-05-07 17:28:53,248 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:53,248 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028285181]
[2025-05-07 17:28:53,248 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028285181] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:53,248 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633115073]
[2025-05-07 17:28:53,248 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:53,248 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:53,250 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:53,251 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:53,252 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-05-07 17:28:53,792 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes.
[2025-05-07 17:28:53,978 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements.
[2025-05-07 17:28:53,979 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:53,979 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:53,987 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2659 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:53,991 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:54,106 INFO  L134       CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked.
[2025-05-07 17:28:54,106 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:28:54,106 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633115073] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:54,106 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:28:54,106 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19
[2025-05-07 17:28:54,106 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424298613]
[2025-05-07 17:28:54,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:54,107 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-05-07 17:28:54,107 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:54,107 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-05-07 17:28:54,107 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342
[2025-05-07 17:28:54,107 INFO  L87              Difference]: Start difference. First operand 189 states and 258 transitions. Second operand  has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (33), 1 states have call predecessors, (33), 10 states have return successors, (37), 11 states have call predecessors, (37), 4 states have call successors, (37)
[2025-05-07 17:28:54,248 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:54,249 INFO  L93              Difference]: Finished difference Result 196 states and 269 transitions.
[2025-05-07 17:28:54,249 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-05-07 17:28:54,249 INFO  L79                 Accepts]: Start accepts. Automaton has  has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (33), 1 states have call predecessors, (33), 10 states have return successors, (37), 11 states have call predecessors, (37), 4 states have call successors, (37) Word has length 164
[2025-05-07 17:28:54,249 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:54,250 INFO  L225             Difference]: With dead ends: 196
[2025-05-07 17:28:54,250 INFO  L226             Difference]: Without dead ends: 196
[2025-05-07 17:28:54,250 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342
[2025-05-07 17:28:54,251 INFO  L437           NwaCegarLoop]: 215 mSDtfsCounter, 1 mSDsluCounter, 1907 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2122 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:54,251 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2122 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:54,251 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2025-05-07 17:28:54,254 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 191.
[2025-05-07 17:28:54,254 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 191 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 78 states have internal predecessors, (78), 72 states have call successors, (78), 37 states have call predecessors, (78), 46 states have return successors, (107), 75 states have call predecessors, (107), 72 states have call successors, (107)
[2025-05-07 17:28:54,255 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 263 transitions.
[2025-05-07 17:28:54,255 INFO  L79                 Accepts]: Start accepts. Automaton has 191 states and 263 transitions. Word has length 164
[2025-05-07 17:28:54,255 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:54,255 INFO  L485      AbstractCegarLoop]: Abstraction has 191 states and 263 transitions.
[2025-05-07 17:28:54,255 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 4 states have call successors, (33), 1 states have call predecessors, (33), 10 states have return successors, (37), 11 states have call predecessors, (37), 4 states have call successors, (37)
[2025-05-07 17:28:54,255 INFO  L278                IsEmpty]: Start isEmpty. Operand 191 states and 263 transitions.
[2025-05-07 17:28:54,256 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-05-07 17:28:54,256 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:54,256 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:54,262 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-05-07 17:28:54,456 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24
[2025-05-07 17:28:54,457 INFO  L403      AbstractCegarLoop]: === Iteration 25 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:54,457 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:54,457 INFO  L85        PathProgramCache]: Analyzing trace with hash -1043590843, now seen corresponding path program 1 times
[2025-05-07 17:28:54,457 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:54,457 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450743909]
[2025-05-07 17:28:54,457 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:54,457 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:54,487 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-05-07 17:28:54,495 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-05-07 17:28:54,495 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:54,495 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:54,689 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2025-05-07 17:28:54,689 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:54,689 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450743909]
[2025-05-07 17:28:54,689 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450743909] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:54,689 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322898126]
[2025-05-07 17:28:54,689 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:54,689 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:54,690 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:54,692 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:54,693 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-05-07 17:28:55,232 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-05-07 17:28:55,471 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-05-07 17:28:55,471 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:55,471 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:55,477 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2127 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:55,480 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:55,527 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked.
[2025-05-07 17:28:55,527 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:28:55,528 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [322898126] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:55,528 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:28:55,528 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14
[2025-05-07 17:28:55,528 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373418779]
[2025-05-07 17:28:55,528 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:55,528 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:55,528 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:55,529 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:55,529 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:55,529 INFO  L87              Difference]: Start difference. First operand 191 states and 263 transitions. Second operand  has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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:28:55,558 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:55,558 INFO  L93              Difference]: Finished difference Result 196 states and 269 transitions.
[2025-05-07 17:28:55,558 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:55,559 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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 134
[2025-05-07 17:28:55,559 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:55,560 INFO  L225             Difference]: With dead ends: 196
[2025-05-07 17:28:55,560 INFO  L226             Difference]: Without dead ends: 196
[2025-05-07 17:28:55,560 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:55,560 INFO  L437           NwaCegarLoop]: 225 mSDtfsCounter, 1 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:55,560 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1106 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:55,561 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2025-05-07 17:28:55,565 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 191.
[2025-05-07 17:28:55,566 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 191 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 78 states have internal predecessors, (78), 72 states have call successors, (78), 37 states have call predecessors, (78), 46 states have return successors, (107), 75 states have call predecessors, (107), 72 states have call successors, (107)
[2025-05-07 17:28:55,567 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 263 transitions.
[2025-05-07 17:28:55,567 INFO  L79                 Accepts]: Start accepts. Automaton has 191 states and 263 transitions. Word has length 134
[2025-05-07 17:28:55,567 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:55,567 INFO  L485      AbstractCegarLoop]: Abstraction has 191 states and 263 transitions.
[2025-05-07 17:28:55,567 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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:28:55,567 INFO  L278                IsEmpty]: Start isEmpty. Operand 191 states and 263 transitions.
[2025-05-07 17:28:55,569 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2025-05-07 17:28:55,569 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:55,569 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:55,575 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-05-07 17:28:55,769 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:55,769 INFO  L403      AbstractCegarLoop]: === Iteration 26 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:55,769 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:55,770 INFO  L85        PathProgramCache]: Analyzing trace with hash 977853212, now seen corresponding path program 1 times
[2025-05-07 17:28:55,770 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:55,770 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336433147]
[2025-05-07 17:28:55,770 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:55,770 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:55,799 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes.
[2025-05-07 17:28:55,806 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements.
[2025-05-07 17:28:55,806 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:55,806 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:56,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 111 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-05-07 17:28:56,029 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:56,029 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336433147]
[2025-05-07 17:28:56,029 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336433147] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:56,029 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929030521]
[2025-05-07 17:28:56,029 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:56,029 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:56,030 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:56,032 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:56,033 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-05-07 17:28:56,424 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes.
[2025-05-07 17:28:56,602 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements.
[2025-05-07 17:28:56,603 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:56,603 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:56,612 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2527 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:56,616 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:56,752 INFO  L134       CoverageAnalysis]: Checked inductivity of 111 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-05-07 17:28:56,752 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:28:56,752 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [929030521] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:56,752 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:28:56,752 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 21
[2025-05-07 17:28:56,753 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711810127]
[2025-05-07 17:28:56,753 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:56,753 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-05-07 17:28:56,753 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:56,753 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-05-07 17:28:56,753 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420
[2025-05-07 17:28:56,754 INFO  L87              Difference]: Start difference. First operand 191 states and 263 transitions. Second operand  has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (31), 1 states have call predecessors, (31), 12 states have return successors, (33), 13 states have call predecessors, (33), 4 states have call successors, (33)
[2025-05-07 17:28:56,945 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:56,945 INFO  L93              Difference]: Finished difference Result 198 states and 274 transitions.
[2025-05-07 17:28:56,945 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-05-07 17:28:56,945 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (31), 1 states have call predecessors, (31), 12 states have return successors, (33), 13 states have call predecessors, (33), 4 states have call successors, (33) Word has length 156
[2025-05-07 17:28:56,946 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:56,946 INFO  L225             Difference]: With dead ends: 198
[2025-05-07 17:28:56,946 INFO  L226             Difference]: Without dead ends: 198
[2025-05-07 17:28:56,946 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420
[2025-05-07 17:28:56,947 INFO  L437           NwaCegarLoop]: 223 mSDtfsCounter, 1 mSDsluCounter, 2415 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2638 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:56,947 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2638 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:56,947 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2025-05-07 17:28:56,950 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191.
[2025-05-07 17:28:56,950 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 191 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 78 states have internal predecessors, (78), 72 states have call successors, (78), 37 states have call predecessors, (78), 46 states have return successors, (107), 75 states have call predecessors, (107), 72 states have call successors, (107)
[2025-05-07 17:28:56,951 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 263 transitions.
[2025-05-07 17:28:56,951 INFO  L79                 Accepts]: Start accepts. Automaton has 191 states and 263 transitions. Word has length 156
[2025-05-07 17:28:56,951 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:56,951 INFO  L485      AbstractCegarLoop]: Abstraction has 191 states and 263 transitions.
[2025-05-07 17:28:56,951 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 12 states have (on average 4.0) internal successors, (48), 13 states have internal predecessors, (48), 4 states have call successors, (31), 1 states have call predecessors, (31), 12 states have return successors, (33), 13 states have call predecessors, (33), 4 states have call successors, (33)
[2025-05-07 17:28:56,951 INFO  L278                IsEmpty]: Start isEmpty. Operand 191 states and 263 transitions.
[2025-05-07 17:28:56,952 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2025-05-07 17:28:56,952 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:56,952 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:56,958 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-05-07 17:28:57,152 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2025-05-07 17:28:57,153 INFO  L403      AbstractCegarLoop]: === Iteration 27 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:57,154 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:57,154 INFO  L85        PathProgramCache]: Analyzing trace with hash 989397934, now seen corresponding path program 1 times
[2025-05-07 17:28:57,154 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:57,154 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578733791]
[2025-05-07 17:28:57,155 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:57,155 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:57,248 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes.
[2025-05-07 17:28:57,255 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements.
[2025-05-07 17:28:57,255 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:57,255 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:57,559 INFO  L134       CoverageAnalysis]: Checked inductivity of 122 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked.
[2025-05-07 17:28:57,559 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:57,559 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578733791]
[2025-05-07 17:28:57,559 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578733791] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:57,559 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367423695]
[2025-05-07 17:28:57,559 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:57,559 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:57,560 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:57,562 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:57,563 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-05-07 17:28:58,188 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes.
[2025-05-07 17:28:58,513 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements.
[2025-05-07 17:28:58,513 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:58,513 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:58,522 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2957 conjuncts, 14 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:58,525 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:58,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 122 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked.
[2025-05-07 17:28:58,707 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:28:58,707 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [367423695] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:58,707 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:28:58,707 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [10] total 23
[2025-05-07 17:28:58,708 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263094662]
[2025-05-07 17:28:58,708 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:58,708 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-05-07 17:28:58,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:58,709 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-05-07 17:28:58,709 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506
[2025-05-07 17:28:58,709 INFO  L87              Difference]: Start difference. First operand 191 states and 263 transitions. Second operand  has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 4 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (41), 15 states have call predecessors, (41), 4 states have call successors, (41)
[2025-05-07 17:28:58,954 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:58,954 INFO  L93              Difference]: Finished difference Result 202 states and 281 transitions.
[2025-05-07 17:28:58,955 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-05-07 17:28:58,955 INFO  L79                 Accepts]: Start accepts. Automaton has  has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 4 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (41), 15 states have call predecessors, (41), 4 states have call successors, (41) Word has length 180
[2025-05-07 17:28:58,956 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:58,957 INFO  L225             Difference]: With dead ends: 202
[2025-05-07 17:28:58,957 INFO  L226             Difference]: Without dead ends: 202
[2025-05-07 17:28:58,957 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506
[2025-05-07 17:28:58,957 INFO  L437           NwaCegarLoop]: 220 mSDtfsCounter, 1 mSDsluCounter, 2817 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3037 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:58,958 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3037 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:58,958 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 202 states.
[2025-05-07 17:28:58,964 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 195.
[2025-05-07 17:28:58,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 195 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 80 states have internal predecessors, (80), 72 states have call successors, (78), 37 states have call predecessors, (78), 48 states have return successors, (112), 77 states have call predecessors, (112), 72 states have call successors, (112)
[2025-05-07 17:28:58,965 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 270 transitions.
[2025-05-07 17:28:58,965 INFO  L79                 Accepts]: Start accepts. Automaton has 195 states and 270 transitions. Word has length 180
[2025-05-07 17:28:58,965 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:58,966 INFO  L485      AbstractCegarLoop]: Abstraction has 195 states and 270 transitions.
[2025-05-07 17:28:58,966 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 4 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (41), 15 states have call predecessors, (41), 4 states have call successors, (41)
[2025-05-07 17:28:58,966 INFO  L278                IsEmpty]: Start isEmpty. Operand 195 states and 270 transitions.
[2025-05-07 17:28:58,967 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 181
[2025-05-07 17:28:58,967 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:58,967 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:58,974 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-05-07 17:28:59,168 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2025-05-07 17:28:59,168 INFO  L403      AbstractCegarLoop]: === Iteration 28 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:59,169 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:59,170 INFO  L85        PathProgramCache]: Analyzing trace with hash -542036242, now seen corresponding path program 2 times
[2025-05-07 17:28:59,170 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:59,170 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481544913]
[2025-05-07 17:28:59,171 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:28:59,171 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:59,252 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes.
[2025-05-07 17:28:59,287 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 180 of 180 statements.
[2025-05-07 17:28:59,287 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:28:59,287 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:59,658 INFO  L134       CoverageAnalysis]: Checked inductivity of 122 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked.
[2025-05-07 17:28:59,658 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:59,658 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481544913]
[2025-05-07 17:28:59,658 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481544913] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:59,658 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108848508]
[2025-05-07 17:28:59,658 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:28:59,658 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:59,660 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:59,662 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:28:59,662 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-05-07 17:29:00,181 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes.
[2025-05-07 17:29:00,403 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 180 of 180 statements.
[2025-05-07 17:29:00,403 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:29:00,403 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:00,412 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2929 conjuncts, 14 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:00,416 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:00,612 INFO  L134       CoverageAnalysis]: Checked inductivity of 122 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked.
[2025-05-07 17:29:00,612 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:29:00,612 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108848508] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:00,612 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:29:00,612 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [10] total 23
[2025-05-07 17:29:00,612 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044085622]
[2025-05-07 17:29:00,612 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:00,613 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-05-07 17:29:00,613 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:00,613 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-05-07 17:29:00,613 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506
[2025-05-07 17:29:00,613 INFO  L87              Difference]: Start difference. First operand 195 states and 270 transitions. Second operand  has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 4 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (41), 15 states have call predecessors, (41), 4 states have call successors, (41)
[2025-05-07 17:29:00,836 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:00,836 INFO  L93              Difference]: Finished difference Result 200 states and 276 transitions.
[2025-05-07 17:29:00,837 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-05-07 17:29:00,837 INFO  L79                 Accepts]: Start accepts. Automaton has  has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 4 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (41), 15 states have call predecessors, (41), 4 states have call successors, (41) Word has length 180
[2025-05-07 17:29:00,837 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:00,838 INFO  L225             Difference]: With dead ends: 200
[2025-05-07 17:29:00,838 INFO  L226             Difference]: Without dead ends: 200
[2025-05-07 17:29:00,838 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506
[2025-05-07 17:29:00,838 INFO  L437           NwaCegarLoop]: 220 mSDtfsCounter, 1 mSDsluCounter, 2817 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3037 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:00,838 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3037 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:29:00,839 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 200 states.
[2025-05-07 17:29:00,841 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 189.
[2025-05-07 17:29:00,842 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 189 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 77 states have internal predecessors, (77), 72 states have call successors, (78), 37 states have call predecessors, (78), 45 states have return successors, (103), 74 states have call predecessors, (103), 72 states have call successors, (103)
[2025-05-07 17:29:00,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 258 transitions.
[2025-05-07 17:29:00,842 INFO  L79                 Accepts]: Start accepts. Automaton has 189 states and 258 transitions. Word has length 180
[2025-05-07 17:29:00,842 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:00,842 INFO  L485      AbstractCegarLoop]: Abstraction has 189 states and 258 transitions.
[2025-05-07 17:29:00,842 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 4 states have call successors, (33), 1 states have call predecessors, (33), 14 states have return successors, (41), 15 states have call predecessors, (41), 4 states have call successors, (41)
[2025-05-07 17:29:00,843 INFO  L278                IsEmpty]: Start isEmpty. Operand 189 states and 258 transitions.
[2025-05-07 17:29:00,843 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2025-05-07 17:29:00,843 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:00,843 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00,852 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2025-05-07 17:29:01,044 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28
[2025-05-07 17:29:01,044 INFO  L403      AbstractCegarLoop]: === Iteration 29 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:01,045 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:01,045 INFO  L85        PathProgramCache]: Analyzing trace with hash 2143090246, now seen corresponding path program 1 times
[2025-05-07 17:29:01,045 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:01,045 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382092018]
[2025-05-07 17:29:01,046 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:01,046 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:01,127 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-05-07 17:29:01,134 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-05-07 17:29:01,134 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:01,134 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:01,389 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2025-05-07 17:29:01,389 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:01,390 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382092018]
[2025-05-07 17:29:01,390 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382092018] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:01,390 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341891186]
[2025-05-07 17:29:01,390 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:01,390 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:01,392 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:01,394 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:29:01,395 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-05-07 17:29:02,038 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-05-07 17:29:02,252 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-05-07 17:29:02,252 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:02,252 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:02,259 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2446 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:02,261 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:02,302 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked.
[2025-05-07 17:29:02,303 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:29:02,303 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341891186] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:02,303 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:29:02,303 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14
[2025-05-07 17:29:02,303 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139458585]
[2025-05-07 17:29:02,303 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:02,303 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:02,303 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:02,303 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:02,303 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:29:02,304 INFO  L87              Difference]: Start difference. First operand 189 states and 258 transitions. Second operand  has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:29:02,335 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:02,335 INFO  L93              Difference]: Finished difference Result 194 states and 264 transitions.
[2025-05-07 17:29:02,335 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:02,335 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27) Word has length 151
[2025-05-07 17:29:02,336 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:02,336 INFO  L225             Difference]: With dead ends: 194
[2025-05-07 17:29:02,336 INFO  L226             Difference]: Without dead ends: 194
[2025-05-07 17:29:02,336 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:29:02,337 INFO  L437           NwaCegarLoop]: 226 mSDtfsCounter, 1 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:02,337 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1110 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:02,338 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 194 states.
[2025-05-07 17:29:02,342 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 189.
[2025-05-07 17:29:02,343 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 189 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 77 states have internal predecessors, (77), 72 states have call successors, (78), 37 states have call predecessors, (78), 45 states have return successors, (103), 74 states have call predecessors, (103), 72 states have call successors, (103)
[2025-05-07 17:29:02,343 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 258 transitions.
[2025-05-07 17:29:02,343 INFO  L79                 Accepts]: Start accepts. Automaton has 189 states and 258 transitions. Word has length 151
[2025-05-07 17:29:02,343 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:02,344 INFO  L485      AbstractCegarLoop]: Abstraction has 189 states and 258 transitions.
[2025-05-07 17:29:02,344 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:29:02,344 INFO  L278                IsEmpty]: Start isEmpty. Operand 189 states and 258 transitions.
[2025-05-07 17:29:02,344 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 160
[2025-05-07 17:29:02,344 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:02,344 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,351 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2025-05-07 17:29:02,545 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,10 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:02,545 INFO  L403      AbstractCegarLoop]: === Iteration 30 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:02,546 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:02,547 INFO  L85        PathProgramCache]: Analyzing trace with hash 811207632, now seen corresponding path program 1 times
[2025-05-07 17:29:02,547 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:02,547 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63499409]
[2025-05-07 17:29:02,547 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:02,547 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:02,626 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-05-07 17:29:02,638 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-05-07 17:29:02,638 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:02,638 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:02,890 INFO  L134       CoverageAnalysis]: Checked inductivity of 111 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-05-07 17:29:02,890 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:02,891 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63499409]
[2025-05-07 17:29:02,891 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63499409] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:02,891 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961106820]
[2025-05-07 17:29:02,891 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:02,891 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:02,893 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:02,895 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:29:02,895 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-05-07 17:29:03,377 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes.
[2025-05-07 17:29:03,578 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements.
[2025-05-07 17:29:03,578 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:03,578 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:03,586 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2593 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:03,588 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:03,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked.
[2025-05-07 17:29:03,630 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:29:03,630 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961106820] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:03,630 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:29:03,630 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14
[2025-05-07 17:29:03,630 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210153913]
[2025-05-07 17:29:03,630 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:03,631 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:03,631 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:03,631 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:03,631 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:29:03,631 INFO  L87              Difference]: Start difference. First operand 189 states and 258 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, (31), 1 states have call predecessors, (31), 5 states have return successors, (31), 6 states have call predecessors, (31), 4 states have call successors, (31)
[2025-05-07 17:29:03,658 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:03,658 INFO  L93              Difference]: Finished difference Result 194 states and 264 transitions.
[2025-05-07 17:29:03,658 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:03,659 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, (31), 1 states have call predecessors, (31), 5 states have return successors, (31), 6 states have call predecessors, (31), 4 states have call successors, (31) Word has length 159
[2025-05-07 17:29:03,659 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:03,660 INFO  L225             Difference]: With dead ends: 194
[2025-05-07 17:29:03,660 INFO  L226             Difference]: Without dead ends: 194
[2025-05-07 17:29:03,660 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:29:03,661 INFO  L437           NwaCegarLoop]: 226 mSDtfsCounter, 1 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:03,661 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1110 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:03,661 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 194 states.
[2025-05-07 17:29:03,664 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 189.
[2025-05-07 17:29:03,664 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 189 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 77 states have internal predecessors, (77), 72 states have call successors, (78), 37 states have call predecessors, (78), 45 states have return successors, (103), 74 states have call predecessors, (103), 72 states have call successors, (103)
[2025-05-07 17:29:03,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 258 transitions.
[2025-05-07 17:29:03,665 INFO  L79                 Accepts]: Start accepts. Automaton has 189 states and 258 transitions. Word has length 159
[2025-05-07 17:29:03,665 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:03,665 INFO  L485      AbstractCegarLoop]: Abstraction has 189 states and 258 transitions.
[2025-05-07 17:29:03,665 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, (31), 1 states have call predecessors, (31), 5 states have return successors, (31), 6 states have call predecessors, (31), 4 states have call successors, (31)
[2025-05-07 17:29:03,665 INFO  L278                IsEmpty]: Start isEmpty. Operand 189 states and 258 transitions.
[2025-05-07 17:29:03,666 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2025-05-07 17:29:03,666 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:03,666 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,672 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2025-05-07 17:29:03,866 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,11 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:03,866 INFO  L403      AbstractCegarLoop]: === Iteration 31 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:03,868 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:03,868 INFO  L85        PathProgramCache]: Analyzing trace with hash -2137075470, now seen corresponding path program 1 times
[2025-05-07 17:29:03,868 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:03,868 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311755547]
[2025-05-07 17:29:03,869 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:03,869 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:03,942 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-05-07 17:29:03,953 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-05-07 17:29:03,953 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:03,953 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:04,194 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2025-05-07 17:29:04,194 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:04,194 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311755547]
[2025-05-07 17:29:04,194 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311755547] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:04,194 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869164536]
[2025-05-07 17:29:04,194 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:04,194 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:04,196 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:04,198 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:29:04,198 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-05-07 17:29:04,740 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-05-07 17:29:04,918 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-05-07 17:29:04,919 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:04,919 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:04,925 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2454 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:04,927 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:04,973 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked.
[2025-05-07 17:29:04,974 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:29:04,974 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [869164536] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:04,974 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:29:04,974 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14
[2025-05-07 17:29:04,974 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530954970]
[2025-05-07 17:29:04,974 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:04,974 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:04,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:04,975 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:04,975 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:29:04,975 INFO  L87              Difference]: Start difference. First operand 189 states and 258 transitions. Second operand  has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:29:04,998 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:04,998 INFO  L93              Difference]: Finished difference Result 194 states and 264 transitions.
[2025-05-07 17:29:04,999 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:04,999 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27) Word has length 151
[2025-05-07 17:29:04,999 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:05,000 INFO  L225             Difference]: With dead ends: 194
[2025-05-07 17:29:05,000 INFO  L226             Difference]: Without dead ends: 194
[2025-05-07 17:29:05,000 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:29:05,000 INFO  L437           NwaCegarLoop]: 226 mSDtfsCounter, 1 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:05,000 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1110 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:05,001 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 194 states.
[2025-05-07 17:29:05,003 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 189.
[2025-05-07 17:29:05,003 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 189 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 77 states have internal predecessors, (77), 72 states have call successors, (78), 37 states have call predecessors, (78), 45 states have return successors, (103), 74 states have call predecessors, (103), 72 states have call successors, (103)
[2025-05-07 17:29:05,004 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 258 transitions.
[2025-05-07 17:29:05,004 INFO  L79                 Accepts]: Start accepts. Automaton has 189 states and 258 transitions. Word has length 151
[2025-05-07 17:29:05,004 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:05,004 INFO  L485      AbstractCegarLoop]: Abstraction has 189 states and 258 transitions.
[2025-05-07 17:29:05,004 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:29:05,004 INFO  L278                IsEmpty]: Start isEmpty. Operand 189 states and 258 transitions.
[2025-05-07 17:29:05,005 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2025-05-07 17:29:05,005 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:05,005 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,012 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2025-05-07 17:29:05,205 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,12 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:05,206 INFO  L403      AbstractCegarLoop]: === Iteration 32 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:05,206 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:05,207 INFO  L85        PathProgramCache]: Analyzing trace with hash 548332469, now seen corresponding path program 2 times
[2025-05-07 17:29:05,207 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:05,207 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207900126]
[2025-05-07 17:29:05,207 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:29:05,207 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:05,288 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes.
[2025-05-07 17:29:05,305 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 147 of 147 statements.
[2025-05-07 17:29:05,305 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:29:05,306 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:05,539 INFO  L134       CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2025-05-07 17:29:05,539 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:05,539 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207900126]
[2025-05-07 17:29:05,540 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207900126] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:05,540 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176989561]
[2025-05-07 17:29:05,540 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:29:05,540 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:05,542 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:05,543 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:29:05,544 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2025-05-07 17:29:06,175 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 147 statements into 2 equivalence classes.
[2025-05-07 17:29:06,408 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 147 of 147 statements.
[2025-05-07 17:29:06,408 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:29:06,408 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:06,415 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2340 conjuncts, 14 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:06,417 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:06,450 INFO  L134       CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2025-05-07 17:29:06,450 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:29:09,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2025-05-07 17:29:09,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [176989561] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:29:09,717 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:29:09,717 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 16
[2025-05-07 17:29:09,717 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486522923]
[2025-05-07 17:29:09,717 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:29:09,718 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-05-07 17:29:09,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:09,718 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-05-07 17:29:09,718 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240
[2025-05-07 17:29:09,718 INFO  L87              Difference]: Start difference. First operand 189 states and 258 transitions. Second operand  has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 6 states have call successors, (35), 1 states have call predecessors, (35), 14 states have return successors, (39), 16 states have call predecessors, (39), 6 states have call successors, (39)
[2025-05-07 17:29:09,958 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:09,958 INFO  L93              Difference]: Finished difference Result 202 states and 284 transitions.
[2025-05-07 17:29:09,959 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-05-07 17:29:09,959 INFO  L79                 Accepts]: Start accepts. Automaton has  has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 6 states have call successors, (35), 1 states have call predecessors, (35), 14 states have return successors, (39), 16 states have call predecessors, (39), 6 states have call successors, (39) Word has length 147
[2025-05-07 17:29:09,959 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:09,960 INFO  L225             Difference]: With dead ends: 202
[2025-05-07 17:29:09,960 INFO  L226             Difference]: Without dead ends: 202
[2025-05-07 17:29:09,960 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 282 SyntacticMatches, 12 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240
[2025-05-07 17:29:09,960 INFO  L437           NwaCegarLoop]: 221 mSDtfsCounter, 1 mSDsluCounter, 3044 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3265 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:09,961 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3265 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:29:09,962 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 202 states.
[2025-05-07 17:29:09,965 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197.
[2025-05-07 17:29:09,965 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 197 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 80 states have internal predecessors, (80), 74 states have call successors, (80), 37 states have call predecessors, (80), 48 states have return successors, (118), 79 states have call predecessors, (118), 74 states have call successors, (118)
[2025-05-07 17:29:09,966 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 278 transitions.
[2025-05-07 17:29:09,966 INFO  L79                 Accepts]: Start accepts. Automaton has 197 states and 278 transitions. Word has length 147
[2025-05-07 17:29:09,966 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:09,966 INFO  L485      AbstractCegarLoop]: Abstraction has 197 states and 278 transitions.
[2025-05-07 17:29:09,966 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 16 states have internal predecessors, (57), 6 states have call successors, (35), 1 states have call predecessors, (35), 14 states have return successors, (39), 16 states have call predecessors, (39), 6 states have call successors, (39)
[2025-05-07 17:29:09,966 INFO  L278                IsEmpty]: Start isEmpty. Operand 197 states and 278 transitions.
[2025-05-07 17:29:09,967 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2025-05-07 17:29:09,967 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:09,967 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,974 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2025-05-07 17:29:10,167 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,13 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:10,168 INFO  L403      AbstractCegarLoop]: === Iteration 33 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:10,168 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:10,169 INFO  L85        PathProgramCache]: Analyzing trace with hash 1667621611, now seen corresponding path program 1 times
[2025-05-07 17:29:10,169 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:10,169 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946245046]
[2025-05-07 17:29:10,169 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:10,169 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:10,240 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-05-07 17:29:10,247 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-05-07 17:29:10,247 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:10,247 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:10,574 INFO  L134       CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2025-05-07 17:29:10,574 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:10,574 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946245046]
[2025-05-07 17:29:10,574 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946245046] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:10,574 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883681983]
[2025-05-07 17:29:10,574 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:10,574 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:10,576 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:10,578 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:29:10,579 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2025-05-07 17:29:11,256 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-05-07 17:29:11,421 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-05-07 17:29:11,421 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:11,421 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:11,428 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2354 conjuncts, 14 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:11,430 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:11,601 INFO  L134       CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2025-05-07 17:29:11,601 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:29:15,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2025-05-07 17:29:15,299 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883681983] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:29:15,299 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:29:15,299 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 28
[2025-05-07 17:29:15,299 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914721089]
[2025-05-07 17:29:15,299 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:29:15,299 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2025-05-07 17:29:15,299 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:15,300 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2025-05-07 17:29:15,300 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756
[2025-05-07 17:29:15,300 INFO  L87              Difference]: Start difference. First operand 197 states and 278 transitions. Second operand  has 28 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 28 states have internal predecessors, (73), 10 states have call successors, (44), 1 states have call predecessors, (44), 24 states have return successors, (57), 27 states have call predecessors, (57), 10 states have call successors, (57)
[2025-05-07 17:29:15,651 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:15,652 INFO  L93              Difference]: Finished difference Result 186 states and 262 transitions.
[2025-05-07 17:29:15,652 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-05-07 17:29:15,652 INFO  L79                 Accepts]: Start accepts. Automaton has  has 28 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 28 states have internal predecessors, (73), 10 states have call successors, (44), 1 states have call predecessors, (44), 24 states have return successors, (57), 27 states have call predecessors, (57), 10 states have call successors, (57) Word has length 147
[2025-05-07 17:29:15,652 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:15,652 INFO  L225             Difference]: With dead ends: 186
[2025-05-07 17:29:15,652 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:29:15,653 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 270 SyntacticMatches, 12 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=1311, Unknown=0, NotChecked=0, Total=1406
[2025-05-07 17:29:15,653 INFO  L437           NwaCegarLoop]: 212 mSDtfsCounter, 2 mSDsluCounter, 5422 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5634 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:15,653 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5634 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:29:15,653 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:29:15,653 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:29:15,653 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:15,653 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:29:15,653 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 147
[2025-05-07 17:29:15,653 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:15,653 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:29:15,654 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 28 states have internal predecessors, (73), 10 states have call successors, (44), 1 states have call predecessors, (44), 24 states have return successors, (57), 27 states have call predecessors, (57), 10 states have call successors, (57)
[2025-05-07 17:29:15,654 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:29:15,654 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:29:15,655 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:29:15,663 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2025-05-07 17:29:15,856 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33
[2025-05-07 17:29:15,865 INFO  L422         BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 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:15,871 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:29:15,877 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:29:15 BoogieIcfgContainer
[2025-05-07 17:29:15,878 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:29:15,879 INFO  L158              Benchmark]: Toolchain (without parser) took 42417.42ms. Allocated memory was 234.9MB in the beginning and 536.9MB in the end (delta: 302.0MB). Free memory was 194.1MB in the beginning and 326.6MB in the end (delta: -132.5MB). Peak memory consumption was 156.0MB. Max. memory is 33.6GB.
[2025-05-07 17:29:15,880 INFO  L158              Benchmark]: SmtParser took 0.27ms. Allocated memory is still 234.9MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:15,880 INFO  L158              Benchmark]: ChcToBoogie took 42.84ms. Allocated memory is still 234.9MB. Free memory was 194.1MB in the beginning and 187.9MB in the end (delta: 6.2MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:15,880 INFO  L158              Benchmark]: Boogie Preprocessor took 70.72ms. Allocated memory is still 234.9MB. Free memory was 187.9MB in the beginning and 182.9MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:15,881 INFO  L158              Benchmark]: RCFGBuilder took 669.89ms. Allocated memory was 234.9MB in the beginning and 302.0MB in the end (delta: 67.1MB). Free memory was 182.9MB in the beginning and 234.9MB in the end (delta: -52.0MB). Peak memory consumption was 92.2MB. Max. memory is 33.6GB.
[2025-05-07 17:29:15,881 INFO  L158              Benchmark]: TraceAbstraction took 41630.70ms. Allocated memory was 302.0MB in the beginning and 536.9MB in the end (delta: 234.9MB). Free memory was 234.0MB in the beginning and 326.6MB in the end (delta: -92.6MB). Peak memory consumption was 131.4MB. Max. memory is 33.6GB.
[2025-05-07 17:29:15,883 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.27ms. Allocated memory is still 234.9MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 42.84ms. Allocated memory is still 234.9MB. Free memory was 194.1MB in the beginning and 187.9MB in the end (delta: 6.2MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 70.72ms. Allocated memory is still 234.9MB. Free memory was 187.9MB in the beginning and 182.9MB in the end (delta: 5.0MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 669.89ms. Allocated memory was 234.9MB in the beginning and 302.0MB in the end (delta: 67.1MB). Free memory was 182.9MB in the beginning and 234.9MB in the end (delta: -52.0MB). Peak memory consumption was 92.2MB. Max. memory is 33.6GB.
 * TraceAbstraction took 41630.70ms. Allocated memory was 302.0MB in the beginning and 536.9MB in the end (delta: 234.9MB). Free memory was 234.0MB in the beginning and 326.6MB in the end (delta: -92.6MB). Peak memory consumption was 131.4MB. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Unknown line] : the set of constraint Horn clauses is satisfiable
    For all program executions holds that the set of constraint Horn clauses is satisfiable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 40 procedures, 192 locations, 351 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.6s, OverallIterations: 33, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 81143 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73382 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7331 IncrementalHoareTripleChecker+Invalid, 7345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 7761 mSDtfsCounter, 7331 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2946 GetRequests, 2471 SyntacticMatches, 42 SemanticMatches, 433 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred in iteration=12, InterpolantAutomatonStates: 356, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 33 MinimizatonAttempts, 115 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.8s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 20.5s InterpolantComputationTime, 5909 NumberOfCodeBlocks, 5909 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 6439 ConstructedInterpolants, 0 QuantifiedInterpolants, 8664 SizeOfPredicates, 1 NumberOfNonLiveVariables, 31926 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 50 InterpolantComputations, 29 PerfectInterpolantSequences, 2432/2744 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:15,906 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
