./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/blockchain_state/this_does_not_change_external_call.sol_1_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:29:10,587 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:29:10,625 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_777c973e-a546-470c-b574-f39fff793505/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:29:10,628 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:29:10,628 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:29:10,641 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:29:10,642 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:29:10,642 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:29:10,642 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:29:10,642 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:29:10,642 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:29:10,642 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:29:10,642 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:29:10,642 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:29:10,643 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:29:10,643 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:29:10,643 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:29:10,643 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:29:10,643 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:29:10,643 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:29:10,643 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:29:10,643 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:29:10,643 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:29:10,643 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:29:10,643 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:29:10,644 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:29:10,644 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:29:10,826 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:29:10,832 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:29:10,834 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:29:10,835 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:29:10,835 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:29:10,836 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_777c973e-a546-470c-b574-f39fff793505/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/blockchain_state/this_does_not_change_external_call.sol_1_no_adts_000.smt2
[2025-05-07 17:29:10,836 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:29:10,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:29:11,051 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_777c973e-a546-470c-b574-f39fff793505/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/blockchain_state/this_does_not_change_external_call.sol_1_no_adts_000.smt2
[2025-05-07 17:29:11,054 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:29:11,055 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:29:11,056 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:29:11,056 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:29:11,056 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:29:11,058 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:29:11" (1/1) ...
[2025-05-07 17:29:11,096 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:11 Unit
[2025-05-07 17:29:11,096 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:29:11,097 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:29:11,097 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:29:11,097 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:29:11,108 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:11" (1/1) ...
[2025-05-07 17:29:11,108 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:11" (1/1) ...
[2025-05-07 17:29:11,128 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:11" (1/1) ...
[2025-05-07 17:29:11,128 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:11" (1/1) ...
[2025-05-07 17:29:11,132 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:11" (1/1) ...
[2025-05-07 17:29:11,133 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:11" (1/1) ...
[2025-05-07 17:29:11,134 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:11" (1/1) ...
[2025-05-07 17:29:11,136 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:11" (1/1) ...
[2025-05-07 17:29:11,137 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:11" (1/1) ...
[2025-05-07 17:29:11,146 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:29:11,147 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:29:11,147 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:29:11,147 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:29:11,147 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:11" (1/1) ...
[2025-05-07 17:29:11,149 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:29:11,157 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:11,165 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-05-07 17:29:11,167 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:29:11,174 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:29:11,174 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:29:11,174 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:29:11,174 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_4_0 given in one single declaration
[2025-05-07 17:29:11,175 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_4_0
[2025-05-07 17:29:11,175 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_4_0
[2025-05-07 17:29:11,175 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_10_function_f__51_52_0 given in one single declaration
[2025-05-07 17:29:11,175 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_10_function_f__51_52_0
[2025-05-07 17:29:11,175 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_10_function_f__51_52_0
[2025-05-07 17:29:11,175 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_9_function_f__51_52_0 given in one single declaration
[2025-05-07 17:29:11,175 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_9_function_f__51_52_0
[2025-05-07 17:29:11,175 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_9_function_f__51_52_0
[2025-05-07 17:29:11,175 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_20_function_f__51_52_0 given in one single declaration
[2025-05-07 17:29:11,175 INFO  L130     BoogieDeclarations]: Found specification of procedure block_20_function_f__51_52_0
[2025-05-07 17:29:11,175 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_20_function_f__51_52_0
[2025-05-07 17:29:11,175 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_17_return_function_f__51_52_0 given in one single declaration
[2025-05-07 17:29:11,175 INFO  L130     BoogieDeclarations]: Found specification of procedure block_17_return_function_f__51_52_0
[2025-05-07 17:29:11,175 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_17_return_function_f__51_52_0
[2025-05-07 17:29:11,175 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_19_function_f__51_52_0 given in one single declaration
[2025-05-07 17:29:11,175 INFO  L130     BoogieDeclarations]: Found specification of procedure block_19_function_f__51_52_0
[2025-05-07 17:29:11,175 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_19_function_f__51_52_0
[2025-05-07 17:29:11,175 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure nondet_call_18_0 given in one single declaration
[2025-05-07 17:29:11,175 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_call_18_0
[2025-05-07 17:29:11,175 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_call_18_0
[2025-05-07 17:29:11,176 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure nondet_interface_6_C_52_0 given in one single declaration
[2025-05-07 17:29:11,176 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_interface_6_C_52_0
[2025-05-07 17:29:11,176 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_interface_6_C_52_0
[2025-05-07 17:29:11,176 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_16_f_50_52_0 given in one single declaration
[2025-05-07 17:29:11,176 INFO  L130     BoogieDeclarations]: Found specification of procedure block_16_f_50_52_0
[2025-05-07 17:29:11,176 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_16_f_50_52_0
[2025-05-07 17:29:11,176 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_15_function_f__51_52_0 given in one single declaration
[2025-05-07 17:29:11,176 INFO  L130     BoogieDeclarations]: Found specification of procedure block_15_function_f__51_52_0
[2025-05-07 17:29:11,176 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_15_function_f__51_52_0
[2025-05-07 17:29:11,176 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_21_function_f__51_52_0 given in one single declaration
[2025-05-07 17:29:11,176 INFO  L130     BoogieDeclarations]: Found specification of procedure block_21_function_f__51_52_0
[2025-05-07 17:29:11,176 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_21_function_f__51_52_0
[2025-05-07 17:29:11,176 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_5_C_52_0 given in one single declaration
[2025-05-07 17:29:11,176 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_5_C_52_0
[2025-05-07 17:29:11,176 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_5_C_52_0
[2025-05-07 17:29:11,176 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_7_C_52_0 given in one single declaration
[2025-05-07 17:29:11,176 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_7_C_52_0
[2025-05-07 17:29:11,176 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_7_C_52_0
[2025-05-07 17:29:11,176 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_25_C_52_0 given in one single declaration
[2025-05-07 17:29:11,177 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_25_C_52_0
[2025-05-07 17:29:11,177 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_25_C_52_0
[2025-05-07 17:29:11,177 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_27_C_52_0 given in one single declaration
[2025-05-07 17:29:11,177 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_27_C_52_0
[2025-05-07 17:29:11,177 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_27_C_52_0
[2025-05-07 17:29:11,177 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_26_C_52_0 given in one single declaration
[2025-05-07 17:29:11,177 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_26_C_52_0
[2025-05-07 17:29:11,177 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_26_C_52_0
[2025-05-07 17:29:11,177 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_8_constructor_17_52_0 given in one single declaration
[2025-05-07 17:29:11,177 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_8_constructor_17_52_0
[2025-05-07 17:29:11,177 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_8_constructor_17_52_0
[2025-05-07 17:29:11,177 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_24_return_constructor_17_52_0 given in one single declaration
[2025-05-07 17:29:11,177 INFO  L130     BoogieDeclarations]: Found specification of procedure block_24_return_constructor_17_52_0
[2025-05-07 17:29:11,177 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_24_return_constructor_17_52_0
[2025-05-07 17:29:11,177 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_23__16_52_0 given in one single declaration
[2025-05-07 17:29:11,177 INFO  L130     BoogieDeclarations]: Found specification of procedure block_23__16_52_0
[2025-05-07 17:29:11,177 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_23__16_52_0
[2025-05-07 17:29:11,177 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_22_constructor_17_52_0 given in one single declaration
[2025-05-07 17:29:11,177 INFO  L130     BoogieDeclarations]: Found specification of procedure block_22_constructor_17_52_0
[2025-05-07 17:29:11,177 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_22_constructor_17_52_0
[2025-05-07 17:29:11,177 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_28_C_52_0 given in one single declaration
[2025-05-07 17:29:11,178 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_28_C_52_0
[2025-05-07 17:29:11,178 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_28_C_52_0
[2025-05-07 17:29:11,178 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:29:11,178 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:29:11,178 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:29:11,302 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:29:11,303 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:29:11,508 INFO  L?                        ?]: Removed 175 outVars from TransFormulas that were not future-live.
[2025-05-07 17:29:11,508 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:29:11,517 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:29:11,517 INFO  L312             CfgBuilder]: Removed 10 assume(true) statements.
[2025-05-07 17:29:11,517 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:29:11 BoogieIcfgContainer
[2025-05-07 17:29:11,517 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:29:11,519 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:29:11,519 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:29:11,521 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:29:11,521 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:29:11" (1/3) ...
[2025-05-07 17:29:11,522 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58363f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:29:11, skipping insertion in model container
[2025-05-07 17:29:11,522 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:11" (2/3) ...
[2025-05-07 17:29:11,522 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58363f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:29:11, skipping insertion in model container
[2025-05-07 17:29:11,522 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:29:11" (3/3) ...
[2025-05-07 17:29:11,523 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:29:11,533 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:29:11,535 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 23 procedures, 96 locations, 152 edges, 23 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:29:11,563 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:29:11,571 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;@5354a137, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:29:11,571 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:29:11,574 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 96 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 44 states have internal predecessors, (44), 34 states have call successors, (36), 22 states have call predecessors, (36), 22 states have return successors, (36), 30 states have call predecessors, (36), 34 states have call successors, (36)
[2025-05-07 17:29:11,580 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2025-05-07 17:29:11,581 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:11,581 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]
[2025-05-07 17:29:11,581 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:11,585 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:11,585 INFO  L85        PathProgramCache]: Analyzing trace with hash -1237083810, now seen corresponding path program 1 times
[2025-05-07 17:29:11,590 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:11,590 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028369504]
[2025-05-07 17:29:11,590 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:11,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:11,637 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes.
[2025-05-07 17:29:11,667 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements.
[2025-05-07 17:29:11,667 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:11,668 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:11,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:11,841 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:11,841 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028369504]
[2025-05-07 17:29:11,842 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028369504] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:11,842 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:11,844 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:11,845 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104403340]
[2025-05-07 17:29:11,846 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:11,848 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:11,848 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:11,877 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:11,877 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:11,879 INFO  L87              Difference]: Start difference. First operand  has 96 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 44 states have internal predecessors, (44), 34 states have call successors, (36), 22 states have call predecessors, (36), 22 states have return successors, (36), 30 states have call predecessors, (36), 34 states have call successors, (36) Second operand  has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 4 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:29:11,943 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:11,943 INFO  L93              Difference]: Finished difference Result 98 states and 118 transitions.
[2025-05-07 17:29:11,945 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:11,946 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 4 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 70
[2025-05-07 17:29:11,946 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:11,952 INFO  L225             Difference]: With dead ends: 98
[2025-05-07 17:29:11,952 INFO  L226             Difference]: Without dead ends: 98
[2025-05-07 17:29:11,954 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:11,956 INFO  L437           NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:11,957 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 335 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:11,967 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2025-05-07 17:29:11,986 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96.
[2025-05-07 17:29:11,987 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 43 states have internal predecessors, (43), 34 states have call successors, (36), 22 states have call predecessors, (36), 23 states have return successors, (37), 31 states have call predecessors, (37), 34 states have call successors, (37)
[2025-05-07 17:29:11,990 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions.
[2025-05-07 17:29:11,991 INFO  L79                 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 70
[2025-05-07 17:29:11,991 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:11,991 INFO  L485      AbstractCegarLoop]: Abstraction has 96 states and 116 transitions.
[2025-05-07 17:29:11,991 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 4 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:29:11,991 INFO  L278                IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions.
[2025-05-07 17:29:11,993 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2025-05-07 17:29:11,993 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:11,993 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]
[2025-05-07 17:29:11,994 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:29:11,994 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:11,994 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:11,994 INFO  L85        PathProgramCache]: Analyzing trace with hash -130541222, now seen corresponding path program 1 times
[2025-05-07 17:29:11,994 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:11,994 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514941330]
[2025-05-07 17:29:11,995 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:11,995 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:12,030 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes.
[2025-05-07 17:29:12,036 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements.
[2025-05-07 17:29:12,036 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:12,036 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:12,130 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:12,131 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:12,131 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514941330]
[2025-05-07 17:29:12,131 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514941330] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:12,131 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:12,131 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:12,131 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702477878]
[2025-05-07 17:29:12,131 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:12,132 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:12,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:12,133 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:12,133 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:12,133 INFO  L87              Difference]: Start difference. First operand 96 states and 116 transitions. Second operand  has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 4 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:29:12,151 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:12,151 INFO  L93              Difference]: Finished difference Result 98 states and 117 transitions.
[2025-05-07 17:29:12,151 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:12,152 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 4 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 70
[2025-05-07 17:29:12,152 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:12,153 INFO  L225             Difference]: With dead ends: 98
[2025-05-07 17:29:12,153 INFO  L226             Difference]: Without dead ends: 90
[2025-05-07 17:29:12,153 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:12,154 INFO  L437           NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:12,154 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 333 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:12,155 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 90 states.
[2025-05-07 17:29:12,161 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90.
[2025-05-07 17:29:12,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 90 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 40 states have internal predecessors, (40), 30 states have call successors, (32), 22 states have call predecessors, (32), 22 states have return successors, (32), 28 states have call predecessors, (32), 30 states have call successors, (32)
[2025-05-07 17:29:12,163 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions.
[2025-05-07 17:29:12,163 INFO  L79                 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 70
[2025-05-07 17:29:12,163 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:12,163 INFO  L485      AbstractCegarLoop]: Abstraction has 90 states and 104 transitions.
[2025-05-07 17:29:12,163 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 4 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:29:12,163 INFO  L278                IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions.
[2025-05-07 17:29:12,165 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 71
[2025-05-07 17:29:12,165 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:12,165 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]
[2025-05-07 17:29:12,165 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:29:12,165 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:12,166 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:12,166 INFO  L85        PathProgramCache]: Analyzing trace with hash -51877286, now seen corresponding path program 1 times
[2025-05-07 17:29:12,166 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:12,166 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419068930]
[2025-05-07 17:29:12,166 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:12,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:12,196 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes.
[2025-05-07 17:29:12,215 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements.
[2025-05-07 17:29:12,216 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:12,216 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:12,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:12,291 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:12,291 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419068930]
[2025-05-07 17:29:12,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419068930] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:12,292 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:12,292 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:29:12,292 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399648690]
[2025-05-07 17:29:12,292 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:12,292 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:29:12,292 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:12,293 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:29:12,293 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:29:12,293 INFO  L87              Difference]: Start difference. First operand 90 states and 104 transitions. Second operand  has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 4 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19)
[2025-05-07 17:29:12,344 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:12,344 INFO  L93              Difference]: Finished difference Result 96 states and 113 transitions.
[2025-05-07 17:29:12,345 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:29:12,345 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 4 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19) Word has length 70
[2025-05-07 17:29:12,345 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:12,346 INFO  L225             Difference]: With dead ends: 96
[2025-05-07 17:29:12,346 INFO  L226             Difference]: Without dead ends: 96
[2025-05-07 17:29:12,346 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:29:12,347 INFO  L437           NwaCegarLoop]: 100 mSDtfsCounter, 1 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:12,347 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 389 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:12,348 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2025-05-07 17:29:12,353 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94.
[2025-05-07 17:29:12,353 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 30 states have call successors, (32), 22 states have call predecessors, (32), 24 states have return successors, (37), 29 states have call predecessors, (37), 30 states have call successors, (37)
[2025-05-07 17:29:12,354 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions.
[2025-05-07 17:29:12,354 INFO  L79                 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 70
[2025-05-07 17:29:12,354 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:12,354 INFO  L485      AbstractCegarLoop]: Abstraction has 94 states and 111 transitions.
[2025-05-07 17:29:12,355 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 2 states have call successors, (19), 1 states have call predecessors, (19), 4 states have return successors, (19), 4 states have call predecessors, (19), 2 states have call successors, (19)
[2025-05-07 17:29:12,355 INFO  L278                IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions.
[2025-05-07 17:29:12,356 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2025-05-07 17:29:12,356 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:12,356 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:29:12,356 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:29:12,356 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:12,357 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:12,357 INFO  L85        PathProgramCache]: Analyzing trace with hash -52977683, now seen corresponding path program 1 times
[2025-05-07 17:29:12,357 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:12,357 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573034490]
[2025-05-07 17:29:12,357 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:12,357 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:12,384 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes.
[2025-05-07 17:29:12,407 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements.
[2025-05-07 17:29:12,407 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:12,408 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:12,544 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:12,544 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:12,544 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573034490]
[2025-05-07 17:29:12,544 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573034490] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:12,544 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:12,544 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:29:12,544 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615630345]
[2025-05-07 17:29:12,544 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:12,544 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:12,545 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:12,545 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:12,545 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:12,545 INFO  L87              Difference]: Start difference. First operand 94 states and 111 transitions. Second operand  has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (20), 1 states have call predecessors, (20), 5 states have return successors, (20), 6 states have call predecessors, (20), 3 states have call successors, (20)
[2025-05-07 17:29:12,594 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:12,594 INFO  L93              Difference]: Finished difference Result 98 states and 116 transitions.
[2025-05-07 17:29:12,595 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:12,595 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (20), 1 states have call predecessors, (20), 5 states have return successors, (20), 6 states have call predecessors, (20), 3 states have call successors, (20) Word has length 73
[2025-05-07 17:29:12,595 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:12,596 INFO  L225             Difference]: With dead ends: 98
[2025-05-07 17:29:12,596 INFO  L226             Difference]: Without dead ends: 98
[2025-05-07 17:29:12,596 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:12,597 INFO  L437           NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:12,597 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 509 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:12,597 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2025-05-07 17:29:12,601 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98.
[2025-05-07 17:29:12,602 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 44 states have internal predecessors, (44), 30 states have call successors, (32), 22 states have call predecessors, (32), 26 states have return successors, (40), 31 states have call predecessors, (40), 30 states have call successors, (40)
[2025-05-07 17:29:12,602 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 116 transitions.
[2025-05-07 17:29:12,603 INFO  L79                 Accepts]: Start accepts. Automaton has 98 states and 116 transitions. Word has length 73
[2025-05-07 17:29:12,603 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:12,603 INFO  L485      AbstractCegarLoop]: Abstraction has 98 states and 116 transitions.
[2025-05-07 17:29:12,603 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (20), 1 states have call predecessors, (20), 5 states have return successors, (20), 6 states have call predecessors, (20), 3 states have call successors, (20)
[2025-05-07 17:29:12,603 INFO  L278                IsEmpty]: Start isEmpty. Operand 98 states and 116 transitions.
[2025-05-07 17:29:12,605 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2025-05-07 17:29:12,605 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:12,605 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:29:12,605 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:29:12,605 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:12,605 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:12,605 INFO  L85        PathProgramCache]: Analyzing trace with hash -366363571, now seen corresponding path program 1 times
[2025-05-07 17:29:12,605 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:12,605 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491583427]
[2025-05-07 17:29:12,605 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:12,605 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:12,632 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes.
[2025-05-07 17:29:12,647 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements.
[2025-05-07 17:29:12,647 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:12,647 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:13,145 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:13,145 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:13,145 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491583427]
[2025-05-07 17:29:13,145 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491583427] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:13,145 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:13,146 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17
[2025-05-07 17:29:13,146 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457712792]
[2025-05-07 17:29:13,146 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:13,146 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-05-07 17:29:13,146 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:13,147 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-05-07 17:29:13,148 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272
[2025-05-07 17:29:13,148 INFO  L87              Difference]: Start difference. First operand 98 states and 116 transitions. Second operand  has 17 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (20), 1 states have call predecessors, (20), 13 states have return successors, (20), 15 states have call predecessors, (20), 8 states have call successors, (20)
[2025-05-07 17:29:13,482 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:13,483 INFO  L93              Difference]: Finished difference Result 109 states and 131 transitions.
[2025-05-07 17:29:13,483 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-05-07 17:29:13,483 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (20), 1 states have call predecessors, (20), 13 states have return successors, (20), 15 states have call predecessors, (20), 8 states have call successors, (20) Word has length 73
[2025-05-07 17:29:13,483 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:13,485 INFO  L225             Difference]: With dead ends: 109
[2025-05-07 17:29:13,485 INFO  L226             Difference]: Without dead ends: 109
[2025-05-07 17:29:13,485 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342
[2025-05-07 17:29:13,486 INFO  L437           NwaCegarLoop]: 87 mSDtfsCounter, 4 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:13,486 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1341 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:29:13,487 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 109 states.
[2025-05-07 17:29:13,498 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107.
[2025-05-07 17:29:13,498 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 107 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 31 states have call successors, (33), 22 states have call predecessors, (33), 30 states have return successors, (48), 36 states have call predecessors, (48), 31 states have call successors, (48)
[2025-05-07 17:29:13,499 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions.
[2025-05-07 17:29:13,500 INFO  L79                 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 73
[2025-05-07 17:29:13,500 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:13,500 INFO  L485      AbstractCegarLoop]: Abstraction has 107 states and 129 transitions.
[2025-05-07 17:29:13,500 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 15 states have internal predecessors, (33), 8 states have call successors, (20), 1 states have call predecessors, (20), 13 states have return successors, (20), 15 states have call predecessors, (20), 8 states have call successors, (20)
[2025-05-07 17:29:13,500 INFO  L278                IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions.
[2025-05-07 17:29:13,502 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2025-05-07 17:29:13,502 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:13,502 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:29:13,502 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:29:13,502 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:13,503 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:13,503 INFO  L85        PathProgramCache]: Analyzing trace with hash -1645302995, now seen corresponding path program 1 times
[2025-05-07 17:29:13,503 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:13,503 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975059515]
[2025-05-07 17:29:13,503 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:13,503 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:13,526 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes.
[2025-05-07 17:29:13,537 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements.
[2025-05-07 17:29:13,537 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:13,538 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:13,608 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:13,609 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:13,609 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975059515]
[2025-05-07 17:29:13,609 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975059515] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:13,609 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:13,609 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:29:13,609 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520252905]
[2025-05-07 17:29:13,609 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:13,609 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:13,609 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:13,610 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:13,610 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:13,610 INFO  L87              Difference]: Start difference. First operand 107 states and 129 transitions. Second operand  has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (20), 1 states have call predecessors, (20), 5 states have return successors, (20), 6 states have call predecessors, (20), 3 states have call successors, (20)
[2025-05-07 17:29:13,647 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:13,647 INFO  L93              Difference]: Finished difference Result 111 states and 134 transitions.
[2025-05-07 17:29:13,647 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:13,648 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (20), 1 states have call predecessors, (20), 5 states have return successors, (20), 6 states have call predecessors, (20), 3 states have call successors, (20) Word has length 73
[2025-05-07 17:29:13,648 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:13,649 INFO  L225             Difference]: With dead ends: 111
[2025-05-07 17:29:13,649 INFO  L226             Difference]: Without dead ends: 111
[2025-05-07 17:29:13,649 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:13,649 INFO  L437           NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:13,650 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 509 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:13,650 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 111 states.
[2025-05-07 17:29:13,656 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107.
[2025-05-07 17:29:13,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 107 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 31 states have call successors, (33), 22 states have call predecessors, (33), 30 states have return successors, (48), 36 states have call predecessors, (48), 31 states have call successors, (48)
[2025-05-07 17:29:13,657 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions.
[2025-05-07 17:29:13,657 INFO  L79                 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 73
[2025-05-07 17:29:13,657 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:13,657 INFO  L485      AbstractCegarLoop]: Abstraction has 107 states and 129 transitions.
[2025-05-07 17:29:13,657 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (20), 1 states have call predecessors, (20), 5 states have return successors, (20), 6 states have call predecessors, (20), 3 states have call successors, (20)
[2025-05-07 17:29:13,657 INFO  L278                IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions.
[2025-05-07 17:29:13,658 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-05-07 17:29:13,658 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:13,658 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, 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]
[2025-05-07 17:29:13,658 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:29:13,658 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:13,658 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:13,659 INFO  L85        PathProgramCache]: Analyzing trace with hash -612018608, now seen corresponding path program 1 times
[2025-05-07 17:29:13,659 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:13,659 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452875215]
[2025-05-07 17:29:13,659 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:13,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:13,695 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-05-07 17:29:13,707 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-05-07 17:29:13,707 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:13,707 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:13,798 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2025-05-07 17:29:13,798 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:13,798 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452875215]
[2025-05-07 17:29:13,798 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452875215] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:13,798 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790530580]
[2025-05-07 17:29:13,798 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:13,798 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:13,800 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:13,802 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:29:13,803 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:29:14,038 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-05-07 17:29:14,182 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-05-07 17:29:14,182 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:14,182 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:14,188 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1389 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:14,195 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:14,240 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:29:14,240 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:29:14,240 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790530580] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:14,240 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:29:14,240 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6
[2025-05-07 17:29:14,241 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663648671]
[2025-05-07 17:29:14,241 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:14,241 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:14,241 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:14,242 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:14,242 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:14,242 INFO  L87              Difference]: Start difference. First operand 107 states and 129 transitions. Second operand  has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (29), 2 states have call predecessors, (29), 5 states have return successors, (29), 6 states have call predecessors, (29), 4 states have call successors, (29)
[2025-05-07 17:29:14,284 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:14,284 INFO  L93              Difference]: Finished difference Result 107 states and 127 transitions.
[2025-05-07 17:29:14,285 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:14,285 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (29), 2 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 105
[2025-05-07 17:29:14,285 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:14,286 INFO  L225             Difference]: With dead ends: 107
[2025-05-07 17:29:14,286 INFO  L226             Difference]: Without dead ends: 107
[2025-05-07 17:29:14,286 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:14,286 INFO  L437           NwaCegarLoop]: 104 mSDtfsCounter, 1 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:14,286 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 500 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:14,287 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2025-05-07 17:29:14,291 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107.
[2025-05-07 17:29:14,292 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 107 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 31 states have call successors, (33), 22 states have call predecessors, (33), 30 states have return successors, (46), 36 states have call predecessors, (46), 31 states have call successors, (46)
[2025-05-07 17:29:14,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions.
[2025-05-07 17:29:14,292 INFO  L79                 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 105
[2025-05-07 17:29:14,292 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:14,293 INFO  L485      AbstractCegarLoop]: Abstraction has 107 states and 127 transitions.
[2025-05-07 17:29:14,293 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (29), 2 states have call predecessors, (29), 5 states have return successors, (29), 6 states have call predecessors, (29), 4 states have call successors, (29)
[2025-05-07 17:29:14,293 INFO  L278                IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions.
[2025-05-07 17:29:14,293 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-05-07 17:29:14,293 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:14,294 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-05-07 17:29:14,301 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:29:14,494 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7
[2025-05-07 17:29:14,495 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:14,496 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:14,497 INFO  L85        PathProgramCache]: Analyzing trace with hash 1015095792, now seen corresponding path program 1 times
[2025-05-07 17:29:14,497 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:14,497 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057832179]
[2025-05-07 17:29:14,498 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:14,498 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:14,624 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-05-07 17:29:14,669 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-05-07 17:29:14,670 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:14,670 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:15,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-05-07 17:29:15,436 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:15,436 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057832179]
[2025-05-07 17:29:15,436 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057832179] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:15,436 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973625382]
[2025-05-07 17:29:15,436 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:15,436 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:15,438 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:15,439 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:29:15,440 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-05-07 17:29:15,662 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-05-07 17:29:15,807 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-05-07 17:29:15,807 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:15,807 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:15,813 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1399 conjuncts, 100 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:15,816 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:15,905 INFO  L134       CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-05-07 17:29:15,906 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:29:17,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-05-07 17:29:17,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [973625382] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:29:17,717 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:29:17,717 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 28
[2025-05-07 17:29:17,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711611423]
[2025-05-07 17:29:17,718 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:29:17,718 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2025-05-07 17:29:17,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:17,719 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2025-05-07 17:29:17,719 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=689, Unknown=0, NotChecked=0, Total=756
[2025-05-07 17:29:17,720 INFO  L87              Difference]: Start difference. First operand 107 states and 127 transitions. Second operand  has 28 states, 16 states have (on average 2.5625) internal successors, (41), 21 states have internal predecessors, (41), 16 states have call successors, (33), 1 states have call predecessors, (33), 16 states have return successors, (36), 25 states have call predecessors, (36), 16 states have call successors, (36)
[2025-05-07 17:29:18,214 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:18,215 INFO  L93              Difference]: Finished difference Result 121 states and 147 transitions.
[2025-05-07 17:29:18,215 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2025-05-07 17:29:18,215 INFO  L79                 Accepts]: Start accepts. Automaton has  has 28 states, 16 states have (on average 2.5625) internal successors, (41), 21 states have internal predecessors, (41), 16 states have call successors, (33), 1 states have call predecessors, (33), 16 states have return successors, (36), 25 states have call predecessors, (36), 16 states have call successors, (36) Word has length 105
[2025-05-07 17:29:18,215 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:18,216 INFO  L225             Difference]: With dead ends: 121
[2025-05-07 17:29:18,216 INFO  L226             Difference]: Without dead ends: 121
[2025-05-07 17:29:18,216 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=960, Unknown=0, NotChecked=0, Total=1056
[2025-05-07 17:29:18,217 INFO  L437           NwaCegarLoop]: 90 mSDtfsCounter, 10 mSDsluCounter, 2067 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:18,217 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2157 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-05-07 17:29:18,217 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 121 states.
[2025-05-07 17:29:18,223 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114.
[2025-05-07 17:29:18,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 114 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 51 states have internal predecessors, (51), 32 states have call successors, (34), 22 states have call predecessors, (34), 33 states have return successors, (52), 40 states have call predecessors, (52), 32 states have call successors, (52)
[2025-05-07 17:29:18,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions.
[2025-05-07 17:29:18,224 INFO  L79                 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 105
[2025-05-07 17:29:18,224 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:18,224 INFO  L485      AbstractCegarLoop]: Abstraction has 114 states and 137 transitions.
[2025-05-07 17:29:18,224 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 16 states have (on average 2.5625) internal successors, (41), 21 states have internal predecessors, (41), 16 states have call successors, (33), 1 states have call predecessors, (33), 16 states have return successors, (36), 25 states have call predecessors, (36), 16 states have call successors, (36)
[2025-05-07 17:29:18,225 INFO  L278                IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions.
[2025-05-07 17:29:18,225 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-05-07 17:29:18,225 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:18,225 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-05-07 17:29:18,232 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-05-07 17:29:18,426 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:18,426 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:18,427 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:18,428 INFO  L85        PathProgramCache]: Analyzing trace with hash 1445264688, now seen corresponding path program 1 times
[2025-05-07 17:29:18,428 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:18,428 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115967074]
[2025-05-07 17:29:18,428 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:18,428 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:18,490 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-05-07 17:29:18,500 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-05-07 17:29:18,500 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:18,500 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:18,571 INFO  L134       CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-05-07 17:29:18,571 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:18,572 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115967074]
[2025-05-07 17:29:18,572 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115967074] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:18,572 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680120688]
[2025-05-07 17:29:18,572 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:18,572 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:18,574 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:18,576 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:29:18,577 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-05-07 17:29:18,869 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-05-07 17:29:18,978 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-05-07 17:29:18,978 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:18,978 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:18,982 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1400 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:18,985 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:19,007 INFO  L134       CoverageAnalysis]: Checked inductivity of 25 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:29:19,007 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:29:19,007 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [680120688] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:19,007 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:29:19,007 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6
[2025-05-07 17:29:19,007 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120478124]
[2025-05-07 17:29:19,008 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:19,008 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:19,008 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:19,009 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:19,009 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:19,009 INFO  L87              Difference]: Start difference. First operand 114 states and 137 transitions. Second operand  has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (29), 2 states have call predecessors, (29), 5 states have return successors, (29), 6 states have call predecessors, (29), 4 states have call successors, (29)
[2025-05-07 17:29:19,040 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:19,040 INFO  L93              Difference]: Finished difference Result 118 states and 141 transitions.
[2025-05-07 17:29:19,040 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:19,041 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (29), 2 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 105
[2025-05-07 17:29:19,041 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:19,041 INFO  L225             Difference]: With dead ends: 118
[2025-05-07 17:29:19,041 INFO  L226             Difference]: Without dead ends: 118
[2025-05-07 17:29:19,042 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:19,042 INFO  L437           NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:19,042 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 507 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:19,042 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2025-05-07 17:29:19,047 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118.
[2025-05-07 17:29:19,047 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 118 states, 51 states have (on average 1.0392156862745099) internal successors, (53), 53 states have internal predecessors, (53), 32 states have call successors, (34), 22 states have call predecessors, (34), 35 states have return successors, (54), 42 states have call predecessors, (54), 32 states have call successors, (54)
[2025-05-07 17:29:19,048 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions.
[2025-05-07 17:29:19,048 INFO  L79                 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 105
[2025-05-07 17:29:19,048 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:19,048 INFO  L485      AbstractCegarLoop]: Abstraction has 118 states and 141 transitions.
[2025-05-07 17:29:19,048 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (29), 2 states have call predecessors, (29), 5 states have return successors, (29), 6 states have call predecessors, (29), 4 states have call successors, (29)
[2025-05-07 17:29:19,048 INFO  L278                IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions.
[2025-05-07 17:29:19,049 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:29:19,049 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:19,049 INFO  L218           NwaCegarLoop]: trace histogram [3, 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]
[2025-05-07 17:29:19,054 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-05-07 17:29:19,250 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:19,250 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:19,251 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:19,251 INFO  L85        PathProgramCache]: Analyzing trace with hash -2036189527, now seen corresponding path program 1 times
[2025-05-07 17:29:19,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:19,252 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414334405]
[2025-05-07 17:29:19,252 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:19,252 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:19,350 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:29:19,360 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:29:19,360 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:19,360 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:19,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-05-07 17:29:19,471 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:19,471 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414334405]
[2025-05-07 17:29:19,471 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414334405] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:19,471 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:19,471 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:29:19,471 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663876658]
[2025-05-07 17:29:19,471 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:19,471 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:29:19,472 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:19,472 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:29:19,472 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:29:19,472 INFO  L87              Difference]: Start difference. First operand 118 states and 141 transitions. Second operand  has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (24), 1 states have call predecessors, (24), 7 states have return successors, (26), 8 states have call predecessors, (26), 3 states have call successors, (26)
[2025-05-07 17:29:19,550 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:19,550 INFO  L93              Difference]: Finished difference Result 124 states and 150 transitions.
[2025-05-07 17:29:19,551 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:29:19,551 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (24), 1 states have call predecessors, (24), 7 states have return successors, (26), 8 states have call predecessors, (26), 3 states have call successors, (26) Word has length 102
[2025-05-07 17:29:19,551 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:19,552 INFO  L225             Difference]: With dead ends: 124
[2025-05-07 17:29:19,552 INFO  L226             Difference]: Without dead ends: 124
[2025-05-07 17:29:19,552 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:29:19,552 INFO  L437           NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:19,553 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 652 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:29:19,553 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2025-05-07 17:29:19,560 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122.
[2025-05-07 17:29:19,560 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 122 states, 53 states have (on average 1.0377358490566038) internal successors, (55), 55 states have internal predecessors, (55), 32 states have call successors, (34), 22 states have call predecessors, (34), 37 states have return successors, (59), 44 states have call predecessors, (59), 32 states have call successors, (59)
[2025-05-07 17:29:19,561 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 148 transitions.
[2025-05-07 17:29:19,562 INFO  L79                 Accepts]: Start accepts. Automaton has 122 states and 148 transitions. Word has length 102
[2025-05-07 17:29:19,562 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:19,562 INFO  L485      AbstractCegarLoop]: Abstraction has 122 states and 148 transitions.
[2025-05-07 17:29:19,562 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (24), 1 states have call predecessors, (24), 7 states have return successors, (26), 8 states have call predecessors, (26), 3 states have call successors, (26)
[2025-05-07 17:29:19,562 INFO  L278                IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions.
[2025-05-07 17:29:19,563 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:29:19,563 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:19,564 INFO  L218           NwaCegarLoop]: trace histogram [3, 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]
[2025-05-07 17:29:19,564 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:29:19,564 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:19,564 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:19,564 INFO  L85        PathProgramCache]: Analyzing trace with hash 580518377, now seen corresponding path program 1 times
[2025-05-07 17:29:19,564 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:19,564 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968993152]
[2025-05-07 17:29:19,565 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:19,565 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:19,594 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:29:19,603 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:29:19,603 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:19,603 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:19,708 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-05-07 17:29:19,708 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:19,708 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968993152]
[2025-05-07 17:29:19,709 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968993152] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:19,709 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:19,709 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:29:19,709 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608183414]
[2025-05-07 17:29:19,709 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:19,709 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:29:19,709 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:19,710 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:29:19,710 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:29:19,710 INFO  L87              Difference]: Start difference. First operand 122 states and 148 transitions. Second operand  has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (24), 1 states have call predecessors, (24), 7 states have return successors, (25), 8 states have call predecessors, (25), 3 states have call successors, (25)
[2025-05-07 17:29:19,759 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:19,759 INFO  L93              Difference]: Finished difference Result 130 states and 160 transitions.
[2025-05-07 17:29:19,759 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:29:19,759 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (24), 1 states have call predecessors, (24), 7 states have return successors, (25), 8 states have call predecessors, (25), 3 states have call successors, (25) Word has length 102
[2025-05-07 17:29:19,760 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:19,760 INFO  L225             Difference]: With dead ends: 130
[2025-05-07 17:29:19,760 INFO  L226             Difference]: Without dead ends: 130
[2025-05-07 17:29:19,760 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:29:19,761 INFO  L437           NwaCegarLoop]: 102 mSDtfsCounter, 1 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:19,761 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 694 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:19,761 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 130 states.
[2025-05-07 17:29:19,765 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126.
[2025-05-07 17:29:19,765 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 126 states, 55 states have (on average 1.0363636363636364) internal successors, (57), 57 states have internal predecessors, (57), 32 states have call successors, (34), 22 states have call predecessors, (34), 39 states have return successors, (65), 46 states have call predecessors, (65), 32 states have call successors, (65)
[2025-05-07 17:29:19,766 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 156 transitions.
[2025-05-07 17:29:19,766 INFO  L79                 Accepts]: Start accepts. Automaton has 126 states and 156 transitions. Word has length 102
[2025-05-07 17:29:19,766 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:19,767 INFO  L485      AbstractCegarLoop]: Abstraction has 126 states and 156 transitions.
[2025-05-07 17:29:19,767 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (24), 1 states have call predecessors, (24), 7 states have return successors, (25), 8 states have call predecessors, (25), 3 states have call successors, (25)
[2025-05-07 17:29:19,767 INFO  L278                IsEmpty]: Start isEmpty. Operand 126 states and 156 transitions.
[2025-05-07 17:29:19,767 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 103
[2025-05-07 17:29:19,767 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:19,768 INFO  L218           NwaCegarLoop]: trace histogram [3, 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]
[2025-05-07 17:29:19,768 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:29:19,768 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:19,768 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:19,768 INFO  L85        PathProgramCache]: Analyzing trace with hash 398586633, now seen corresponding path program 1 times
[2025-05-07 17:29:19,768 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:19,768 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812637676]
[2025-05-07 17:29:19,768 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:19,768 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:19,796 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:29:19,806 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:29:19,806 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:19,806 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:20,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-05-07 17:29:20,364 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:20,365 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812637676]
[2025-05-07 17:29:20,365 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812637676] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:20,365 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129431613]
[2025-05-07 17:29:20,365 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:20,365 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:20,366 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:20,368 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:29:20,369 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-05-07 17:29:20,562 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes.
[2025-05-07 17:29:20,663 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements.
[2025-05-07 17:29:20,663 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:20,663 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:20,667 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1327 conjuncts, 96 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:20,670 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:20,730 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-05-07 17:29:20,730 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:29:22,714 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-05-07 17:29:22,714 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129431613] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:29:22,714 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:29:22,714 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 26
[2025-05-07 17:29:22,715 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668630621]
[2025-05-07 17:29:22,715 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:29:22,715 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2025-05-07 17:29:22,715 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:22,716 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2025-05-07 17:29:22,716 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650
[2025-05-07 17:29:22,717 INFO  L87              Difference]: Start difference. First operand 126 states and 156 transitions. Second operand  has 26 states, 15 states have (on average 2.6) internal successors, (39), 19 states have internal predecessors, (39), 15 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (33), 23 states have call predecessors, (33), 15 states have call successors, (33)
[2025-05-07 17:29:23,246 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:23,247 INFO  L93              Difference]: Finished difference Result 171 states and 235 transitions.
[2025-05-07 17:29:23,247 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2025-05-07 17:29:23,247 INFO  L79                 Accepts]: Start accepts. Automaton has  has 26 states, 15 states have (on average 2.6) internal successors, (39), 19 states have internal predecessors, (39), 15 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (33), 23 states have call predecessors, (33), 15 states have call successors, (33) Word has length 102
[2025-05-07 17:29:23,247 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:23,248 INFO  L225             Difference]: With dead ends: 171
[2025-05-07 17:29:23,248 INFO  L226             Difference]: Without dead ends: 171
[2025-05-07 17:29:23,249 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870
[2025-05-07 17:29:23,249 INFO  L437           NwaCegarLoop]: 93 mSDtfsCounter, 10 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:23,249 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1695 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-05-07 17:29:23,249 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 171 states.
[2025-05-07 17:29:23,256 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 153.
[2025-05-07 17:29:23,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 153 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 69 states have internal predecessors, (69), 35 states have call successors, (37), 22 states have call predecessors, (37), 51 states have return successors, (106), 61 states have call predecessors, (106), 35 states have call successors, (106)
[2025-05-07 17:29:23,257 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 212 transitions.
[2025-05-07 17:29:23,257 INFO  L79                 Accepts]: Start accepts. Automaton has 153 states and 212 transitions. Word has length 102
[2025-05-07 17:29:23,257 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:23,257 INFO  L485      AbstractCegarLoop]: Abstraction has 153 states and 212 transitions.
[2025-05-07 17:29:23,257 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 15 states have (on average 2.6) internal successors, (39), 19 states have internal predecessors, (39), 15 states have call successors, (30), 1 states have call predecessors, (30), 15 states have return successors, (33), 23 states have call predecessors, (33), 15 states have call successors, (33)
[2025-05-07 17:29:23,258 INFO  L278                IsEmpty]: Start isEmpty. Operand 153 states and 212 transitions.
[2025-05-07 17:29:23,258 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-05-07 17:29:23,258 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:23,258 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-05-07 17:29:23,263 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-05-07 17:29:23,459 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-05-07 17:29:23,459 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:23,460 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:23,460 INFO  L85        PathProgramCache]: Analyzing trace with hash -428739514, now seen corresponding path program 1 times
[2025-05-07 17:29:23,461 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:23,461 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805956695]
[2025-05-07 17:29:23,461 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:23,461 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:23,550 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-05-07 17:29:23,569 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-05-07 17:29:23,569 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:23,569 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:24,401 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-05-07 17:29:24,401 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:24,401 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805956695]
[2025-05-07 17:29:24,401 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805956695] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:24,401 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713903424]
[2025-05-07 17:29:24,401 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:24,401 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:24,403 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:24,404 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:29:24,405 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-05-07 17:29:24,633 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-05-07 17:29:24,762 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-05-07 17:29:24,762 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:24,762 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:24,768 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1786 conjuncts, 130 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:24,772 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:24,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-05-07 17:29:24,842 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:29:27,321 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked.
[2025-05-07 17:29:27,321 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [713903424] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:29:27,321 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:29:27,321 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 27] total 34
[2025-05-07 17:29:27,322 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806704539]
[2025-05-07 17:29:27,322 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:29:27,322 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2025-05-07 17:29:27,322 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:27,323 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2025-05-07 17:29:27,323 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1039, Unknown=0, NotChecked=0, Total=1122
[2025-05-07 17:29:27,323 INFO  L87              Difference]: Start difference. First operand 153 states and 212 transitions. Second operand  has 34 states, 18 states have (on average 2.5) internal successors, (45), 23 states have internal predecessors, (45), 20 states have call successors, (39), 1 states have call predecessors, (39), 18 states have return successors, (45), 31 states have call predecessors, (45), 20 states have call successors, (45)
[2025-05-07 17:29:27,989 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:27,989 INFO  L93              Difference]: Finished difference Result 217 states and 331 transitions.
[2025-05-07 17:29:27,989 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2025-05-07 17:29:27,990 INFO  L79                 Accepts]: Start accepts. Automaton has  has 34 states, 18 states have (on average 2.5) internal successors, (45), 23 states have internal predecessors, (45), 20 states have call successors, (39), 1 states have call predecessors, (39), 18 states have return successors, (45), 31 states have call predecessors, (45), 20 states have call successors, (45) Word has length 134
[2025-05-07 17:29:27,990 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:27,991 INFO  L225             Difference]: With dead ends: 217
[2025-05-07 17:29:27,991 INFO  L226             Difference]: Without dead ends: 217
[2025-05-07 17:29:27,991 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=1595, Unknown=0, NotChecked=0, Total=1722
[2025-05-07 17:29:27,992 INFO  L437           NwaCegarLoop]: 90 mSDtfsCounter, 18 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:27,992 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 2253 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-05-07 17:29:27,992 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 217 states.
[2025-05-07 17:29:28,001 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 144.
[2025-05-07 17:29:28,002 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 144 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 65 states have internal predecessors, (65), 34 states have call successors, (36), 22 states have call predecessors, (36), 47 states have return successors, (96), 57 states have call predecessors, (96), 34 states have call successors, (96)
[2025-05-07 17:29:28,002 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 197 transitions.
[2025-05-07 17:29:28,002 INFO  L79                 Accepts]: Start accepts. Automaton has 144 states and 197 transitions. Word has length 134
[2025-05-07 17:29:28,002 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:28,003 INFO  L485      AbstractCegarLoop]: Abstraction has 144 states and 197 transitions.
[2025-05-07 17:29:28,003 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 34 states, 18 states have (on average 2.5) internal successors, (45), 23 states have internal predecessors, (45), 20 states have call successors, (39), 1 states have call predecessors, (39), 18 states have return successors, (45), 31 states have call predecessors, (45), 20 states have call successors, (45)
[2025-05-07 17:29:28,003 INFO  L278                IsEmpty]: Start isEmpty. Operand 144 states and 197 transitions.
[2025-05-07 17:29:28,004 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2025-05-07 17:29:28,004 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:28,004 INFO  L218           NwaCegarLoop]: trace histogram [3, 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:29:28,011 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-05-07 17:29:28,204 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:28,205 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:28,207 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:28,207 INFO  L85        PathProgramCache]: Analyzing trace with hash 1077519388, now seen corresponding path program 1 times
[2025-05-07 17:29:28,208 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:28,208 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27877315]
[2025-05-07 17:29:28,208 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:28,209 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:28,269 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes.
[2025-05-07 17:29:28,277 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements.
[2025-05-07 17:29:28,277 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:28,277 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:28,384 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-05-07 17:29:28,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:28,384 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27877315]
[2025-05-07 17:29:28,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27877315] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:28,384 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:28,384 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:29:28,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993957059]
[2025-05-07 17:29:28,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:28,385 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:29:28,385 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:28,385 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:29:28,385 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:29:28,385 INFO  L87              Difference]: Start difference. First operand 144 states and 197 transitions. Second operand  has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (25), 1 states have call predecessors, (25), 7 states have return successors, (27), 8 states have call predecessors, (27), 3 states have call successors, (27)
[2025-05-07 17:29:28,430 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:28,430 INFO  L93              Difference]: Finished difference Result 144 states and 195 transitions.
[2025-05-07 17:29:28,430 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:29:28,431 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (25), 1 states have call predecessors, (25), 7 states have return successors, (27), 8 states have call predecessors, (27), 3 states have call successors, (27) Word has length 105
[2025-05-07 17:29:28,431 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:28,432 INFO  L225             Difference]: With dead ends: 144
[2025-05-07 17:29:28,432 INFO  L226             Difference]: Without dead ends: 144
[2025-05-07 17:29:28,432 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:29:28,433 INFO  L437           NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:28,433 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 724 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:28,433 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 144 states.
[2025-05-07 17:29:28,442 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144.
[2025-05-07 17:29:28,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 144 states, 63 states have (on average 1.0317460317460319) internal successors, (65), 65 states have internal predecessors, (65), 34 states have call successors, (36), 22 states have call predecessors, (36), 47 states have return successors, (94), 57 states have call predecessors, (94), 34 states have call successors, (94)
[2025-05-07 17:29:28,443 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 195 transitions.
[2025-05-07 17:29:28,443 INFO  L79                 Accepts]: Start accepts. Automaton has 144 states and 195 transitions. Word has length 105
[2025-05-07 17:29:28,443 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:28,444 INFO  L485      AbstractCegarLoop]: Abstraction has 144 states and 195 transitions.
[2025-05-07 17:29:28,444 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (25), 1 states have call predecessors, (25), 7 states have return successors, (27), 8 states have call predecessors, (27), 3 states have call successors, (27)
[2025-05-07 17:29:28,444 INFO  L278                IsEmpty]: Start isEmpty. Operand 144 states and 195 transitions.
[2025-05-07 17:29:28,445 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-05-07 17:29:28,446 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:28,446 INFO  L218           NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:29:28,446 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-05-07 17:29:28,446 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:28,446 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:28,446 INFO  L85        PathProgramCache]: Analyzing trace with hash 2072770136, now seen corresponding path program 1 times
[2025-05-07 17:29:28,446 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:28,446 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995745138]
[2025-05-07 17:29:28,447 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:28,447 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:28,488 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-05-07 17:29:28,495 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-05-07 17:29:28,496 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:28,496 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:28,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked.
[2025-05-07 17:29:28,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:28,589 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995745138]
[2025-05-07 17:29:28,589 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995745138] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:28,589 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578907795]
[2025-05-07 17:29:28,589 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:28,589 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:28,590 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:28,592 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:29:28,593 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-05-07 17:29:28,916 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-05-07 17:29:29,049 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-05-07 17:29:29,049 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:29,049 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:29,053 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1792 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:29,056 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:29,092 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 59 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2025-05-07 17:29:29,092 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:29:29,993 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked.
[2025-05-07 17:29:29,993 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578907795] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:29:29,993 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:29:29,993 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13
[2025-05-07 17:29:29,993 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585736061]
[2025-05-07 17:29:29,993 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:29:29,993 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-05-07 17:29:29,993 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:29,994 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-05-07 17:29:29,994 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:29:29,994 INFO  L87              Difference]: Start difference. First operand 144 states and 195 transitions. Second operand  has 13 states, 10 states have (on average 6.0) internal successors, (60), 13 states have internal predecessors, (60), 7 states have call successors, (41), 2 states have call predecessors, (41), 10 states have return successors, (47), 10 states have call predecessors, (47), 7 states have call successors, (47)
[2025-05-07 17:29:30,033 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:30,033 INFO  L93              Difference]: Finished difference Result 154 states and 208 transitions.
[2025-05-07 17:29:30,033 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:29:30,034 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 10 states have (on average 6.0) internal successors, (60), 13 states have internal predecessors, (60), 7 states have call successors, (41), 2 states have call predecessors, (41), 10 states have return successors, (47), 10 states have call predecessors, (47), 7 states have call successors, (47) Word has length 134
[2025-05-07 17:29:30,034 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:30,035 INFO  L225             Difference]: With dead ends: 154
[2025-05-07 17:29:30,035 INFO  L226             Difference]: Without dead ends: 154
[2025-05-07 17:29:30,035 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 260 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:29:30,035 INFO  L437           NwaCegarLoop]: 109 mSDtfsCounter, 2 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:30,036 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 632 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:30,036 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 154 states.
[2025-05-07 17:29:30,045 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152.
[2025-05-07 17:29:30,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 152 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 69 states have internal predecessors, (69), 34 states have call successors, (36), 22 states have call predecessors, (36), 51 states have return successors, (100), 61 states have call predecessors, (100), 34 states have call successors, (100)
[2025-05-07 17:29:30,047 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 205 transitions.
[2025-05-07 17:29:30,047 INFO  L79                 Accepts]: Start accepts. Automaton has 152 states and 205 transitions. Word has length 134
[2025-05-07 17:29:30,047 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:30,047 INFO  L485      AbstractCegarLoop]: Abstraction has 152 states and 205 transitions.
[2025-05-07 17:29:30,047 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 10 states have (on average 6.0) internal successors, (60), 13 states have internal predecessors, (60), 7 states have call successors, (41), 2 states have call predecessors, (41), 10 states have return successors, (47), 10 states have call predecessors, (47), 7 states have call successors, (47)
[2025-05-07 17:29:30,047 INFO  L278                IsEmpty]: Start isEmpty. Operand 152 states and 205 transitions.
[2025-05-07 17:29:30,049 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2025-05-07 17:29:30,049 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:30,049 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-05-07 17:29:30,055 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-05-07 17:29:30,250 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-05-07 17:29:30,251 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:30,252 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:30,252 INFO  L85        PathProgramCache]: Analyzing trace with hash -1739953505, now seen corresponding path program 1 times
[2025-05-07 17:29:30,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:30,253 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917223094]
[2025-05-07 17:29:30,253 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:30,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:30,376 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-05-07 17:29:30,384 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-05-07 17:29:30,384 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:30,384 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:30,490 INFO  L134       CoverageAnalysis]: Checked inductivity of 83 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2025-05-07 17:29:30,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:30,491 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917223094]
[2025-05-07 17:29:30,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917223094] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:30,491 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074630002]
[2025-05-07 17:29:30,491 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:30,491 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:30,492 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:30,494 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:29:30,494 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-05-07 17:29:30,774 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-05-07 17:29:30,899 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-05-07 17:29:30,899 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:30,899 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:30,904 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1853 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:30,907 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:30,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 83 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2025-05-07 17:29:30,961 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:29:30,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074630002] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:30,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:29:30,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14
[2025-05-07 17:29:30,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052818454]
[2025-05-07 17:29:30,961 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:30,962 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:29:30,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:30,962 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:29:30,963 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:29:30,963 INFO  L87              Difference]: Start difference. First operand 152 states and 205 transitions. Second operand  has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (34), 2 states have call predecessors, (34), 7 states have return successors, (36), 8 states have call predecessors, (36), 4 states have call successors, (36)
[2025-05-07 17:29:31,021 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:31,021 INFO  L93              Difference]: Finished difference Result 195 states and 285 transitions.
[2025-05-07 17:29:31,022 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:29:31,022 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (34), 2 states have call predecessors, (34), 7 states have return successors, (36), 8 states have call predecessors, (36), 4 states have call successors, (36) Word has length 137
[2025-05-07 17:29:31,022 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:31,023 INFO  L225             Difference]: With dead ends: 195
[2025-05-07 17:29:31,023 INFO  L226             Difference]: Without dead ends: 175
[2025-05-07 17:29:31,023 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:29:31,024 INFO  L437           NwaCegarLoop]: 108 mSDtfsCounter, 3 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:31,024 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 725 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:29:31,024 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 175 states.
[2025-05-07 17:29:31,030 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 170.
[2025-05-07 17:29:31,030 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 170 states, 74 states have (on average 1.027027027027027) internal successors, (76), 75 states have internal predecessors, (76), 42 states have call successors, (45), 26 states have call predecessors, (45), 55 states have return successors, (134), 69 states have call predecessors, (134), 42 states have call successors, (134)
[2025-05-07 17:29:31,031 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 255 transitions.
[2025-05-07 17:29:31,031 INFO  L79                 Accepts]: Start accepts. Automaton has 170 states and 255 transitions. Word has length 137
[2025-05-07 17:29:31,031 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:31,032 INFO  L485      AbstractCegarLoop]: Abstraction has 170 states and 255 transitions.
[2025-05-07 17:29:31,032 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (34), 2 states have call predecessors, (34), 7 states have return successors, (36), 8 states have call predecessors, (36), 4 states have call successors, (36)
[2025-05-07 17:29:31,032 INFO  L278                IsEmpty]: Start isEmpty. Operand 170 states and 255 transitions.
[2025-05-07 17:29:31,033 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2025-05-07 17:29:31,033 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:31,033 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:29:31,039 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-05-07 17:29:31,234 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2025-05-07 17:29:31,234 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:31,235 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:31,236 INFO  L85        PathProgramCache]: Analyzing trace with hash 741276031, now seen corresponding path program 1 times
[2025-05-07 17:29:31,236 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:31,236 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501499003]
[2025-05-07 17:29:31,236 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:31,236 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:31,314 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-05-07 17:29:31,321 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-05-07 17:29:31,321 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:31,321 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:31,423 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked.
[2025-05-07 17:29:31,423 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:31,423 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501499003]
[2025-05-07 17:29:31,423 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501499003] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:31,423 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903840350]
[2025-05-07 17:29:31,423 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:31,424 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:31,425 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:31,426 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:29:31,427 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-05-07 17:29:31,776 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-05-07 17:29:31,909 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-05-07 17:29:31,909 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:31,909 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:31,914 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1864 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:31,917 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:31,972 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2025-05-07 17:29:31,972 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:29:31,972 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [903840350] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:31,972 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:29:31,972 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14
[2025-05-07 17:29:31,972 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027341020]
[2025-05-07 17:29:31,972 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:31,972 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:29:31,972 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:31,973 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:29:31,973 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:29:31,973 INFO  L87              Difference]: Start difference. First operand 170 states and 255 transitions. Second operand  has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (34), 2 states have call predecessors, (34), 7 states have return successors, (36), 8 states have call predecessors, (36), 4 states have call successors, (36)
[2025-05-07 17:29:32,024 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:32,025 INFO  L93              Difference]: Finished difference Result 170 states and 254 transitions.
[2025-05-07 17:29:32,025 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:29:32,025 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (34), 2 states have call predecessors, (34), 7 states have return successors, (36), 8 states have call predecessors, (36), 4 states have call successors, (36) Word has length 137
[2025-05-07 17:29:32,025 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:32,027 INFO  L225             Difference]: With dead ends: 170
[2025-05-07 17:29:32,027 INFO  L226             Difference]: Without dead ends: 170
[2025-05-07 17:29:32,027 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:29:32,028 INFO  L437           NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:32,028 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 724 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:32,028 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 170 states.
[2025-05-07 17:29:32,038 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170.
[2025-05-07 17:29:32,039 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 170 states, 74 states have (on average 1.027027027027027) internal successors, (76), 75 states have internal predecessors, (76), 42 states have call successors, (45), 26 states have call predecessors, (45), 55 states have return successors, (133), 69 states have call predecessors, (133), 42 states have call successors, (133)
[2025-05-07 17:29:32,040 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 254 transitions.
[2025-05-07 17:29:32,040 INFO  L79                 Accepts]: Start accepts. Automaton has 170 states and 254 transitions. Word has length 137
[2025-05-07 17:29:32,041 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:32,041 INFO  L485      AbstractCegarLoop]: Abstraction has 170 states and 254 transitions.
[2025-05-07 17:29:32,041 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (34), 2 states have call predecessors, (34), 7 states have return successors, (36), 8 states have call predecessors, (36), 4 states have call successors, (36)
[2025-05-07 17:29:32,041 INFO  L278                IsEmpty]: Start isEmpty. Operand 170 states and 254 transitions.
[2025-05-07 17:29:32,042 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2025-05-07 17:29:32,042 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:32,043 INFO  L218           NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,049 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2025-05-07 17:29:32,243 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2025-05-07 17:29:32,243 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:32,244 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:32,244 INFO  L85        PathProgramCache]: Analyzing trace with hash -1614533970, now seen corresponding path program 2 times
[2025-05-07 17:29:32,244 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:32,244 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020170139]
[2025-05-07 17:29:32,244 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:29:32,244 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:32,283 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 169 statements into 2 equivalence classes.
[2025-05-07 17:29:32,298 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 169 of 169 statements.
[2025-05-07 17:29:32,298 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:29:32,298 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:32,459 INFO  L134       CoverageAnalysis]: Checked inductivity of 174 backedges. 37 proven. 25 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked.
[2025-05-07 17:29:32,459 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:32,459 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020170139]
[2025-05-07 17:29:32,459 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020170139] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:32,459 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621219214]
[2025-05-07 17:29:32,460 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:29:32,460 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:32,462 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:32,464 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:32,464 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-05-07 17:29:32,972 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 169 statements into 2 equivalence classes.
[2025-05-07 17:29:33,226 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 169 of 169 statements.
[2025-05-07 17:29:33,226 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:29:33,226 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:33,233 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2317 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:33,236 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:33,271 INFO  L134       CoverageAnalysis]: Checked inductivity of 174 backedges. 111 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked.
[2025-05-07 17:29:33,271 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:29:34,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 174 backedges. 29 proven. 25 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked.
[2025-05-07 17:29:34,397 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [621219214] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:29:34,397 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:29:34,397 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13
[2025-05-07 17:29:34,397 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156087126]
[2025-05-07 17:29:34,397 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:29:34,398 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-05-07 17:29:34,398 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:34,398 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-05-07 17:29:34,398 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:29:34,398 INFO  L87              Difference]: Start difference. First operand 170 states and 254 transitions. Second operand  has 13 states, 11 states have (on average 6.0) internal successors, (66), 13 states have internal predecessors, (66), 7 states have call successors, (48), 2 states have call predecessors, (48), 11 states have return successors, (58), 11 states have call predecessors, (58), 7 states have call successors, (58)
[2025-05-07 17:29:34,472 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:34,472 INFO  L93              Difference]: Finished difference Result 130 states and 163 transitions.
[2025-05-07 17:29:34,472 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-05-07 17:29:34,472 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 11 states have (on average 6.0) internal successors, (66), 13 states have internal predecessors, (66), 7 states have call successors, (48), 2 states have call predecessors, (48), 11 states have return successors, (58), 11 states have call predecessors, (58), 7 states have call successors, (58) Word has length 169
[2025-05-07 17:29:34,472 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:34,472 INFO  L225             Difference]: With dead ends: 130
[2025-05-07 17:29:34,472 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:29:34,472 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 332 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272
[2025-05-07 17:29:34,473 INFO  L437           NwaCegarLoop]: 101 mSDtfsCounter, 2 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:34,473 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 776 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:34,473 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:29:34,473 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:29:34,473 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:34,473 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:29:34,473 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 169
[2025-05-07 17:29:34,473 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:34,473 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:29:34,473 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 11 states have (on average 6.0) internal successors, (66), 13 states have internal predecessors, (66), 7 states have call successors, (48), 2 states have call predecessors, (48), 11 states have return successors, (58), 11 states have call predecessors, (58), 7 states have call successors, (58)
[2025-05-07 17:29:34,473 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:29:34,474 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:29:34,475 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:29:34,481 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2025-05-07 17:29:34,676 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:34,685 INFO  L422         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:34,691 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:29:34,699 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:29:34 BoogieIcfgContainer
[2025-05-07 17:29:34,700 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:29:34,701 INFO  L158              Benchmark]: Toolchain (without parser) took 23645.52ms. Allocated memory was 234.9MB in the beginning and 469.8MB in the end (delta: 234.9MB). Free memory was 152.2MB in the beginning and 304.1MB in the end (delta: -151.9MB). Peak memory consumption was 86.9MB. Max. memory is 33.6GB.
[2025-05-07 17:29:34,702 INFO  L158              Benchmark]: SmtParser took 0.18ms. Allocated memory is still 234.9MB. Free memory is still 174.1MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:34,702 INFO  L158              Benchmark]: ChcToBoogie took 40.77ms. Allocated memory is still 234.9MB. Free memory was 152.2MB in the beginning and 149.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:34,703 INFO  L158              Benchmark]: Boogie Preprocessor took 49.50ms. Allocated memory is still 234.9MB. Free memory was 149.5MB in the beginning and 146.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:34,704 INFO  L158              Benchmark]: RCFGBuilder took 370.59ms. Allocated memory is still 234.9MB. Free memory was 146.3MB in the beginning and 184.9MB in the end (delta: -38.7MB). Peak memory consumption was 43.2MB. Max. memory is 33.6GB.
[2025-05-07 17:29:34,704 INFO  L158              Benchmark]: TraceAbstraction took 23181.06ms. Allocated memory was 234.9MB in the beginning and 469.8MB in the end (delta: 234.9MB). Free memory was 184.5MB in the beginning and 304.1MB in the end (delta: -119.6MB). Peak memory consumption was 110.9MB. Max. memory is 33.6GB.
[2025-05-07 17:29:34,707 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.18ms. Allocated memory is still 234.9MB. Free memory is still 174.1MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 40.77ms. Allocated memory is still 234.9MB. Free memory was 152.2MB in the beginning and 149.6MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 49.50ms. Allocated memory is still 234.9MB. Free memory was 149.5MB in the beginning and 146.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 370.59ms. Allocated memory is still 234.9MB. Free memory was 146.3MB in the beginning and 184.9MB in the end (delta: -38.7MB). Peak memory consumption was 43.2MB. Max. memory is 33.6GB.
 * TraceAbstraction took 23181.06ms. Allocated memory was 234.9MB in the beginning and 469.8MB in the end (delta: 234.9MB). Free memory was 184.5MB in the beginning and 304.1MB in the end (delta: -119.6MB). Peak memory consumption was 110.9MB. 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 23 procedures, 96 locations, 152 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.1s, OverallIterations: 18, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 124 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 15455 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13615 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3404 IncrementalHoareTripleChecker+Invalid, 3445 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 1840 mSDtfsCounter, 3404 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1991 GetRequests, 1774 SyntacticMatches, 9 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=16, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 121 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 2994 NumberOfCodeBlocks, 2994 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3606 ConstructedInterpolants, 0 QuantifiedInterpolants, 5432 SizeOfPredicates, 63 NumberOfNonLiveVariables, 15127 ConjunctsInSsa, 362 ConjunctsInUnsatCore, 32 InterpolantComputations, 13 PerfectInterpolantSequences, 1502/1698 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:34,724 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
