./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/external_calls/call_with_value_1.sol_1_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:27:30,854 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:27:30,891 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9508ed80-e81c-4863-8eda-a47c15b97067/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:27:30,894 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:27:30,894 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:27:30,907 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:27:30,907 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:27:30,907 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:27:30,907 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:27:30,907 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:27:30,908 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:27:30,908 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:27:30,908 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:27:30,908 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:27:30,908 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:27:30,908 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:27:30,908 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:27:30,908 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:27:30,908 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:27:30,908 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:27:30,908 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:27:30,908 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:27:30,908 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:27:30,908 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:27:30,909 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:27:30,909 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:27:30,909 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:27:31,127 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:27:31,135 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:27:31,137 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:27:31,138 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:27:31,138 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:27:31,139 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9508ed80-e81c-4863-8eda-a47c15b97067/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/external_calls/call_with_value_1.sol_1_no_adts_000.smt2
[2025-05-07 17:27:31,140 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:27:31,143 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:27:31,364 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9508ed80-e81c-4863-8eda-a47c15b97067/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/external_calls/call_with_value_1.sol_1_no_adts_000.smt2
[2025-05-07 17:27:31,366 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:27:31,367 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:27:31,368 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:27:31,368 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:27:31,368 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:27:31,370 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:27:31" (1/1) ...
[2025-05-07 17:27:31,396 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:31 Unit
[2025-05-07 17:27:31,396 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:27:31,397 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:27:31,397 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:27:31,397 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:27:31,409 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:31" (1/1) ...
[2025-05-07 17:27:31,409 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:31" (1/1) ...
[2025-05-07 17:27:31,429 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:31" (1/1) ...
[2025-05-07 17:27:31,429 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:31" (1/1) ...
[2025-05-07 17:27:31,432 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:31" (1/1) ...
[2025-05-07 17:27:31,433 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:31" (1/1) ...
[2025-05-07 17:27:31,434 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:31" (1/1) ...
[2025-05-07 17:27:31,436 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:31" (1/1) ...
[2025-05-07 17:27:31,437 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:31" (1/1) ...
[2025-05-07 17:27:31,448 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:27:31,448 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:27:31,448 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:27:31,448 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:27:31,449 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:31" (1/1) ...
[2025-05-07 17:27:31,451 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:27:31,458 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:27:31,466 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:27:31,468 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:27:31,476 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:27:31,476 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:27:31,476 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:27:31,476 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_4_0 given in one single declaration
[2025-05-07 17:27:31,476 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_4_0
[2025-05-07 17:27:31,476 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_4_0
[2025-05-07 17:27:31,476 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_0_C_45_0 given in one single declaration
[2025-05-07 17:27:31,476 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_0_C_45_0
[2025-05-07 17:27:31,476 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_0_C_45_0
[2025-05-07 17:27:31,477 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_2_C_45_0 given in one single declaration
[2025-05-07 17:27:31,477 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_2_C_45_0
[2025-05-07 17:27:31,477 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_2_C_45_0
[2025-05-07 17:27:31,477 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_12_C_45_0 given in one single declaration
[2025-05-07 17:27:31,477 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_12_C_45_0
[2025-05-07 17:27:31,477 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_12_C_45_0
[2025-05-07 17:27:31,477 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_14_C_45_0 given in one single declaration
[2025-05-07 17:27:31,477 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_14_C_45_0
[2025-05-07 17:27:31,477 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_14_C_45_0
[2025-05-07 17:27:31,477 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_13_C_45_0 given in one single declaration
[2025-05-07 17:27:31,477 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_13_C_45_0
[2025-05-07 17:27:31,478 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_13_C_45_0
[2025-05-07 17:27:31,478 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_15_C_45_0 given in one single declaration
[2025-05-07 17:27:31,478 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_15_C_45_0
[2025-05-07 17:27:31,478 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_15_C_45_0
[2025-05-07 17:27:31,478 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_4_function_g__44_45_0 given in one single declaration
[2025-05-07 17:27:31,478 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_4_function_g__44_45_0
[2025-05-07 17:27:31,478 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_4_function_g__44_45_0
[2025-05-07 17:27:31,478 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_11_function_g__44_45_0 given in one single declaration
[2025-05-07 17:27:31,478 INFO  L130     BoogieDeclarations]: Found specification of procedure block_11_function_g__44_45_0
[2025-05-07 17:27:31,478 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_11_function_g__44_45_0
[2025-05-07 17:27:31,478 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_3_function_g__44_45_0 given in one single declaration
[2025-05-07 17:27:31,478 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_3_function_g__44_45_0
[2025-05-07 17:27:31,478 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_3_function_g__44_45_0
[2025-05-07 17:27:31,478 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_9_function_g__44_45_0 given in one single declaration
[2025-05-07 17:27:31,478 INFO  L130     BoogieDeclarations]: Found specification of procedure block_9_function_g__44_45_0
[2025-05-07 17:27:31,478 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_9_function_g__44_45_0
[2025-05-07 17:27:31,478 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure nondet_call_8_0 given in one single declaration
[2025-05-07 17:27:31,478 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_call_8_0
[2025-05-07 17:27:31,479 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_call_8_0
[2025-05-07 17:27:31,479 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure nondet_interface_1_C_45_0 given in one single declaration
[2025-05-07 17:27:31,479 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_interface_1_C_45_0
[2025-05-07 17:27:31,479 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_interface_1_C_45_0
[2025-05-07 17:27:31,479 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_6_g_43_45_0 given in one single declaration
[2025-05-07 17:27:31,479 INFO  L130     BoogieDeclarations]: Found specification of procedure block_6_g_43_45_0
[2025-05-07 17:27:31,479 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_6_g_43_45_0
[2025-05-07 17:27:31,479 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_5_function_g__44_45_0 given in one single declaration
[2025-05-07 17:27:31,479 INFO  L130     BoogieDeclarations]: Found specification of procedure block_5_function_g__44_45_0
[2025-05-07 17:27:31,479 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_5_function_g__44_45_0
[2025-05-07 17:27:31,479 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_7_return_function_g__44_45_0 given in one single declaration
[2025-05-07 17:27:31,479 INFO  L130     BoogieDeclarations]: Found specification of procedure block_7_return_function_g__44_45_0
[2025-05-07 17:27:31,479 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_7_return_function_g__44_45_0
[2025-05-07 17:27:31,479 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_10_function_g__44_45_0 given in one single declaration
[2025-05-07 17:27:31,479 INFO  L130     BoogieDeclarations]: Found specification of procedure block_10_function_g__44_45_0
[2025-05-07 17:27:31,479 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_10_function_g__44_45_0
[2025-05-07 17:27:31,479 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:27:31,479 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:27:31,479 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:27:31,585 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:27:31,587 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:27:31,772 INFO  L?                        ?]: Removed 166 outVars from TransFormulas that were not future-live.
[2025-05-07 17:27:31,773 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:27:31,780 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:27:31,781 INFO  L312             CfgBuilder]: Removed 9 assume(true) statements.
[2025-05-07 17:27:31,781 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:27:31 BoogieIcfgContainer
[2025-05-07 17:27:31,781 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:27:31,783 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:27:31,783 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:27:31,786 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:27:31,786 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:27:31" (1/3) ...
[2025-05-07 17:27:31,787 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a11175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:27:31, skipping insertion in model container
[2025-05-07 17:27:31,787 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:31" (2/3) ...
[2025-05-07 17:27:31,787 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a11175 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:27:31, skipping insertion in model container
[2025-05-07 17:27:31,787 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:27:31" (3/3) ...
[2025-05-07 17:27:31,788 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:27:31,802 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:27:31,805 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 19 procedures, 79 locations, 126 edges, 19 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:27:31,839 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:27:31,850 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;@3c03fabd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:27:31,850 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:27:31,853 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 79 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 28 states have call successors, (30), 18 states have call predecessors, (30), 18 states have return successors, (30), 25 states have call predecessors, (30), 28 states have call successors, (30)
[2025-05-07 17:27:31,862 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2025-05-07 17:27:31,863 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:31,863 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]
[2025-05-07 17:27:31,863 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:31,867 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:31,867 INFO  L85        PathProgramCache]: Analyzing trace with hash -200191179, now seen corresponding path program 1 times
[2025-05-07 17:27:31,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:31,873 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440630078]
[2025-05-07 17:27:31,873 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:31,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:31,920 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes.
[2025-05-07 17:27:31,977 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements.
[2025-05-07 17:27:31,977 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:31,977 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:32,132 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:27:32,132 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:32,132 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440630078]
[2025-05-07 17:27:32,133 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440630078] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:32,133 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:32,135 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:27:32,136 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362820048]
[2025-05-07 17:27:32,136 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:32,139 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:27:32,139 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:32,156 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:27:32,156 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:27:32,158 INFO  L87              Difference]: Start difference. First operand  has 79 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 28 states have call successors, (30), 18 states have call predecessors, (30), 18 states have return successors, (30), 25 states have call predecessors, (30), 28 states have call successors, (30) Second operand  has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15)
[2025-05-07 17:27:32,240 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:32,240 INFO  L93              Difference]: Finished difference Result 83 states and 103 transitions.
[2025-05-07 17:27:32,241 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:27:32,242 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 55
[2025-05-07 17:27:32,242 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:32,249 INFO  L225             Difference]: With dead ends: 83
[2025-05-07 17:27:32,249 INFO  L226             Difference]: Without dead ends: 83
[2025-05-07 17:27:32,250 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:27:32,257 INFO  L437           NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 349 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:27:32,258 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 349 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:32,268 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83 states.
[2025-05-07 17:27:32,294 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81.
[2025-05-07 17:27:32,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 81 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 36 states have internal predecessors, (36), 28 states have call successors, (30), 18 states have call predecessors, (30), 20 states have return successors, (35), 26 states have call predecessors, (35), 28 states have call successors, (35)
[2025-05-07 17:27:32,299 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions.
[2025-05-07 17:27:32,300 INFO  L79                 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 55
[2025-05-07 17:27:32,301 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:32,301 INFO  L485      AbstractCegarLoop]: Abstraction has 81 states and 101 transitions.
[2025-05-07 17:27:32,302 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15)
[2025-05-07 17:27:32,302 INFO  L278                IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions.
[2025-05-07 17:27:32,305 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:27:32,305 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:32,305 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]
[2025-05-07 17:27:32,305 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:27:32,305 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:32,306 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:32,306 INFO  L85        PathProgramCache]: Analyzing trace with hash 1415991210, now seen corresponding path program 1 times
[2025-05-07 17:27:32,306 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:32,306 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477298800]
[2025-05-07 17:27:32,306 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:32,306 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:32,330 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:27:32,352 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:27:32,352 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:32,352 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:32,517 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:27:32,517 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:32,517 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477298800]
[2025-05-07 17:27:32,517 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477298800] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:32,517 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:32,518 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:27:32,518 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560470030]
[2025-05-07 17:27:32,518 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:32,519 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:27:32,519 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:32,520 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:27:32,520 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:27:32,520 INFO  L87              Difference]: Start difference. First operand 81 states and 101 transitions. Second operand  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16)
[2025-05-07 17:27:32,569 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:32,569 INFO  L93              Difference]: Finished difference Result 86 states and 108 transitions.
[2025-05-07 17:27:32,569 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:27:32,569 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 58
[2025-05-07 17:27:32,570 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:32,571 INFO  L225             Difference]: With dead ends: 86
[2025-05-07 17:27:32,571 INFO  L226             Difference]: Without dead ends: 86
[2025-05-07 17:27:32,571 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:27:32,571 INFO  L437           NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 463 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:27:32,571 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 463 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:32,572 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2025-05-07 17:27:32,577 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86.
[2025-05-07 17:27:32,577 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 86 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 38 states have internal predecessors, (38), 29 states have call successors, (31), 18 states have call predecessors, (31), 22 states have return successors, (39), 29 states have call predecessors, (39), 29 states have call successors, (39)
[2025-05-07 17:27:32,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 108 transitions.
[2025-05-07 17:27:32,578 INFO  L79                 Accepts]: Start accepts. Automaton has 86 states and 108 transitions. Word has length 58
[2025-05-07 17:27:32,578 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:32,579 INFO  L485      AbstractCegarLoop]: Abstraction has 86 states and 108 transitions.
[2025-05-07 17:27:32,579 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16)
[2025-05-07 17:27:32,579 INFO  L278                IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions.
[2025-05-07 17:27:32,580 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:27:32,580 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:32,580 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]
[2025-05-07 17:27:32,580 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:27:32,580 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:32,580 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:32,581 INFO  L85        PathProgramCache]: Analyzing trace with hash -1076256282, now seen corresponding path program 1 times
[2025-05-07 17:27:32,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:32,581 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781088962]
[2025-05-07 17:27:32,581 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:32,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:32,605 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:27:32,619 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:27:32,619 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:32,619 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:32,722 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:27:32,722 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:32,723 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781088962]
[2025-05-07 17:27:32,723 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781088962] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:32,723 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:32,723 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:27:32,723 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985630934]
[2025-05-07 17:27:32,723 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:32,723 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:27:32,723 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:32,724 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:27:32,724 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:32,724 INFO  L87              Difference]: Start difference. First operand 86 states and 108 transitions. Second operand  has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:27:32,737 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:32,737 INFO  L93              Difference]: Finished difference Result 90 states and 112 transitions.
[2025-05-07 17:27:32,737 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:27:32,737 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 58
[2025-05-07 17:27:32,738 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:32,739 INFO  L225             Difference]: With dead ends: 90
[2025-05-07 17:27:32,739 INFO  L226             Difference]: Without dead ends: 86
[2025-05-07 17:27:32,739 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:27:32,740 INFO  L437           NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:32,740 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 277 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:32,741 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 86 states.
[2025-05-07 17:27:32,748 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84.
[2025-05-07 17:27:32,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 27 states have call successors, (29), 18 states have call predecessors, (29), 22 states have return successors, (37), 28 states have call predecessors, (37), 27 states have call successors, (37)
[2025-05-07 17:27:32,750 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions.
[2025-05-07 17:27:32,750 INFO  L79                 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 58
[2025-05-07 17:27:32,750 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:32,750 INFO  L485      AbstractCegarLoop]: Abstraction has 84 states and 103 transitions.
[2025-05-07 17:27:32,750 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:27:32,751 INFO  L278                IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions.
[2025-05-07 17:27:32,752 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:27:32,752 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:32,752 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]
[2025-05-07 17:27:32,753 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:27:32,753 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:32,753 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:32,753 INFO  L85        PathProgramCache]: Analyzing trace with hash 11951210, now seen corresponding path program 1 times
[2025-05-07 17:27:32,753 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:32,753 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574776066]
[2025-05-07 17:27:32,753 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:32,754 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:32,778 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:27:32,790 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:27:32,791 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:32,791 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:32,893 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:27:32,893 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:32,893 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574776066]
[2025-05-07 17:27:32,893 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574776066] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:32,893 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:32,893 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:27:32,893 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247798429]
[2025-05-07 17:27:32,893 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:32,894 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:27:32,894 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:32,894 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:27:32,894 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:27:32,895 INFO  L87              Difference]: Start difference. First operand 84 states and 103 transitions. Second operand  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16)
[2025-05-07 17:27:32,942 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:32,943 INFO  L93              Difference]: Finished difference Result 89 states and 110 transitions.
[2025-05-07 17:27:32,943 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:27:32,943 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16) Word has length 58
[2025-05-07 17:27:32,944 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:32,945 INFO  L225             Difference]: With dead ends: 89
[2025-05-07 17:27:32,945 INFO  L226             Difference]: Without dead ends: 89
[2025-05-07 17:27:32,945 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:27:32,946 INFO  L437           NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 438 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:27:32,946 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 438 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:32,947 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 89 states.
[2025-05-07 17:27:32,954 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84.
[2025-05-07 17:27:32,954 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 27 states have call successors, (29), 18 states have call predecessors, (29), 22 states have return successors, (37), 28 states have call predecessors, (37), 27 states have call successors, (37)
[2025-05-07 17:27:32,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions.
[2025-05-07 17:27:32,955 INFO  L79                 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 58
[2025-05-07 17:27:32,956 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:32,956 INFO  L485      AbstractCegarLoop]: Abstraction has 84 states and 103 transitions.
[2025-05-07 17:27:32,956 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 5 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 5 states have call successors, (16)
[2025-05-07 17:27:32,956 INFO  L278                IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions.
[2025-05-07 17:27:32,957 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:27:32,958 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:32,958 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]
[2025-05-07 17:27:32,958 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:27:32,958 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:32,958 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:32,958 INFO  L85        PathProgramCache]: Analyzing trace with hash 431284010, now seen corresponding path program 1 times
[2025-05-07 17:27:32,959 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:32,959 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227674836]
[2025-05-07 17:27:32,959 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:32,959 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:32,982 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:27:33,000 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:27:33,000 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:33,000 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:33,280 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:27:33,280 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:33,280 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227674836]
[2025-05-07 17:27:33,280 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227674836] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:33,281 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:33,281 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:27:33,281 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667650921]
[2025-05-07 17:27:33,281 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:33,281 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:27:33,281 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:33,282 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:27:33,282 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:27:33,282 INFO  L87              Difference]: Start difference. First operand 84 states and 103 transitions. Second operand  has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:27:33,319 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:33,319 INFO  L93              Difference]: Finished difference Result 84 states and 102 transitions.
[2025-05-07 17:27:33,320 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:27:33,320 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 58
[2025-05-07 17:27:33,320 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:33,321 INFO  L225             Difference]: With dead ends: 84
[2025-05-07 17:27:33,321 INFO  L226             Difference]: Without dead ends: 84
[2025-05-07 17:27:33,322 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:27:33,322 INFO  L437           NwaCegarLoop]: 84 mSDtfsCounter, 1 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:33,323 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 325 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:33,323 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2025-05-07 17:27:33,329 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2025-05-07 17:27:33,329 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 27 states have call successors, (29), 18 states have call predecessors, (29), 22 states have return successors, (36), 28 states have call predecessors, (36), 27 states have call successors, (36)
[2025-05-07 17:27:33,330 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions.
[2025-05-07 17:27:33,330 INFO  L79                 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 58
[2025-05-07 17:27:33,331 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:33,331 INFO  L485      AbstractCegarLoop]: Abstraction has 84 states and 102 transitions.
[2025-05-07 17:27:33,331 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:27:33,331 INFO  L278                IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions.
[2025-05-07 17:27:33,332 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-05-07 17:27:33,332 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:33,332 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]
[2025-05-07 17:27:33,332 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:27:33,332 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:33,333 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:33,333 INFO  L85        PathProgramCache]: Analyzing trace with hash -2132354008, now seen corresponding path program 1 times
[2025-05-07 17:27:33,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:33,333 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385691607]
[2025-05-07 17:27:33,333 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:33,333 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:33,363 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-05-07 17:27:33,380 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-05-07 17:27:33,380 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:33,380 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:33,525 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2025-05-07 17:27:33,525 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:33,525 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385691607]
[2025-05-07 17:27:33,525 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385691607] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:33,525 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:33,525 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:27:33,525 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028045356]
[2025-05-07 17:27:33,525 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:33,526 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:27:33,526 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:33,526 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:27:33,527 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:27:33,527 INFO  L87              Difference]: Start difference. First operand 84 states and 102 transitions. Second operand  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 6 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23)
[2025-05-07 17:27:33,634 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:33,634 INFO  L93              Difference]: Finished difference Result 96 states and 122 transitions.
[2025-05-07 17:27:33,634 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:27:33,635 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 6 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23) Word has length 87
[2025-05-07 17:27:33,635 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:33,636 INFO  L225             Difference]: With dead ends: 96
[2025-05-07 17:27:33,636 INFO  L226             Difference]: Without dead ends: 96
[2025-05-07 17:27:33,636 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:27:33,636 INFO  L437           NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:33,637 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 573 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:27:33,637 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2025-05-07 17:27:33,641 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94.
[2025-05-07 17:27:33,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 94 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 41 states have internal predecessors, (41), 29 states have call successors, (31), 18 states have call predecessors, (31), 26 states have return successors, (48), 34 states have call predecessors, (48), 29 states have call successors, (48)
[2025-05-07 17:27:33,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions.
[2025-05-07 17:27:33,642 INFO  L79                 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 87
[2025-05-07 17:27:33,642 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:33,642 INFO  L485      AbstractCegarLoop]: Abstraction has 94 states and 120 transitions.
[2025-05-07 17:27:33,642 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 6 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 8 states have call predecessors, (23), 6 states have call successors, (23)
[2025-05-07 17:27:33,642 INFO  L278                IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions.
[2025-05-07 17:27:33,643 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-05-07 17:27:33,643 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:33,643 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]
[2025-05-07 17:27:33,643 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:27:33,643 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:33,644 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:33,644 INFO  L85        PathProgramCache]: Analyzing trace with hash 1399455976, now seen corresponding path program 1 times
[2025-05-07 17:27:33,644 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:33,644 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975555987]
[2025-05-07 17:27:33,644 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:33,644 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:33,676 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-05-07 17:27:33,691 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-05-07 17:27:33,691 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:33,691 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:33,822 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:27:33,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:33,822 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975555987]
[2025-05-07 17:27:33,823 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975555987] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:33,823 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:33,823 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:27:33,823 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550702886]
[2025-05-07 17:27:33,823 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:33,823 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:27:33,823 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:33,824 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:27:33,824 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:27:33,824 INFO  L87              Difference]: Start difference. First operand 94 states and 120 transitions. Second operand  has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 6 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21)
[2025-05-07 17:27:33,906 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:33,906 INFO  L93              Difference]: Finished difference Result 104 states and 141 transitions.
[2025-05-07 17:27:33,906 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:27:33,907 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 6 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) Word has length 87
[2025-05-07 17:27:33,907 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:33,908 INFO  L225             Difference]: With dead ends: 104
[2025-05-07 17:27:33,908 INFO  L226             Difference]: Without dead ends: 104
[2025-05-07 17:27:33,908 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:27:33,909 INFO  L437           NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:33,909 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 589 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:27:33,910 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 104 states.
[2025-05-07 17:27:33,917 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99.
[2025-05-07 17:27:33,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 99 states, 41 states have (on average 1.048780487804878) internal successors, (43), 43 states have internal predecessors, (43), 30 states have call successors, (32), 18 states have call predecessors, (32), 28 states have return successors, (59), 37 states have call predecessors, (59), 30 states have call successors, (59)
[2025-05-07 17:27:33,919 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 134 transitions.
[2025-05-07 17:27:33,919 INFO  L79                 Accepts]: Start accepts. Automaton has 99 states and 134 transitions. Word has length 87
[2025-05-07 17:27:33,919 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:33,919 INFO  L485      AbstractCegarLoop]: Abstraction has 99 states and 134 transitions.
[2025-05-07 17:27:33,919 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 6 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21)
[2025-05-07 17:27:33,919 INFO  L278                IsEmpty]: Start isEmpty. Operand 99 states and 134 transitions.
[2025-05-07 17:27:33,921 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-05-07 17:27:33,921 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:33,921 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]
[2025-05-07 17:27:33,921 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:27:33,921 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:33,922 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:33,922 INFO  L85        PathProgramCache]: Analyzing trace with hash 776673117, now seen corresponding path program 1 times
[2025-05-07 17:27:33,922 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:33,922 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514308894]
[2025-05-07 17:27:33,922 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:33,922 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:33,947 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:27:33,967 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:27:33,967 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:33,967 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:34,552 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-05-07 17:27:34,552 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:34,553 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514308894]
[2025-05-07 17:27:34,553 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514308894] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:27:34,553 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965303076]
[2025-05-07 17:27:34,553 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:34,553 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:34,554 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:27:34,556 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:27:34,557 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:27:34,745 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:27:34,883 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:27:34,884 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:34,884 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:34,890 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1107 conjuncts, 57 conjuncts are in the unsatisfiable core
[2025-05-07 17:27:34,900 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:27:34,951 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2025-05-07 17:27:35,081 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9
[2025-05-07 17:27:35,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-05-07 17:27:35,107 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:27:36,721 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-05-07 17:27:36,721 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 7 treesize of output 6
[2025-05-07 17:27:36,904 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-05-07 17:27:36,905 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1
[2025-05-07 17:27:37,082 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-05-07 17:27:37,083 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1
[2025-05-07 17:27:37,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-05-07 17:27:37,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [965303076] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:27:37,491 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:27:37,491 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 19
[2025-05-07 17:27:37,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323115940]
[2025-05-07 17:27:37,491 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:27:37,492 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2025-05-07 17:27:37,492 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:37,493 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2025-05-07 17:27:37,493 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342
[2025-05-07 17:27:37,493 INFO  L87              Difference]: Start difference. First operand 99 states and 134 transitions. Second operand  has 19 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 18 states have internal predecessors, (55), 10 states have call successors, (33), 2 states have call predecessors, (33), 14 states have return successors, (39), 15 states have call predecessors, (39), 10 states have call successors, (39)
[2025-05-07 17:27:37,790 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:37,790 INFO  L93              Difference]: Finished difference Result 115 states and 161 transitions.
[2025-05-07 17:27:37,790 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-05-07 17:27:37,791 INFO  L79                 Accepts]: Start accepts. Automaton has  has 19 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 18 states have internal predecessors, (55), 10 states have call successors, (33), 2 states have call predecessors, (33), 14 states have return successors, (39), 15 states have call predecessors, (39), 10 states have call successors, (39) Word has length 90
[2025-05-07 17:27:37,791 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:37,791 INFO  L225             Difference]: With dead ends: 115
[2025-05-07 17:27:37,791 INFO  L226             Difference]: Without dead ends: 115
[2025-05-07 17:27:37,792 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462
[2025-05-07 17:27:37,792 INFO  L437           NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:37,792 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1235 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:27:37,792 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 115 states.
[2025-05-07 17:27:37,797 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107.
[2025-05-07 17:27:37,797 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 107 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 46 states have internal predecessors, (46), 32 states have call successors, (34), 18 states have call predecessors, (34), 31 states have return successors, (68), 43 states have call predecessors, (68), 32 states have call successors, (68)
[2025-05-07 17:27:37,798 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 148 transitions.
[2025-05-07 17:27:37,798 INFO  L79                 Accepts]: Start accepts. Automaton has 107 states and 148 transitions. Word has length 90
[2025-05-07 17:27:37,798 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:37,798 INFO  L485      AbstractCegarLoop]: Abstraction has 107 states and 148 transitions.
[2025-05-07 17:27:37,798 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 18 states have internal predecessors, (55), 10 states have call successors, (33), 2 states have call predecessors, (33), 14 states have return successors, (39), 15 states have call predecessors, (39), 10 states have call successors, (39)
[2025-05-07 17:27:37,798 INFO  L278                IsEmpty]: Start isEmpty. Operand 107 states and 148 transitions.
[2025-05-07 17:27:37,799 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-05-07 17:27:37,799 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:37,799 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]
[2025-05-07 17:27:37,805 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:27:38,000 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:38,001 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:38,002 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:38,002 INFO  L85        PathProgramCache]: Analyzing trace with hash 1821903901, now seen corresponding path program 1 times
[2025-05-07 17:27:38,002 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:38,002 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951711472]
[2025-05-07 17:27:38,002 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:38,003 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:38,096 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:27:38,105 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:27:38,105 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:38,106 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:38,201 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2025-05-07 17:27:38,201 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:38,201 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951711472]
[2025-05-07 17:27:38,201 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951711472] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:38,201 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:38,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:27:38,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017499257]
[2025-05-07 17:27:38,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:38,202 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:27:38,202 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:38,202 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:27:38,202 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:27:38,202 INFO  L87              Difference]: Start difference. First operand 107 states and 148 transitions. Second operand  has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (22), 1 states have call predecessors, (22), 7 states have return successors, (24), 8 states have call predecessors, (24), 6 states have call successors, (24)
[2025-05-07 17:27:38,262 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:38,262 INFO  L93              Difference]: Finished difference Result 107 states and 147 transitions.
[2025-05-07 17:27:38,262 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:27:38,262 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (22), 1 states have call predecessors, (22), 7 states have return successors, (24), 8 states have call predecessors, (24), 6 states have call successors, (24) Word has length 90
[2025-05-07 17:27:38,263 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:38,264 INFO  L225             Difference]: With dead ends: 107
[2025-05-07 17:27:38,264 INFO  L226             Difference]: Without dead ends: 107
[2025-05-07 17:27:38,264 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:27:38,265 INFO  L437           NwaCegarLoop]: 87 mSDtfsCounter, 1 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:38,265 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 584 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:27:38,266 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2025-05-07 17:27:38,273 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107.
[2025-05-07 17:27:38,273 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 107 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 46 states have internal predecessors, (46), 32 states have call successors, (34), 18 states have call predecessors, (34), 31 states have return successors, (67), 43 states have call predecessors, (67), 32 states have call successors, (67)
[2025-05-07 17:27:38,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 147 transitions.
[2025-05-07 17:27:38,274 INFO  L79                 Accepts]: Start accepts. Automaton has 107 states and 147 transitions. Word has length 90
[2025-05-07 17:27:38,275 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:38,275 INFO  L485      AbstractCegarLoop]: Abstraction has 107 states and 147 transitions.
[2025-05-07 17:27:38,275 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 6 states have call successors, (22), 1 states have call predecessors, (22), 7 states have return successors, (24), 8 states have call predecessors, (24), 6 states have call successors, (24)
[2025-05-07 17:27:38,275 INFO  L278                IsEmpty]: Start isEmpty. Operand 107 states and 147 transitions.
[2025-05-07 17:27:38,276 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-05-07 17:27:38,276 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:38,276 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]
[2025-05-07 17:27:38,276 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:27:38,276 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:38,276 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:38,276 INFO  L85        PathProgramCache]: Analyzing trace with hash 1693375178, now seen corresponding path program 1 times
[2025-05-07 17:27:38,276 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:38,277 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948743929]
[2025-05-07 17:27:38,277 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:38,277 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:38,302 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-05-07 17:27:38,310 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-05-07 17:27:38,310 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:38,310 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:38,449 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked.
[2025-05-07 17:27:38,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:38,449 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948743929]
[2025-05-07 17:27:38,449 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948743929] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:27:38,449 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871290291]
[2025-05-07 17:27:38,449 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:38,449 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:38,452 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:27:38,453 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:27:38,454 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-05-07 17:27:38,684 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-05-07 17:27:38,837 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-05-07 17:27:38,837 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:38,837 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:38,842 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1541 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-05-07 17:27:38,848 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:27:38,921 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2025-05-07 17:27:38,921 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:27:38,921 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [871290291] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:38,921 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:27:38,921 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14
[2025-05-07 17:27:38,921 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128262613]
[2025-05-07 17:27:38,921 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:38,921 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:27:38,921 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:38,922 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:27:38,922 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:27:38,922 INFO  L87              Difference]: Start difference. First operand 107 states and 147 transitions. Second operand  has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 6 states have call successors, (26), 2 states have call predecessors, (26), 7 states have return successors, (30), 8 states have call predecessors, (30), 6 states have call successors, (30)
[2025-05-07 17:27:38,974 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:38,974 INFO  L93              Difference]: Finished difference Result 53 states and 67 transitions.
[2025-05-07 17:27:38,974 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:27:38,975 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), 6 states have call successors, (26), 2 states have call predecessors, (26), 7 states have return successors, (30), 8 states have call predecessors, (30), 6 states have call successors, (30) Word has length 122
[2025-05-07 17:27:38,975 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:38,975 INFO  L225             Difference]: With dead ends: 53
[2025-05-07 17:27:38,975 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:27:38,975 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 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:27:38,975 INFO  L437           NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:38,975 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 375 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:38,976 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:27:38,976 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:27:38,976 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:27:38,976 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:27:38,976 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 122
[2025-05-07 17:27:38,976 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:38,976 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:27:38,976 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), 6 states have call successors, (26), 2 states have call predecessors, (26), 7 states have return successors, (30), 8 states have call predecessors, (30), 6 states have call successors, (30)
[2025-05-07 17:27:38,976 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:27:38,976 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:27:38,978 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:27:38,983 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-05-07 17:27:39,179 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:39,188 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:39,193 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:27:39,200 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:27:39 BoogieIcfgContainer
[2025-05-07 17:27:39,201 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:27:39,202 INFO  L158              Benchmark]: Toolchain (without parser) took 7834.31ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 153.0MB in the beginning and 156.8MB in the end (delta: -3.8MB). Peak memory consumption was 31.6MB. Max. memory is 33.6GB.
[2025-05-07 17:27:39,203 INFO  L158              Benchmark]: SmtParser took 0.32ms. Allocated memory is still 234.9MB. Free memory is still 172.6MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:39,203 INFO  L158              Benchmark]: ChcToBoogie took 29.04ms. Allocated memory is still 234.9MB. Free memory was 153.0MB in the beginning and 148.3MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:39,204 INFO  L158              Benchmark]: Boogie Preprocessor took 50.67ms. Allocated memory is still 234.9MB. Free memory was 148.3MB in the beginning and 145.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:39,204 INFO  L158              Benchmark]: RCFGBuilder took 333.00ms. Allocated memory is still 234.9MB. Free memory was 145.3MB in the beginning and 190.0MB in the end (delta: -44.7MB). Peak memory consumption was 41.8MB. Max. memory is 33.6GB.
[2025-05-07 17:27:39,205 INFO  L158              Benchmark]: TraceAbstraction took 7418.10ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 189.4MB in the beginning and 156.8MB in the end (delta: 32.7MB). Peak memory consumption was 73.7MB. Max. memory is 33.6GB.
[2025-05-07 17:27:39,208 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.32ms. Allocated memory is still 234.9MB. Free memory is still 172.6MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 29.04ms. Allocated memory is still 234.9MB. Free memory was 153.0MB in the beginning and 148.3MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 50.67ms. Allocated memory is still 234.9MB. Free memory was 148.3MB in the beginning and 145.3MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 333.00ms. Allocated memory is still 234.9MB. Free memory was 145.3MB in the beginning and 190.0MB in the end (delta: -44.7MB). Peak memory consumption was 41.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 7418.10ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 189.4MB in the beginning and 156.8MB in the end (delta: 32.7MB). Peak memory consumption was 73.7MB. 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 19 procedures, 79 locations, 126 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 5208 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4352 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 732 IncrementalHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 856 mSDtfsCounter, 732 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=8, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 24 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 975 NumberOfCodeBlocks, 975 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1052 ConstructedInterpolants, 4 QuantifiedInterpolants, 1628 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2648 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 13 InterpolantComputations, 9 PerfectInterpolantSequences, 326/346 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:27:39,241 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
