./chc-comp-wrapper.sh ../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-005.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:48,437 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:48,500 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d31e049e-eb20-4dff-93d9-2e3d9ee18d6c/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:48,505 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:48,506 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:48,546 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:48,547 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:48,547 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:48,548 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:48,548 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:48,549 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:48,550 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:48,550 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:48,550 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:48,550 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:48,550 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:48,550 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:48,550 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:48,551 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:48,551 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:48,551 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:48,551 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:48,551 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:48,551 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:48,551 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:48,552 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:48,552 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:48,889 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:48,901 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:48,903 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:48,906 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:48,907 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:48,908 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d31e049e-eb20-4dff-93d9-2e3d9ee18d6c/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-005.smt2
[2025-04-28 21:21:48,910 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:48,914 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:49,311 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d31e049e-eb20-4dff-93d9-2e3d9ee18d6c/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-005.smt2
[2025-04-28 21:21:49,316 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:49,317 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:49,318 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:49,318 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:49,319 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:49,322 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,382 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49 Unit
[2025-04-28 21:21:49,383 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:49,384 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:49,384 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:49,384 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:49,402 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,402 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,434 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,434 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,442 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,447 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,449 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,454 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,455 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,489 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:49,490 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:49,491 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:49,491 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:49,492 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,495 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:49,509 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:49,525 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-04-28 21:21:49,532 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-04-28 21:21:49,551 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:49,551 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:49,551 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:49,551 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATverifier.error.split given in one single declaration
[2025-04-28 21:21:49,551 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATverifier.error.split
[2025-04-28 21:21:49,552 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATverifier.error.split
[2025-04-28 21:21:49,554 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb6 given in one single declaration
[2025-04-28 21:21:49,554 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb6
[2025-04-28 21:21:49,554 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb6
[2025-04-28 21:21:49,554 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure __VERIFIER_assert given in one single declaration
[2025-04-28 21:21:49,554 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2025-04-28 21:21:49,554 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2025-04-28 21:21:49,554 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure __VERIFIER_assert.AT_ret given in one single declaration
[2025-04-28 21:21:49,555 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert.AT_ret
[2025-04-28 21:21:49,555 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert.AT_ret
[2025-04-28 21:21:49,555 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure __VERIFIER_assert.AT_call given in one single declaration
[2025-04-28 21:21:49,555 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert.AT_call
[2025-04-28 21:21:49,555 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert.AT_call
[2025-04-28 21:21:49,555 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb given in one single declaration
[2025-04-28 21:21:49,555 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb
[2025-04-28 21:21:49,555 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb
[2025-04-28 21:21:49,555 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATentry given in one single declaration
[2025-04-28 21:21:49,555 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATentry
[2025-04-28 21:21:49,555 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATentry
[2025-04-28 21:21:49,555 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb2 given in one single declaration
[2025-04-28 21:21:49,556 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb2
[2025-04-28 21:21:49,556 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb2
[2025-04-28 21:21:49,556 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:49,556 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:49,556 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:49,675 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:49,678 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:49,997 INFO  L?                        ?]: Removed 88 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:49,997 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:50,014 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:50,017 INFO  L312             CfgBuilder]: Removed 3 assume(true) statements.
[2025-04-28 21:21:50,017 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:50 BoogieIcfgContainer
[2025-04-28 21:21:50,017 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:50,021 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:50,022 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:50,026 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:50,026 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:49" (1/3) ...
[2025-04-28 21:21:50,027 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263cfc76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:50, skipping insertion in model container
[2025-04-28 21:21:50,027 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (2/3) ...
[2025-04-28 21:21:50,027 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263cfc76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:50, skipping insertion in model container
[2025-04-28 21:21:50,028 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:50" (3/3) ...
[2025-04-28 21:21:50,030 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:50,044 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:50,047 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 10 procedures, 40 locations, 60 edges, 10 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:50,093 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:50,112 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;@2d02c823, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:50,112 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:50,116 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 40 states, 17 states have (on average 1.411764705882353) internal successors, (24), 22 states have internal predecessors, (24), 12 states have call successors, (12), 9 states have call predecessors, (12), 9 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12)
[2025-04-28 21:21:50,124 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-04-28 21:21:50,125 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:50,125 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:50,126 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:50,132 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:50,132 INFO  L85        PathProgramCache]: Analyzing trace with hash 1341552289, now seen corresponding path program 1 times
[2025-04-28 21:21:50,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:50,141 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552906224]
[2025-04-28 21:21:50,141 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:50,142 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:50,188 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-28 21:21:50,244 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-28 21:21:50,246 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:50,246 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:50,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:50,863 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:50,863 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552906224]
[2025-04-28 21:21:50,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552906224] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:50,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:50,868 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:50,869 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942685906]
[2025-04-28 21:21:50,872 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:50,876 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:50,877 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:50,908 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:50,910 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:50,912 INFO  L87              Difference]: Start difference. First operand  has 40 states, 17 states have (on average 1.411764705882353) internal successors, (24), 22 states have internal predecessors, (24), 12 states have call successors, (12), 9 states have call predecessors, (12), 9 states have return successors, (12), 9 states have call predecessors, (12), 12 states have call successors, (12) Second operand  has 6 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:51,107 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:51,111 INFO  L93              Difference]: Finished difference Result 44 states and 54 transitions.
[2025-04-28 21:21:51,112 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:51,113 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 19
[2025-04-28 21:21:51,114 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:51,125 INFO  L225             Difference]: With dead ends: 44
[2025-04-28 21:21:51,126 INFO  L226             Difference]: Without dead ends: 44
[2025-04-28 21:21:51,130 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:51,135 INFO  L437           NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:51,136 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 195 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:51,179 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2025-04-28 21:21:51,198 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42.
[2025-04-28 21:21:51,199 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 22 states have internal predecessors, (24), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15)
[2025-04-28 21:21:51,215 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions.
[2025-04-28 21:21:51,217 INFO  L79                 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 19
[2025-04-28 21:21:51,218 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:51,218 INFO  L485      AbstractCegarLoop]: Abstraction has 42 states and 51 transitions.
[2025-04-28 21:21:51,218 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:51,218 INFO  L278                IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions.
[2025-04-28 21:21:51,220 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-04-28 21:21:51,220 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:51,220 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-04-28 21:21:51,228 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:51,228 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:51,229 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:51,229 INFO  L85        PathProgramCache]: Analyzing trace with hash -1752281018, now seen corresponding path program 1 times
[2025-04-28 21:21:51,229 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:51,229 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770028640]
[2025-04-28 21:21:51,229 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,230 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:51,271 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-04-28 21:21:51,295 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-04-28 21:21:51,299 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,302 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:51,380 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:51,381 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770028640]
[2025-04-28 21:21:51,381 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770028640] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:51,381 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:51,381 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:51,381 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280723363]
[2025-04-28 21:21:51,381 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:51,383 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:51,383 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:51,384 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:51,384 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:51,384 INFO  L87              Difference]: Start difference. First operand 42 states and 51 transitions. Second operand  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7)
[2025-04-28 21:21:51,399 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:51,399 INFO  L93              Difference]: Finished difference Result 46 states and 55 transitions.
[2025-04-28 21:21:51,400 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:51,400 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 27
[2025-04-28 21:21:51,400 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:51,401 INFO  L225             Difference]: With dead ends: 46
[2025-04-28 21:21:51,401 INFO  L226             Difference]: Without dead ends: 44
[2025-04-28 21:21:51,402 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-04-28 21:21:51,403 INFO  L437           NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:51,403 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 134 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:51,404 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2025-04-28 21:21:51,409 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42.
[2025-04-28 21:21:51,409 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 22 states have internal predecessors, (22), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15)
[2025-04-28 21:21:51,410 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions.
[2025-04-28 21:21:51,411 INFO  L79                 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 27
[2025-04-28 21:21:51,411 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:51,411 INFO  L485      AbstractCegarLoop]: Abstraction has 42 states and 49 transitions.
[2025-04-28 21:21:51,411 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7)
[2025-04-28 21:21:51,412 INFO  L278                IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions.
[2025-04-28 21:21:51,413 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-04-28 21:21:51,413 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:51,413 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-04-28 21:21:51,413 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:51,413 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:51,414 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:51,414 INFO  L85        PathProgramCache]: Analyzing trace with hash -966226998, now seen corresponding path program 1 times
[2025-04-28 21:21:51,414 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:51,414 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258127240]
[2025-04-28 21:21:51,414 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,414 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:51,434 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-04-28 21:21:51,452 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-04-28 21:21:51,452 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,452 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,575 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:51,575 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:51,575 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258127240]
[2025-04-28 21:21:51,575 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258127240] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:51,575 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:51,575 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:51,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449015425]
[2025-04-28 21:21:51,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:51,576 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:51,576 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:51,576 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:51,577 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:51,577 INFO  L87              Difference]: Start difference. First operand 42 states and 49 transitions. Second operand  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7)
[2025-04-28 21:21:51,594 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:51,594 INFO  L93              Difference]: Finished difference Result 46 states and 53 transitions.
[2025-04-28 21:21:51,598 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:51,598 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 27
[2025-04-28 21:21:51,598 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:51,600 INFO  L225             Difference]: With dead ends: 46
[2025-04-28 21:21:51,600 INFO  L226             Difference]: Without dead ends: 44
[2025-04-28 21:21:51,600 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-04-28 21:21:51,601 INFO  L437           NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 130 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-04-28 21:21:51,601 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:51,602 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 44 states.
[2025-04-28 21:21:51,612 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42.
[2025-04-28 21:21:51,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 21 states have internal predecessors, (21), 12 states have call successors, (12), 9 states have call predecessors, (12), 11 states have return successors, (15), 11 states have call predecessors, (15), 12 states have call successors, (15)
[2025-04-28 21:21:51,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions.
[2025-04-28 21:21:51,614 INFO  L79                 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 27
[2025-04-28 21:21:51,614 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:51,614 INFO  L485      AbstractCegarLoop]: Abstraction has 42 states and 48 transitions.
[2025-04-28 21:21:51,614 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7)
[2025-04-28 21:21:51,614 INFO  L278                IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions.
[2025-04-28 21:21:51,615 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-04-28 21:21:51,615 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:51,615 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-04-28 21:21:51,615 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:51,616 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:51,620 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:51,620 INFO  L85        PathProgramCache]: Analyzing trace with hash -455935904, now seen corresponding path program 1 times
[2025-04-28 21:21:51,620 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:51,620 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384815658]
[2025-04-28 21:21:51,620 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,620 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:51,638 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-04-28 21:21:51,672 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-04-28 21:21:51,672 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,672 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:52,916 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:52,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:52,917 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384815658]
[2025-04-28 21:21:52,917 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384815658] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:52,917 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966278542]
[2025-04-28 21:21:52,917 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:52,917 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:52,923 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:52,929 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:52,933 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:53,009 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-04-28 21:21:53,052 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-04-28 21:21:53,052 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:53,052 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:53,056 INFO  L256         TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 65 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:53,068 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:53,604 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-04-28 21:21:53,605 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16
[2025-04-28 21:21:53,665 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:53,666 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:57,260 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-04-28 21:21:57,261 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 18
[2025-04-28 21:21:57,969 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-04-28 21:21:57,970 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 18
[2025-04-28 21:21:58,260 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5
[2025-04-28 21:21:58,406 INFO  L325             Elim1Store]: treesize reduction 14, result has 6.7 percent of original size
[2025-04-28 21:21:58,407 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 1
[2025-04-28 21:21:58,436 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:58,436 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [966278542] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:58,437 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:58,437 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 18
[2025-04-28 21:21:58,437 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853631207]
[2025-04-28 21:21:58,437 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:58,437 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2025-04-28 21:21:58,438 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:58,438 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2025-04-28 21:21:58,440 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306
[2025-04-28 21:21:58,441 INFO  L87              Difference]: Start difference. First operand 42 states and 48 transitions. Second operand  has 18 states, 8 states have (on average 2.625) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (15), 7 states have call predecessors, (15), 12 states have call successors, (15)
[2025-04-28 21:21:58,675 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:58,675 INFO  L93              Difference]: Finished difference Result 52 states and 62 transitions.
[2025-04-28 21:21:58,676 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:21:58,676 INFO  L79                 Accepts]: Start accepts. Automaton has  has 18 states, 8 states have (on average 2.625) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (15), 7 states have call predecessors, (15), 12 states have call successors, (15) Word has length 27
[2025-04-28 21:21:58,676 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:58,677 INFO  L225             Difference]: With dead ends: 52
[2025-04-28 21:21:58,677 INFO  L226             Difference]: Without dead ends: 52
[2025-04-28 21:21:58,678 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380
[2025-04-28 21:21:58,678 INFO  L437           NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:58,679 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 327 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:58,680 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 52 states.
[2025-04-28 21:21:58,685 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46.
[2025-04-28 21:21:58,685 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 46 states, 20 states have (on average 1.15) internal successors, (23), 23 states have internal predecessors, (23), 12 states have call successors, (12), 9 states have call predecessors, (12), 13 states have return successors, (19), 13 states have call predecessors, (19), 12 states have call successors, (19)
[2025-04-28 21:21:58,690 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions.
[2025-04-28 21:21:58,690 INFO  L79                 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 27
[2025-04-28 21:21:58,691 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:58,691 INFO  L485      AbstractCegarLoop]: Abstraction has 46 states and 54 transitions.
[2025-04-28 21:21:58,691 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 8 states have (on average 2.625) internal successors, (21), 18 states have internal predecessors, (21), 12 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (15), 7 states have call predecessors, (15), 12 states have call successors, (15)
[2025-04-28 21:21:58,691 INFO  L278                IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions.
[2025-04-28 21:21:58,692 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2025-04-28 21:21:58,692 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:58,692 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:58,699 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:58,893 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:58,893 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:58,893 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:58,893 INFO  L85        PathProgramCache]: Analyzing trace with hash 1580826280, now seen corresponding path program 1 times
[2025-04-28 21:21:58,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:58,894 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280138522]
[2025-04-28 21:21:58,894 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:58,894 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:58,908 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-04-28 21:21:58,951 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-04-28 21:21:58,952 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:58,952 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:00,147 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:22:00,148 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:00,148 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280138522]
[2025-04-28 21:22:00,148 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280138522] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:00,148 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619566008]
[2025-04-28 21:22:00,148 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:00,148 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:00,152 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:00,155 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:22:00,159 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:22:00,248 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-04-28 21:22:00,283 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-04-28 21:22:00,283 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:00,283 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:00,286 INFO  L256         TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 73 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:00,290 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:00,484 INFO  L325             Elim1Store]: treesize reduction 20, result has 57.4 percent of original size
[2025-04-28 21:22:00,485 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 50
[2025-04-28 21:22:00,953 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-04-28 21:22:00,953 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18
[2025-04-28 21:22:01,013 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:22:01,013 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:05,623 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 37 treesize of output 15
[2025-04-28 21:22:06,866 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 15
[2025-04-28 21:22:07,645 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-04-28 21:22:07,646 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 19
[2025-04-28 21:22:07,710 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-04-28 21:22:07,710 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 3
[2025-04-28 21:22:08,047 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2025-04-28 21:22:08,048 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:22:08,054 INFO  L325             Elim1Store]: treesize reduction 12, result has 7.7 percent of original size
[2025-04-28 21:22:08,055 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 1
[2025-04-28 21:22:08,081 INFO  L325             Elim1Store]: treesize reduction 7, result has 12.5 percent of original size
[2025-04-28 21:22:08,082 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 1
[2025-04-28 21:22:08,109 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:22:08,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [619566008] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:08,110 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:08,110 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 21
[2025-04-28 21:22:08,110 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720921087]
[2025-04-28 21:22:08,110 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:08,111 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2025-04-28 21:22:08,111 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:08,112 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2025-04-28 21:22:08,112 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420
[2025-04-28 21:22:08,112 INFO  L87              Difference]: Start difference. First operand 46 states and 54 transitions. Second operand  has 21 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 21 states have internal predecessors, (24), 14 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (17), 8 states have call predecessors, (17), 14 states have call successors, (17)
[2025-04-28 21:22:08,605 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:08,605 INFO  L93              Difference]: Finished difference Result 56 states and 68 transitions.
[2025-04-28 21:22:08,606 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:22:08,606 INFO  L79                 Accepts]: Start accepts. Automaton has  has 21 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 21 states have internal predecessors, (24), 14 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (17), 8 states have call predecessors, (17), 14 states have call successors, (17) Word has length 31
[2025-04-28 21:22:08,606 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:08,607 INFO  L225             Difference]: With dead ends: 56
[2025-04-28 21:22:08,607 INFO  L226             Difference]: Without dead ends: 56
[2025-04-28 21:22:08,608 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600
[2025-04-28 21:22:08,609 INFO  L437           NwaCegarLoop]: 42 mSDtfsCounter, 9 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:08,609 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 663 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:22:08,610 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 56 states.
[2025-04-28 21:22:08,616 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48.
[2025-04-28 21:22:08,616 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 24 states have internal predecessors, (24), 12 states have call successors, (12), 9 states have call predecessors, (12), 14 states have return successors, (21), 14 states have call predecessors, (21), 12 states have call successors, (21)
[2025-04-28 21:22:08,617 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions.
[2025-04-28 21:22:08,617 INFO  L79                 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 31
[2025-04-28 21:22:08,617 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:08,617 INFO  L485      AbstractCegarLoop]: Abstraction has 48 states and 57 transitions.
[2025-04-28 21:22:08,618 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 21 states have internal predecessors, (24), 14 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (17), 8 states have call predecessors, (17), 14 states have call successors, (17)
[2025-04-28 21:22:08,618 INFO  L278                IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions.
[2025-04-28 21:22:08,619 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2025-04-28 21:22:08,619 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:08,619 INFO  L218           NwaCegarLoop]: trace histogram [3, 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]
[2025-04-28 21:22:08,624 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:22:08,819 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:08,820 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:08,820 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:08,820 INFO  L85        PathProgramCache]: Analyzing trace with hash 447967600, now seen corresponding path program 2 times
[2025-04-28 21:22:08,820 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:08,820 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885573191]
[2025-04-28 21:22:08,820 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:22:08,820 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:08,833 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes.
[2025-04-28 21:22:08,853 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements.
[2025-04-28 21:22:08,854 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:22:08,854 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:09,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:22:09,182 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:09,182 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885573191]
[2025-04-28 21:22:09,182 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885573191] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:09,182 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482960416]
[2025-04-28 21:22:09,182 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:22:09,183 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:09,188 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:09,190 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:22:09,194 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:22:09,304 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes.
[2025-04-28 21:22:09,349 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements.
[2025-04-28 21:22:09,349 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:22:09,349 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:09,353 INFO  L256         TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 27 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:09,355 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:09,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:22:09,485 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:11,529 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:22:11,529 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [482960416] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:11,529 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:11,529 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12
[2025-04-28 21:22:11,530 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695346965]
[2025-04-28 21:22:11,530 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:11,530 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-04-28 21:22:11,530 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:11,531 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-04-28 21:22:11,531 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:22:11,531 INFO  L87              Difference]: Start difference. First operand 48 states and 57 transitions. Second operand  has 12 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 12 states have internal predecessors, (22), 9 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (13), 5 states have call predecessors, (13), 9 states have call successors, (13)
[2025-04-28 21:22:11,665 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:11,666 INFO  L93              Difference]: Finished difference Result 50 states and 59 transitions.
[2025-04-28 21:22:11,666 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:22:11,666 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 12 states have internal predecessors, (22), 9 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (13), 5 states have call predecessors, (13), 9 states have call successors, (13) Word has length 35
[2025-04-28 21:22:11,666 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:11,667 INFO  L225             Difference]: With dead ends: 50
[2025-04-28 21:22:11,667 INFO  L226             Difference]: Without dead ends: 50
[2025-04-28 21:22:11,668 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:22:11,668 INFO  L437           NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:11,669 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 289 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:22:11,669 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2025-04-28 21:22:11,674 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48.
[2025-04-28 21:22:11,674 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 24 states have internal predecessors, (24), 12 states have call successors, (12), 9 states have call predecessors, (12), 14 states have return successors, (20), 14 states have call predecessors, (20), 12 states have call successors, (20)
[2025-04-28 21:22:11,675 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions.
[2025-04-28 21:22:11,675 INFO  L79                 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 35
[2025-04-28 21:22:11,676 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:11,676 INFO  L485      AbstractCegarLoop]: Abstraction has 48 states and 56 transitions.
[2025-04-28 21:22:11,676 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 12 states have internal predecessors, (22), 9 states have call successors, (13), 1 states have call predecessors, (13), 6 states have return successors, (13), 5 states have call predecessors, (13), 9 states have call successors, (13)
[2025-04-28 21:22:11,676 INFO  L278                IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions.
[2025-04-28 21:22:11,677 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2025-04-28 21:22:11,677 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:11,677 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:11,685 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-04-28 21:22:11,877 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:11,878 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:11,878 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:11,878 INFO  L85        PathProgramCache]: Analyzing trace with hash 765568671, now seen corresponding path program 2 times
[2025-04-28 21:22:11,878 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:11,879 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808032677]
[2025-04-28 21:22:11,879 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:22:11,879 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:11,890 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes.
[2025-04-28 21:22:11,914 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements.
[2025-04-28 21:22:11,914 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:22:11,914 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:13,191 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:22:13,192 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:13,193 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808032677]
[2025-04-28 21:22:13,193 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808032677] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:13,193 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264474499]
[2025-04-28 21:22:13,193 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:22:13,193 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:13,197 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:13,199 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:22:13,203 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:22:13,340 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes.
[2025-04-28 21:22:13,383 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements.
[2025-04-28 21:22:13,383 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:22:13,383 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:13,390 INFO  L256         TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 89 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:13,394 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:13,757 INFO  L325             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2025-04-28 21:22:13,758 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 16
[2025-04-28 21:22:13,872 INFO  L325             Elim1Store]: treesize reduction 42, result has 23.6 percent of original size
[2025-04-28 21:22:13,873 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 16
[2025-04-28 21:22:13,927 INFO  L134       CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:22:13,927 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
