./chc-comp-wrapper.sh ../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-176.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:52,450 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:52,528 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08db6270-3cd0-4d21-9795-a0a9e1631acc/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:52,534 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:52,538 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:52,575 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:52,578 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:52,578 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:52,579 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:52,580 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:52,581 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:52,581 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:52,582 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:52,582 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:52,582 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:52,583 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:52,583 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:52,583 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:52,583 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:52,584 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:52,584 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:52,584 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:52,584 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:52,584 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:52,584 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:52,585 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:52,585 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:52,981 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:52,994 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:52,997 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:53,000 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:53,000 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:53,002 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08db6270-3cd0-4d21-9795-a0a9e1631acc/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-176.smt2
[2025-04-28 21:21:53,004 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:53,010 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:53,307 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08db6270-3cd0-4d21-9795-a0a9e1631acc/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-176.smt2
[2025-04-28 21:21:53,311 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:53,314 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:53,315 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:53,315 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:53,316 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:53,323 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:53" (1/1) ...
[2025-04-28 21:21:53,357 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:53 Unit
[2025-04-28 21:21:53,358 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:53,359 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:53,359 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:53,359 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:53,378 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:53" (1/1) ...
[2025-04-28 21:21:53,378 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:53" (1/1) ...
[2025-04-28 21:21:53,401 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:53" (1/1) ...
[2025-04-28 21:21:53,402 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:53" (1/1) ...
[2025-04-28 21:21:53,405 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:53" (1/1) ...
[2025-04-28 21:21:53,406 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:53" (1/1) ...
[2025-04-28 21:21:53,409 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:53" (1/1) ...
[2025-04-28 21:21:53,410 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:53" (1/1) ...
[2025-04-28 21:21:53,411 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:53" (1/1) ...
[2025-04-28 21:21:53,425 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:53,426 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:53,426 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:53,426 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:53,427 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:53" (1/1) ...
[2025-04-28 21:21:53,431 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:53,445 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:53,462 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:53,469 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:53,486 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:53,487 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:53,487 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:53,487 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure END_QUERY given in one single declaration
[2025-04-28 21:21:53,487 INFO  L130     BoogieDeclarations]: Found specification of procedure END_QUERY
[2025-04-28 21:21:53,487 INFO  L138     BoogieDeclarations]: Found implementation of procedure END_QUERY
[2025-04-28 21:21:53,488 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f__1 given in one single declaration
[2025-04-28 21:21:53,488 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f__1
[2025-04-28 21:21:53,488 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f__1
[2025-04-28 21:21:53,488 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f__1_PRE given in one single declaration
[2025-04-28 21:21:53,489 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f__1_PRE
[2025-04-28 21:21:53,489 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f__1_PRE
[2025-04-28 21:21:53,490 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f^f_PRE given in one single declaration
[2025-04-28 21:21:53,490 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f^f_PRE
[2025-04-28 21:21:53,490 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f^f_PRE
[2025-04-28 21:21:53,490 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f^f given in one single declaration
[2025-04-28 21:21:53,490 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f^f
[2025-04-28 21:21:53,491 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f^f
[2025-04-28 21:21:53,491 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f__2 given in one single declaration
[2025-04-28 21:21:53,492 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f__2
[2025-04-28 21:21:53,492 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f__2
[2025-04-28 21:21:53,492 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_REC_f__2_PRE given in one single declaration
[2025-04-28 21:21:53,493 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_REC_f__2_PRE
[2025-04-28 21:21:53,493 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_REC_f__2_PRE
[2025-04-28 21:21:53,493 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:53,493 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:53,493 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:53,555 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:53,558 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:53,832 INFO  L?                        ?]: Removed 8 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:53,832 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:53,848 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:53,848 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-04-28 21:21:53,849 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:53 BoogieIcfgContainer
[2025-04-28 21:21:53,849 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:53,852 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:53,853 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:53,858 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:53,858 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:53" (1/3) ...
[2025-04-28 21:21:53,859 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2e3c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:53, skipping insertion in model container
[2025-04-28 21:21:53,859 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:53" (2/3) ...
[2025-04-28 21:21:53,859 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2e3c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:53, skipping insertion in model container
[2025-04-28 21:21:53,860 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:53" (3/3) ...
[2025-04-28 21:21:53,861 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:53,880 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:53,884 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 9 procedures, 50 locations, 99 edges, 9 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:53,938 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:53,965 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;@164ebb8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:53,965 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:53,973 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 50 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 30 states have internal predecessors, (30), 23 states have call successors, (23), 8 states have call predecessors, (23), 8 states have return successors, (23), 14 states have call predecessors, (23), 23 states have call successors, (23)
[2025-04-28 21:21:53,990 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:53,990 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:53,991 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:53,991 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:54,003 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:54,004 INFO  L85        PathProgramCache]: Analyzing trace with hash -1817680425, now seen corresponding path program 1 times
[2025-04-28 21:21:54,014 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:54,015 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544231215]
[2025-04-28 21:21:54,015 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:54,016 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:54,054 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:54,059 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:54,060 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:54,061 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:54,126 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:54,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:54,127 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544231215]
[2025-04-28 21:21:54,129 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544231215] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:54,129 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:54,135 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-04-28 21:21:54,136 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478305373]
[2025-04-28 21:21:54,137 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:54,142 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-04-28 21:21:54,143 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:54,183 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-04-28 21:21:54,184 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-04-28 21:21:54,186 INFO  L87              Difference]: Start difference. First operand  has 50 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 30 states have internal predecessors, (30), 23 states have call successors, (23), 8 states have call predecessors, (23), 8 states have return successors, (23), 14 states have call predecessors, (23), 23 states have call successors, (23) Second operand  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:54,223 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:54,225 INFO  L93              Difference]: Finished difference Result 47 states and 70 transitions.
[2025-04-28 21:21:54,227 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-04-28 21:21:54,229 INFO  L79                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 16
[2025-04-28 21:21:54,229 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:54,240 INFO  L225             Difference]: With dead ends: 47
[2025-04-28 21:21:54,240 INFO  L226             Difference]: Without dead ends: 47
[2025-04-28 21:21:54,243 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-04-28 21:21:54,248 INFO  L437           NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:54,249 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:54,273 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2025-04-28 21:21:54,348 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47.
[2025-04-28 21:21:54,349 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 47 states, 16 states have (on average 1.625) internal successors, (26), 26 states have internal predecessors, (26), 22 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 14 states have call predecessors, (22), 22 states have call successors, (22)
[2025-04-28 21:21:54,360 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions.
[2025-04-28 21:21:54,365 INFO  L79                 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 16
[2025-04-28 21:21:54,365 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:54,365 INFO  L485      AbstractCegarLoop]: Abstraction has 47 states and 70 transitions.
[2025-04-28 21:21:54,366 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:54,366 INFO  L278                IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions.
[2025-04-28 21:21:54,369 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:54,369 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:54,369 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:54,372 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:54,372 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:54,374 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:54,374 INFO  L85        PathProgramCache]: Analyzing trace with hash 125778074, now seen corresponding path program 1 times
[2025-04-28 21:21:54,375 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:54,375 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944164886]
[2025-04-28 21:21:54,375 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:54,375 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:54,385 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:54,444 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:54,444 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:54,444 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:54,780 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:54,780 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:54,780 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944164886]
[2025-04-28 21:21:54,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944164886] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:54,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:54,781 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:54,781 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611385702]
[2025-04-28 21:21:54,781 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:54,782 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:54,783 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:54,783 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:54,784 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:54,784 INFO  L87              Difference]: Start difference. First operand 47 states and 70 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:54,849 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:54,849 INFO  L93              Difference]: Finished difference Result 49 states and 73 transitions.
[2025-04-28 21:21:54,850 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:54,850 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-04-28 21:21:54,851 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:54,852 INFO  L225             Difference]: With dead ends: 49
[2025-04-28 21:21:54,852 INFO  L226             Difference]: Without dead ends: 49
[2025-04-28 21:21:54,853 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:54,854 INFO  L437           NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:54,855 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 193 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:54,856 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2025-04-28 21:21:54,865 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49.
[2025-04-28 21:21:54,866 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 49 states, 17 states have (on average 1.588235294117647) internal successors, (27), 27 states have internal predecessors, (27), 22 states have call successors, (22), 8 states have call predecessors, (22), 9 states have return successors, (24), 15 states have call predecessors, (24), 22 states have call successors, (24)
[2025-04-28 21:21:54,868 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 73 transitions.
[2025-04-28 21:21:54,868 INFO  L79                 Accepts]: Start accepts. Automaton has 49 states and 73 transitions. Word has length 16
[2025-04-28 21:21:54,868 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:54,868 INFO  L485      AbstractCegarLoop]: Abstraction has 49 states and 73 transitions.
[2025-04-28 21:21:54,869 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:54,869 INFO  L278                IsEmpty]: Start isEmpty. Operand 49 states and 73 transitions.
[2025-04-28 21:21:54,870 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:54,871 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:54,871 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:54,871 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:54,871 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:54,872 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:54,872 INFO  L85        PathProgramCache]: Analyzing trace with hash 629801592, now seen corresponding path program 1 times
[2025-04-28 21:21:54,872 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:54,872 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092375384]
[2025-04-28 21:21:54,872 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:54,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:54,880 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:54,891 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:54,891 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:54,891 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:54,975 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:54,975 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:54,975 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092375384]
[2025-04-28 21:21:54,976 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092375384] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:54,976 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:54,976 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:54,976 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204265009]
[2025-04-28 21:21:54,976 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:54,976 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:54,976 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:54,977 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:54,977 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:54,977 INFO  L87              Difference]: Start difference. First operand 49 states and 73 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:55,007 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:55,007 INFO  L93              Difference]: Finished difference Result 53 states and 77 transitions.
[2025-04-28 21:21:55,009 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:55,009 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-04-28 21:21:55,010 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:55,011 INFO  L225             Difference]: With dead ends: 53
[2025-04-28 21:21:55,013 INFO  L226             Difference]: Without dead ends: 53
[2025-04-28 21:21:55,014 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:55,015 INFO  L437           NwaCegarLoop]: 70 mSDtfsCounter, 1 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:55,015 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 199 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:55,016 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2025-04-28 21:21:55,032 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51.
[2025-04-28 21:21:55,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 28 states have internal predecessors, (28), 22 states have call successors, (22), 8 states have call predecessors, (22), 10 states have return successors, (25), 16 states have call predecessors, (25), 22 states have call successors, (25)
[2025-04-28 21:21:55,036 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions.
[2025-04-28 21:21:55,036 INFO  L79                 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 16
[2025-04-28 21:21:55,038 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:55,038 INFO  L485      AbstractCegarLoop]: Abstraction has 51 states and 75 transitions.
[2025-04-28 21:21:55,038 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:55,038 INFO  L278                IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions.
[2025-04-28 21:21:55,043 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:55,043 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:55,043 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]
[2025-04-28 21:21:55,043 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:55,044 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:55,044 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:55,046 INFO  L85        PathProgramCache]: Analyzing trace with hash 1697388893, now seen corresponding path program 1 times
[2025-04-28 21:21:55,046 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:55,046 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663502868]
[2025-04-28 21:21:55,046 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:55,047 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:55,058 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:55,083 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:55,083 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:55,083 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:55,514 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:55,514 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:55,514 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663502868]
[2025-04-28 21:21:55,514 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663502868] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:55,514 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:55,515 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:55,515 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580988181]
[2025-04-28 21:21:55,515 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:55,515 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:55,515 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:55,518 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:55,518 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:55,519 INFO  L87              Difference]: Start difference. First operand 51 states and 75 transitions. Second operand  has 6 states, 4 states have (on average 3.0) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:55,705 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:55,705 INFO  L93              Difference]: Finished difference Result 59 states and 84 transitions.
[2025-04-28 21:21:55,708 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:55,708 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 3.0) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24
[2025-04-28 21:21:55,709 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:55,710 INFO  L225             Difference]: With dead ends: 59
[2025-04-28 21:21:55,710 INFO  L226             Difference]: Without dead ends: 59
[2025-04-28 21:21:55,710 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:55,711 INFO  L437           NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:55,715 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 314 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:55,716 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2025-04-28 21:21:55,732 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51.
[2025-04-28 21:21:55,732 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 28 states have internal predecessors, (28), 22 states have call successors, (22), 8 states have call predecessors, (22), 10 states have return successors, (25), 16 states have call predecessors, (25), 22 states have call successors, (25)
[2025-04-28 21:21:55,733 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions.
[2025-04-28 21:21:55,736 INFO  L79                 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 24
[2025-04-28 21:21:55,736 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:55,736 INFO  L485      AbstractCegarLoop]: Abstraction has 51 states and 75 transitions.
[2025-04-28 21:21:55,737 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 3.0) internal successors, (12), 6 states have internal predecessors, (12), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:55,737 INFO  L278                IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions.
[2025-04-28 21:21:55,738 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:55,739 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:55,739 INFO  L218           NwaCegarLoop]: trace histogram [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:21:55,744 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:21:55,744 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:55,745 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:55,745 INFO  L85        PathProgramCache]: Analyzing trace with hash 501179777, now seen corresponding path program 1 times
[2025-04-28 21:21:55,745 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:55,745 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996089181]
[2025-04-28 21:21:55,745 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:55,745 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:55,753 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:55,763 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:55,763 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:55,763 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:55,823 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:55,823 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:55,823 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996089181]
[2025-04-28 21:21:55,823 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996089181] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:55,823 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:55,823 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:55,823 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329910747]
[2025-04-28 21:21:55,824 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:55,824 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:55,826 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:55,826 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:55,826 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:55,827 INFO  L87              Difference]: Start difference. First operand 51 states and 75 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:55,869 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:55,871 INFO  L93              Difference]: Finished difference Result 51 states and 74 transitions.
[2025-04-28 21:21:55,871 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:55,872 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 24
[2025-04-28 21:21:55,872 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:55,873 INFO  L225             Difference]: With dead ends: 51
[2025-04-28 21:21:55,875 INFO  L226             Difference]: Without dead ends: 50
[2025-04-28 21:21:55,876 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:55,877 INFO  L437           NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:55,877 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:55,878 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2025-04-28 21:21:55,890 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50.
[2025-04-28 21:21:55,890 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 50 states, 18 states have (on average 1.5) internal successors, (27), 27 states have internal predecessors, (27), 21 states have call successors, (21), 8 states have call predecessors, (21), 10 states have return successors, (24), 16 states have call predecessors, (24), 21 states have call successors, (24)
[2025-04-28 21:21:55,895 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions.
[2025-04-28 21:21:55,895 INFO  L79                 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 24
[2025-04-28 21:21:55,895 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:55,895 INFO  L485      AbstractCegarLoop]: Abstraction has 50 states and 72 transitions.
[2025-04-28 21:21:55,895 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:55,896 INFO  L278                IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions.
[2025-04-28 21:21:55,897 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:55,900 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:55,900 INFO  L218           NwaCegarLoop]: trace histogram [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:21:55,901 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-04-28 21:21:55,901 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:55,901 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:55,901 INFO  L85        PathProgramCache]: Analyzing trace with hash 1414747403, now seen corresponding path program 1 times
[2025-04-28 21:21:55,901 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:55,901 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828855231]
[2025-04-28 21:21:55,901 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:55,902 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:55,908 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:55,916 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:55,919 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:55,919 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:55,979 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:55,979 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:55,981 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828855231]
[2025-04-28 21:21:55,981 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828855231] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:55,981 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240984960]
[2025-04-28 21:21:55,981 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:55,982 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:55,985 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:55,988 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:55,993 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:56,054 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:56,094 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:56,094 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:56,094 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:56,097 INFO  L256         TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:56,104 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:56,271 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:56,272 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:56,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:56,867 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240984960] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:56,867 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:56,867 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 9
[2025-04-28 21:21:56,868 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546275062]
[2025-04-28 21:21:56,868 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:56,868 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:56,868 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:56,869 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:56,869 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:56,870 INFO  L87              Difference]: Start difference. First operand 50 states and 72 transitions. Second operand  has 9 states, 5 states have (on average 3.4) internal successors, (17), 9 states have internal predecessors, (17), 8 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (12), 3 states have call predecessors, (12), 8 states have call successors, (12)
[2025-04-28 21:21:57,122 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:57,122 INFO  L93              Difference]: Finished difference Result 61 states and 90 transitions.
[2025-04-28 21:21:57,122 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:57,123 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 5 states have (on average 3.4) internal successors, (17), 9 states have internal predecessors, (17), 8 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (12), 3 states have call predecessors, (12), 8 states have call successors, (12) Word has length 24
[2025-04-28 21:21:57,123 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:57,124 INFO  L225             Difference]: With dead ends: 61
[2025-04-28 21:21:57,124 INFO  L226             Difference]: Without dead ends: 61
[2025-04-28 21:21:57,125 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:57,125 INFO  L437           NwaCegarLoop]: 64 mSDtfsCounter, 5 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:57,130 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 339 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:57,131 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61 states.
[2025-04-28 21:21:57,143 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55.
[2025-04-28 21:21:57,143 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 55 states, 20 states have (on average 1.45) internal successors, (29), 29 states have internal predecessors, (29), 22 states have call successors, (22), 8 states have call predecessors, (22), 12 states have return successors, (32), 18 states have call predecessors, (32), 22 states have call successors, (32)
[2025-04-28 21:21:57,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions.
[2025-04-28 21:21:57,145 INFO  L79                 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 24
[2025-04-28 21:21:57,145 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:57,145 INFO  L485      AbstractCegarLoop]: Abstraction has 55 states and 83 transitions.
[2025-04-28 21:21:57,146 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 5 states have (on average 3.4) internal successors, (17), 9 states have internal predecessors, (17), 8 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (12), 3 states have call predecessors, (12), 8 states have call successors, (12)
[2025-04-28 21:21:57,146 INFO  L278                IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions.
[2025-04-28 21:21:57,147 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-04-28 21:21:57,147 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:57,147 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-04-28 21:21:57,153 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:57,352 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6
[2025-04-28 21:21:57,352 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:57,353 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:57,353 INFO  L85        PathProgramCache]: Analyzing trace with hash -1449449084, now seen corresponding path program 1 times
[2025-04-28 21:21:57,353 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:57,353 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209015954]
[2025-04-28 21:21:57,353 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:57,353 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:57,361 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:57,372 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:57,372 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:57,372 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:57,498 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:57,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:57,498 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209015954]
[2025-04-28 21:21:57,498 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209015954] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:57,498 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:57,498 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:57,499 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520381353]
[2025-04-28 21:21:57,499 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:57,499 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:57,499 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:57,500 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:57,500 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:57,500 INFO  L87              Difference]: Start difference. First operand 55 states and 83 transitions. Second operand  has 6 states, 4 states have (on average 3.5) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:57,587 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:57,587 INFO  L93              Difference]: Finished difference Result 59 states and 87 transitions.
[2025-04-28 21:21:57,588 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:57,589 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 3.5) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 32
[2025-04-28 21:21:57,589 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:57,590 INFO  L225             Difference]: With dead ends: 59
[2025-04-28 21:21:57,591 INFO  L226             Difference]: Without dead ends: 59
[2025-04-28 21:21:57,592 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:57,593 INFO  L437           NwaCegarLoop]: 69 mSDtfsCounter, 2 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:57,594 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 314 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:57,594 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2025-04-28 21:21:57,604 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53.
[2025-04-28 21:21:57,605 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 53 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 28 states have internal predecessors, (28), 22 states have call successors, (22), 8 states have call predecessors, (22), 11 states have return successors, (30), 17 states have call predecessors, (30), 22 states have call successors, (30)
[2025-04-28 21:21:57,606 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 80 transitions.
[2025-04-28 21:21:57,606 INFO  L79                 Accepts]: Start accepts. Automaton has 53 states and 80 transitions. Word has length 32
[2025-04-28 21:21:57,606 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:57,606 INFO  L485      AbstractCegarLoop]: Abstraction has 53 states and 80 transitions.
[2025-04-28 21:21:57,606 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 3.5) internal successors, (14), 6 states have internal predecessors, (14), 4 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:57,607 INFO  L278                IsEmpty]: Start isEmpty. Operand 53 states and 80 transitions.
[2025-04-28 21:21:57,608 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-04-28 21:21:57,610 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:57,610 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-04-28 21:21:57,610 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-04-28 21:21:57,610 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:57,611 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:57,611 INFO  L85        PathProgramCache]: Analyzing trace with hash -741115856, now seen corresponding path program 1 times
[2025-04-28 21:21:57,611 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:57,611 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678845287]
[2025-04-28 21:21:57,611 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:57,611 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:57,617 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:57,629 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:57,630 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:57,631 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:58,200 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:58,200 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:58,200 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678845287]
[2025-04-28 21:21:58,201 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678845287] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:58,201 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253139267]
[2025-04-28 21:21:58,201 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:58,201 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:58,205 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:58,207 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:21:58,212 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:58,259 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:58,283 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:58,284 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:58,284 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:58,285 INFO  L256         TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 44 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:58,288 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:58,866 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:58,866 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:00,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:22:00,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253139267] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:00,717 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:00,717 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17
[2025-04-28 21:22:00,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532880358]
[2025-04-28 21:22:00,718 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:00,718 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-04-28 21:22:00,718 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:00,719 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-04-28 21:22:00,719 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:22:00,720 INFO  L87              Difference]: Start difference. First operand 53 states and 80 transitions. Second operand  has 17 states, 8 states have (on average 3.0) internal successors, (24), 17 states have internal predecessors, (24), 14 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (18), 10 states have call predecessors, (18), 14 states have call successors, (18)
[2025-04-28 21:22:01,119 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:01,120 INFO  L93              Difference]: Finished difference Result 70 states and 105 transitions.
[2025-04-28 21:22:01,120 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:22:01,120 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 8 states have (on average 3.0) internal successors, (24), 17 states have internal predecessors, (24), 14 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (18), 10 states have call predecessors, (18), 14 states have call successors, (18) Word has length 32
[2025-04-28 21:22:01,121 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:01,122 INFO  L225             Difference]: With dead ends: 70
[2025-04-28 21:22:01,122 INFO  L226             Difference]: Without dead ends: 70
[2025-04-28 21:22:01,123 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380
[2025-04-28 21:22:01,123 INFO  L437           NwaCegarLoop]: 64 mSDtfsCounter, 14 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:01,124 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 614 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:22:01,125 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 70 states.
[2025-04-28 21:22:01,133 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55.
[2025-04-28 21:22:01,134 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 55 states, 20 states have (on average 1.45) internal successors, (29), 29 states have internal predecessors, (29), 22 states have call successors, (22), 8 states have call predecessors, (22), 12 states have return successors, (32), 18 states have call predecessors, (32), 22 states have call successors, (32)
[2025-04-28 21:22:01,135 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions.
[2025-04-28 21:22:01,135 INFO  L79                 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 32
[2025-04-28 21:22:01,135 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:01,136 INFO  L485      AbstractCegarLoop]: Abstraction has 55 states and 83 transitions.
[2025-04-28 21:22:01,136 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 8 states have (on average 3.0) internal successors, (24), 17 states have internal predecessors, (24), 14 states have call successors, (18), 1 states have call predecessors, (18), 8 states have return successors, (18), 10 states have call predecessors, (18), 14 states have call successors, (18)
[2025-04-28 21:22:01,136 INFO  L278                IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions.
[2025-04-28 21:22:01,137 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2025-04-28 21:22:01,137 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:01,138 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:01,145 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:22:01,342 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:01,342 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:01,343 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:01,343 INFO  L85        PathProgramCache]: Analyzing trace with hash -937438494, now seen corresponding path program 1 times
[2025-04-28 21:22:01,343 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:01,343 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168094748]
[2025-04-28 21:22:01,343 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:01,343 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:01,353 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-04-28 21:22:01,366 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-04-28 21:22:01,366 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:01,366 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:01,492 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-04-28 21:22:01,493 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:01,493 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168094748]
[2025-04-28 21:22:01,493 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168094748] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:01,493 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056770730]
[2025-04-28 21:22:01,493 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:01,493 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:01,496 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:01,499 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:01,503 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:22:01,547 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes.
[2025-04-28 21:22:01,575 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements.
[2025-04-28 21:22:01,575 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:01,576 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:01,577 INFO  L256         TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 13 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:01,579 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:01,737 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-04-28 21:22:01,737 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:02,786 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-04-28 21:22:02,786 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056770730] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:02,786 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:02,787 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 14
[2025-04-28 21:22:02,787 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857718429]
[2025-04-28 21:22:02,787 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:02,787 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-04-28 21:22:02,787 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:02,788 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-04-28 21:22:02,788 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:22:02,789 INFO  L87              Difference]: Start difference. First operand 55 states and 83 transitions. Second operand  has 14 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 14 states have internal predecessors, (23), 12 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (17), 6 states have call predecessors, (17), 12 states have call successors, (17)
[2025-04-28 21:22:03,273 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:03,273 INFO  L93              Difference]: Finished difference Result 72 states and 111 transitions.
[2025-04-28 21:22:03,274 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:22:03,274 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 14 states have internal predecessors, (23), 12 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (17), 6 states have call predecessors, (17), 12 states have call successors, (17) Word has length 36
[2025-04-28 21:22:03,274 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:03,275 INFO  L225             Difference]: With dead ends: 72
[2025-04-28 21:22:03,275 INFO  L226             Difference]: Without dead ends: 72
[2025-04-28 21:22:03,276 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420
[2025-04-28 21:22:03,277 INFO  L437           NwaCegarLoop]: 64 mSDtfsCounter, 8 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:03,279 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 659 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:22:03,280 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2025-04-28 21:22:03,298 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63.
[2025-04-28 21:22:03,299 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 63 states, 23 states have (on average 1.391304347826087) internal successors, (32), 32 states have internal predecessors, (32), 24 states have call successors, (24), 8 states have call predecessors, (24), 15 states have return successors, (44), 23 states have call predecessors, (44), 24 states have call successors, (44)
[2025-04-28 21:22:03,300 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 100 transitions.
[2025-04-28 21:22:03,300 INFO  L79                 Accepts]: Start accepts. Automaton has 63 states and 100 transitions. Word has length 36
[2025-04-28 21:22:03,300 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:03,300 INFO  L485      AbstractCegarLoop]: Abstraction has 63 states and 100 transitions.
[2025-04-28 21:22:03,301 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 14 states have internal predecessors, (23), 12 states have call successors, (16), 1 states have call predecessors, (16), 7 states have return successors, (17), 6 states have call predecessors, (17), 12 states have call successors, (17)
[2025-04-28 21:22:03,301 INFO  L278                IsEmpty]: Start isEmpty. Operand 63 states and 100 transitions.
[2025-04-28 21:22:03,302 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-04-28 21:22:03,302 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:03,303 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-04-28 21:22:03,312 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-04-28 21:22:03,503 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:03,503 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:03,504 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:03,504 INFO  L85        PathProgramCache]: Analyzing trace with hash -590956349, now seen corresponding path program 2 times
[2025-04-28 21:22:03,504 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:03,504 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727306752]
[2025-04-28 21:22:03,504 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:22:03,504 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:03,511 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes.
[2025-04-28 21:22:03,531 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:22:03,531 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:22:03,531 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:04,098 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:22:04,098 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:04,098 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727306752]
[2025-04-28 21:22:04,098 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727306752] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:04,099 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668038756]
[2025-04-28 21:22:04,099 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:22:04,099 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:04,102 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:04,104 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:04,108 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:22:04,166 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes.
[2025-04-28 21:22:04,198 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:22:04,199 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:22:04,199 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:04,203 INFO  L256         TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 60 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:04,206 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:04,821 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-04-28 21:22:04,822 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:07,778 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:22:07,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668038756] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:07,780 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:07,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21
[2025-04-28 21:22:07,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806277083]
[2025-04-28 21:22:07,780 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:07,781 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2025-04-28 21:22:07,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:07,782 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2025-04-28 21:22:07,782 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420
[2025-04-28 21:22:07,783 INFO  L87              Difference]: Start difference. First operand 63 states and 100 transitions. Second operand  has 21 states, 10 states have (on average 2.8) internal successors, (28), 21 states have internal predecessors, (28), 18 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (23), 12 states have call predecessors, (23), 18 states have call successors, (23)
[2025-04-28 21:22:08,755 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:08,755 INFO  L93              Difference]: Finished difference Result 81 states and 129 transitions.
[2025-04-28 21:22:08,756 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-04-28 21:22:08,757 INFO  L79                 Accepts]: Start accepts. Automaton has  has 21 states, 10 states have (on average 2.8) internal successors, (28), 21 states have internal predecessors, (28), 18 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (23), 12 states have call predecessors, (23), 18 states have call successors, (23) Word has length 40
[2025-04-28 21:22:08,757 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:08,757 INFO  L225             Difference]: With dead ends: 81
[2025-04-28 21:22:08,758 INFO  L226             Difference]: Without dead ends: 81
[2025-04-28 21:22:08,758 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=122, Invalid=634, Unknown=0, NotChecked=0, Total=756
[2025-04-28 21:22:08,759 INFO  L437           NwaCegarLoop]: 70 mSDtfsCounter, 14 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:08,759 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1056 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-04-28 21:22:08,760 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2025-04-28 21:22:08,770 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 66.
[2025-04-28 21:22:08,770 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 66 states, 24 states have (on average 1.375) internal successors, (33), 33 states have internal predecessors, (33), 25 states have call successors, (25), 8 states have call predecessors, (25), 16 states have return successors, (48), 25 states have call predecessors, (48), 25 states have call successors, (48)
[2025-04-28 21:22:08,772 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 106 transitions.
[2025-04-28 21:22:08,772 INFO  L79                 Accepts]: Start accepts. Automaton has 66 states and 106 transitions. Word has length 40
[2025-04-28 21:22:08,772 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:08,772 INFO  L485      AbstractCegarLoop]: Abstraction has 66 states and 106 transitions.
[2025-04-28 21:22:08,773 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 10 states have (on average 2.8) internal successors, (28), 21 states have internal predecessors, (28), 18 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (23), 12 states have call predecessors, (23), 18 states have call successors, (23)
[2025-04-28 21:22:08,773 INFO  L278                IsEmpty]: Start isEmpty. Operand 66 states and 106 transitions.
[2025-04-28 21:22:08,774 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-04-28 21:22:08,774 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:08,774 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-04-28 21:22:08,784 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-04-28 21:22:08,975 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2025-04-28 21:22:08,975 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:08,975 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:08,976 INFO  L85        PathProgramCache]: Analyzing trace with hash -1949230313, now seen corresponding path program 1 times
[2025-04-28 21:22:08,976 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:08,976 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59278313]
[2025-04-28 21:22:08,976 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:08,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:08,980 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes.
[2025-04-28 21:22:08,987 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:22:08,987 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:08,987 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:09,034 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:22:09,034 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:09,034 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59278313]
[2025-04-28 21:22:09,034 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59278313] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:22:09,034 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:22:09,034 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:22:09,035 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722138045]
[2025-04-28 21:22:09,035 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:22:09,035 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:22:09,035 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:09,036 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:22:09,036 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:22:09,036 INFO  L87              Difference]: Start difference. First operand 66 states and 106 transitions. Second operand  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:22:09,066 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:09,066 INFO  L93              Difference]: Finished difference Result 68 states and 109 transitions.
[2025-04-28 21:22:09,066 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:22:09,067 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 40
[2025-04-28 21:22:09,067 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:09,068 INFO  L225             Difference]: With dead ends: 68
[2025-04-28 21:22:09,068 INFO  L226             Difference]: Without dead ends: 68
[2025-04-28 21:22:09,068 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:22:09,068 INFO  L437           NwaCegarLoop]: 67 mSDtfsCounter, 1 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:09,069 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 187 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:22:09,069 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2025-04-28 21:22:09,081 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68.
[2025-04-28 21:22:09,081 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 68 states, 25 states have (on average 1.36) internal successors, (34), 34 states have internal predecessors, (34), 25 states have call successors, (25), 8 states have call predecessors, (25), 17 states have return successors, (50), 25 states have call predecessors, (50), 25 states have call successors, (50)
[2025-04-28 21:22:09,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 109 transitions.
[2025-04-28 21:22:09,085 INFO  L79                 Accepts]: Start accepts. Automaton has 68 states and 109 transitions. Word has length 40
[2025-04-28 21:22:09,085 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:09,085 INFO  L485      AbstractCegarLoop]: Abstraction has 68 states and 109 transitions.
[2025-04-28 21:22:09,086 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10)
[2025-04-28 21:22:09,086 INFO  L278                IsEmpty]: Start isEmpty. Operand 68 states and 109 transitions.
[2025-04-28 21:22:09,087 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-04-28 21:22:09,087 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:09,087 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 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]
[2025-04-28 21:22:09,087 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-04-28 21:22:09,087 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:09,088 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:09,088 INFO  L85        PathProgramCache]: Analyzing trace with hash -1239124451, now seen corresponding path program 1 times
[2025-04-28 21:22:09,088 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:09,088 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207043505]
[2025-04-28 21:22:09,088 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:09,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:09,093 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:22:09,102 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:22:09,102 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:09,102 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:09,172 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-04-28 21:22:09,172 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:09,172 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207043505]
[2025-04-28 21:22:09,172 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207043505] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:09,172 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589205012]
[2025-04-28 21:22:09,173 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:09,173 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:09,175 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:09,177 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:22:09,182 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:22:09,230 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-04-28 21:22:09,252 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-04-28 21:22:09,252 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:09,252 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:09,253 INFO  L256         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 13 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:09,255 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:09,378 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-04-28 21:22:09,378 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:10,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-04-28 21:22:10,157 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589205012] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:10,157 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:10,157 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 14
[2025-04-28 21:22:10,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770220634]
[2025-04-28 21:22:10,157 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:10,158 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-04-28 21:22:10,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:10,158 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-04-28 21:22:10,159 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:22:10,159 INFO  L87              Difference]: Start difference. First operand 68 states and 109 transitions. Second operand  has 14 states, 7 states have (on average 4.142857142857143) internal successors, (29), 14 states have internal predecessors, (29), 11 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22)
[2025-04-28 21:22:10,484 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:10,484 INFO  L93              Difference]: Finished difference Result 77 states and 123 transitions.
[2025-04-28 21:22:10,485 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:22:10,485 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 7 states have (on average 4.142857142857143) internal successors, (29), 14 states have internal predecessors, (29), 11 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22) Word has length 44
[2025-04-28 21:22:10,485 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:10,487 INFO  L225             Difference]: With dead ends: 77
[2025-04-28 21:22:10,487 INFO  L226             Difference]: Without dead ends: 77
[2025-04-28 21:22:10,487 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:22:10,488 INFO  L437           NwaCegarLoop]: 66 mSDtfsCounter, 6 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:10,488 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 624 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:22:10,490 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 77 states.
[2025-04-28 21:22:10,498 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68.
[2025-04-28 21:22:10,498 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 68 states, 25 states have (on average 1.36) internal successors, (34), 34 states have internal predecessors, (34), 25 states have call successors, (25), 8 states have call predecessors, (25), 17 states have return successors, (50), 26 states have call predecessors, (50), 25 states have call successors, (50)
[2025-04-28 21:22:10,503 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 109 transitions.
[2025-04-28 21:22:10,504 INFO  L79                 Accepts]: Start accepts. Automaton has 68 states and 109 transitions. Word has length 44
[2025-04-28 21:22:10,504 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:10,504 INFO  L485      AbstractCegarLoop]: Abstraction has 68 states and 109 transitions.
[2025-04-28 21:22:10,504 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 7 states have (on average 4.142857142857143) internal successors, (29), 14 states have internal predecessors, (29), 11 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22)
[2025-04-28 21:22:10,504 INFO  L278                IsEmpty]: Start isEmpty. Operand 68 states and 109 transitions.
[2025-04-28 21:22:10,505 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 49
[2025-04-28 21:22:10,505 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:10,505 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:10,512 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-04-28 21:22:10,706 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:10,706 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:10,706 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:10,706 INFO  L85        PathProgramCache]: Analyzing trace with hash -667317482, now seen corresponding path program 3 times
[2025-04-28 21:22:10,706 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:10,706 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744523198]
[2025-04-28 21:22:10,707 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:22:10,707 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:10,712 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 4 equivalence classes.
[2025-04-28 21:22:10,734 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 48 of 48 statements.
[2025-04-28 21:22:10,734 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-04-28 21:22:10,735 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:11,775 INFO  L134       CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-04-28 21:22:11,775 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:11,775 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744523198]
[2025-04-28 21:22:11,775 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744523198] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:11,775 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078297808]
[2025-04-28 21:22:11,775 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:22:11,776 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:11,779 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:11,781 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:22:11,784 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:22:11,849 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 48 statements into 4 equivalence classes.
[2025-04-28 21:22:11,883 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 48 of 48 statements.
[2025-04-28 21:22:11,883 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-04-28 21:22:11,883 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:11,885 INFO  L256         TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 81 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:11,889 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:12,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-04-28 21:22:12,854 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:16,647 INFO  L134       CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-04-28 21:22:16,647 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078297808] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:16,647 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:16,647 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 33
[2025-04-28 21:22:16,647 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627923165]
[2025-04-28 21:22:16,647 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:16,648 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2025-04-28 21:22:16,648 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:16,649 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2025-04-28 21:22:16,649 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056
[2025-04-28 21:22:16,650 INFO  L87              Difference]: Start difference. First operand 68 states and 109 transitions. Second operand  has 33 states, 14 states have (on average 2.642857142857143) internal successors, (37), 29 states have internal predecessors, (37), 28 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (29), 16 states have call predecessors, (29), 28 states have call successors, (29)
[2025-04-28 21:22:17,644 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:17,644 INFO  L93              Difference]: Finished difference Result 92 states and 146 transitions.
[2025-04-28 21:22:17,645 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-04-28 21:22:17,646 INFO  L79                 Accepts]: Start accepts. Automaton has  has 33 states, 14 states have (on average 2.642857142857143) internal successors, (37), 29 states have internal predecessors, (37), 28 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (29), 16 states have call predecessors, (29), 28 states have call successors, (29) Word has length 48
[2025-04-28 21:22:17,647 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:17,649 INFO  L225             Difference]: With dead ends: 92
[2025-04-28 21:22:17,649 INFO  L226             Difference]: Without dead ends: 92
[2025-04-28 21:22:17,650 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=175, Invalid=1307, Unknown=0, NotChecked=0, Total=1482
[2025-04-28 21:22:17,650 INFO  L437           NwaCegarLoop]: 67 mSDtfsCounter, 23 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:17,650 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1200 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-04-28 21:22:17,652 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 92 states.
[2025-04-28 21:22:17,664 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82.
[2025-04-28 21:22:17,665 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 82 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 39 states have internal predecessors, (40), 30 states have call successors, (30), 9 states have call predecessors, (30), 21 states have return successors, (64), 34 states have call predecessors, (64), 30 states have call successors, (64)
[2025-04-28 21:22:17,666 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 134 transitions.
[2025-04-28 21:22:17,666 INFO  L79                 Accepts]: Start accepts. Automaton has 82 states and 134 transitions. Word has length 48
[2025-04-28 21:22:17,666 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:17,666 INFO  L485      AbstractCegarLoop]: Abstraction has 82 states and 134 transitions.
[2025-04-28 21:22:17,669 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 14 states have (on average 2.642857142857143) internal successors, (37), 29 states have internal predecessors, (37), 28 states have call successors, (29), 1 states have call predecessors, (29), 14 states have return successors, (29), 16 states have call predecessors, (29), 28 states have call successors, (29)
[2025-04-28 21:22:17,669 INFO  L278                IsEmpty]: Start isEmpty. Operand 82 states and 134 transitions.
[2025-04-28 21:22:17,670 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 53
[2025-04-28 21:22:17,670 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:17,670 INFO  L218           NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:17,675 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2025-04-28 21:22:17,874 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-04-28 21:22:17,874 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:17,874 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:17,875 INFO  L85        PathProgramCache]: Analyzing trace with hash 1514970394, now seen corresponding path program 1 times
[2025-04-28 21:22:17,875 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:17,875 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735914047]
[2025-04-28 21:22:17,875 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:17,875 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:17,880 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-04-28 21:22:17,897 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-04-28 21:22:17,897 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:17,898 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:18,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2025-04-28 21:22:18,520 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:18,520 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735914047]
[2025-04-28 21:22:18,520 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735914047] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:18,520 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095969095]
[2025-04-28 21:22:18,520 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:18,520 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:18,523 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:18,525 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:22:18,528 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-04-28 21:22:18,592 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes.
[2025-04-28 21:22:18,623 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements.
[2025-04-28 21:22:18,623 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:18,623 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:18,626 INFO  L256         TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 76 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:18,630 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:19,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked.
[2025-04-28 21:22:19,451 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
