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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:28,392 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:28,481 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bcd2af0-3788-4115-bd0a-8b0ac6b32c69/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:28,486 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:28,486 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:28,507 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:28,508 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:28,508 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:28,508 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:28,508 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:28,509 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:28,509 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:28,509 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:28,509 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:28,509 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:28,509 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:28,509 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:28,509 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:28,510 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:28,510 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:28,510 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:28,510 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:28,510 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:28,510 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:28,510 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:28,511 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:28,511 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:28,820 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:28,828 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:28,831 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:28,835 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:28,835 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:28,836 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bcd2af0-3788-4115-bd0a-8b0ac6b32c69/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-014.smt2
[2025-04-28 21:21:28,839 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:28,843 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:29,145 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0bcd2af0-3788-4115-bd0a-8b0ac6b32c69/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-014.smt2
[2025-04-28 21:21:29,148 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:29,152 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:29,155 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:29,155 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:29,155 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:29,158 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:29" (1/1) ...
[2025-04-28 21:21:29,198 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:29 Unit
[2025-04-28 21:21:29,198 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:29,199 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:29,199 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:29,199 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:29,214 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:29" (1/1) ...
[2025-04-28 21:21:29,214 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:29" (1/1) ...
[2025-04-28 21:21:29,244 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:29" (1/1) ...
[2025-04-28 21:21:29,244 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:29" (1/1) ...
[2025-04-28 21:21:29,250 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:29" (1/1) ...
[2025-04-28 21:21:29,251 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:29" (1/1) ...
[2025-04-28 21:21:29,255 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:29" (1/1) ...
[2025-04-28 21:21:29,260 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:29" (1/1) ...
[2025-04-28 21:21:29,260 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:29" (1/1) ...
[2025-04-28 21:21:29,284 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:29,286 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:29,287 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:29,287 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:29,288 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:29" (1/1) ...
[2025-04-28 21:21:29,291 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:29,304 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:29,319 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:29,323 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:29,340 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:29,341 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:29,341 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:29,341 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATentry.split given in one single declaration
[2025-04-28 21:21:29,341 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATentry.split
[2025-04-28 21:21:29,341 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATentry.split
[2025-04-28 21:21:29,341 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure fibo2 given in one single declaration
[2025-04-28 21:21:29,341 INFO  L130     BoogieDeclarations]: Found specification of procedure fibo2
[2025-04-28 21:21:29,341 INFO  L138     BoogieDeclarations]: Found implementation of procedure fibo2
[2025-04-28 21:21:29,342 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure fibo2.AT.split given in one single declaration
[2025-04-28 21:21:29,342 INFO  L130     BoogieDeclarations]: Found specification of procedure fibo2.AT.split
[2025-04-28 21:21:29,342 INFO  L138     BoogieDeclarations]: Found implementation of procedure fibo2.AT.split
[2025-04-28 21:21:29,342 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure fibo2.AT_tail given in one single declaration
[2025-04-28 21:21:29,342 INFO  L130     BoogieDeclarations]: Found specification of procedure fibo2.AT_tail
[2025-04-28 21:21:29,342 INFO  L138     BoogieDeclarations]: Found implementation of procedure fibo2.AT_tail
[2025-04-28 21:21:29,342 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATentry given in one single declaration
[2025-04-28 21:21:29,342 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATentry
[2025-04-28 21:21:29,342 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATentry
[2025-04-28 21:21:29,342 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:29,342 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:29,342 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:29,424 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:29,428 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:29,657 INFO  L?                        ?]: Removed 39 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:29,658 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:29,673 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:29,673 INFO  L312             CfgBuilder]: Removed 3 assume(true) statements.
[2025-04-28 21:21:29,675 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:29 BoogieIcfgContainer
[2025-04-28 21:21:29,675 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:29,678 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:29,679 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:29,683 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:29,683 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:29" (1/3) ...
[2025-04-28 21:21:29,684 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ac45ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:29, skipping insertion in model container
[2025-04-28 21:21:29,685 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:29" (2/3) ...
[2025-04-28 21:21:29,685 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ac45ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:29, skipping insertion in model container
[2025-04-28 21:21:29,685 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:29" (3/3) ...
[2025-04-28 21:21:29,687 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:29,704 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:29,707 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 7 procedures, 30 locations, 48 edges, 7 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:29,754 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:29,774 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;@19b449ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:29,774 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:29,781 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 30 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11)
[2025-04-28 21:21:29,790 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-04-28 21:21:29,790 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:29,791 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:29,792 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:29,797 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:29,798 INFO  L85        PathProgramCache]: Analyzing trace with hash -502418989, now seen corresponding path program 1 times
[2025-04-28 21:21:29,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:29,808 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427511141]
[2025-04-28 21:21:29,808 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:29,809 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:29,844 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-28 21:21:29,871 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-28 21:21:29,871 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:29,872 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:29,995 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:29,996 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:29,996 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427511141]
[2025-04-28 21:21:29,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427511141] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:29,997 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919910421]
[2025-04-28 21:21:29,997 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:29,997 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:30,000 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:30,004 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:30,006 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:30,057 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-28 21:21:30,089 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-28 21:21:30,089 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:30,089 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:30,091 INFO  L256         TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:30,095 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:30,160 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:30,160 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:30,160 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919910421] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:30,161 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:30,164 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2025-04-28 21:21:30,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100117737]
[2025-04-28 21:21:30,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:30,175 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:30,176 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:30,204 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:30,205 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:30,207 INFO  L87              Difference]: Start difference. First operand  has 30 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 13 states have internal predecessors, (15), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:30,303 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:30,303 INFO  L93              Difference]: Finished difference Result 30 states and 41 transitions.
[2025-04-28 21:21:30,305 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:30,306 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 19
[2025-04-28 21:21:30,307 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:30,344 INFO  L225             Difference]: With dead ends: 30
[2025-04-28 21:21:30,344 INFO  L226             Difference]: Without dead ends: 30
[2025-04-28 21:21:30,346 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:30,356 INFO  L437           NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:30,361 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 76 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:30,403 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2025-04-28 21:21:30,421 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2025-04-28 21:21:30,423 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16)
[2025-04-28 21:21:30,427 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions.
[2025-04-28 21:21:30,428 INFO  L79                 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 19
[2025-04-28 21:21:30,429 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:30,429 INFO  L485      AbstractCegarLoop]: Abstraction has 30 states and 41 transitions.
[2025-04-28 21:21:30,430 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:30,430 INFO  L278                IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions.
[2025-04-28 21:21:30,432 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-04-28 21:21:30,432 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:30,435 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:30,440 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:30,639 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:30,639 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:30,640 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:30,640 INFO  L85        PathProgramCache]: Analyzing trace with hash 1801503806, now seen corresponding path program 1 times
[2025-04-28 21:21:30,640 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:30,641 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631663751]
[2025-04-28 21:21:30,641 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:30,641 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:30,657 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-28 21:21:30,670 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-28 21:21:30,671 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:30,671 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:30,792 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:30,793 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:30,794 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631663751]
[2025-04-28 21:21:30,794 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631663751] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:30,794 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857867823]
[2025-04-28 21:21:30,794 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:30,794 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:30,799 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:30,802 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:30,807 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:30,862 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-28 21:21:30,883 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-28 21:21:30,884 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:30,884 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:30,885 INFO  L256         TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:30,886 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:30,920 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:30,920 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:30,920 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [857867823] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:30,921 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:30,921 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2025-04-28 21:21:30,921 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465102197]
[2025-04-28 21:21:30,921 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:30,922 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:30,922 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:30,923 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:30,923 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:30,923 INFO  L87              Difference]: Start difference. First operand 30 states and 41 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:30,996 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:30,996 INFO  L93              Difference]: Finished difference Result 34 states and 53 transitions.
[2025-04-28 21:21:30,999 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:31,000 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 19
[2025-04-28 21:21:31,000 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:31,001 INFO  L225             Difference]: With dead ends: 34
[2025-04-28 21:21:31,003 INFO  L226             Difference]: Without dead ends: 34
[2025-04-28 21:21:31,003 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:31,004 INFO  L437           NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:31,005 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 92 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:31,008 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2025-04-28 21:21:31,017 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30.
[2025-04-28 21:21:31,017 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16)
[2025-04-28 21:21:31,018 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions.
[2025-04-28 21:21:31,019 INFO  L79                 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 19
[2025-04-28 21:21:31,019 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:31,019 INFO  L485      AbstractCegarLoop]: Abstraction has 30 states and 41 transitions.
[2025-04-28 21:21:31,019 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:31,019 INFO  L278                IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions.
[2025-04-28 21:21:31,021 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2025-04-28 21:21:31,021 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:31,021 INFO  L218           NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 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:31,025 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:21:31,221 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:31,222 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:31,222 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:31,222 INFO  L85        PathProgramCache]: Analyzing trace with hash -1184870143, now seen corresponding path program 1 times
[2025-04-28 21:21:31,223 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:31,223 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579446364]
[2025-04-28 21:21:31,223 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,223 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:31,248 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes.
[2025-04-28 21:21:31,279 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements.
[2025-04-28 21:21:31,280 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:31,281 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,436 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2025-04-28 21:21:31,437 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:31,437 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579446364]
[2025-04-28 21:21:31,437 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579446364] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:31,437 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307136909]
[2025-04-28 21:21:31,437 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,437 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:31,440 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:31,443 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:21:31,448 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:31,523 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes.
[2025-04-28 21:21:31,568 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements.
[2025-04-28 21:21:31,569 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:31,569 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,571 INFO  L256         TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:31,573 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:31,606 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2025-04-28 21:21:31,606 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:31,607 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307136909] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:31,607 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:31,607 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2025-04-28 21:21:31,607 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855168525]
[2025-04-28 21:21:31,607 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:31,607 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:31,607 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:31,608 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:31,609 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:31,609 INFO  L87              Difference]: Start difference. First operand 30 states and 41 transitions. Second operand  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:21:31,657 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:31,657 INFO  L93              Difference]: Finished difference Result 32 states and 46 transitions.
[2025-04-28 21:21:31,658 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:31,658 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 42
[2025-04-28 21:21:31,659 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:31,660 INFO  L225             Difference]: With dead ends: 32
[2025-04-28 21:21:31,662 INFO  L226             Difference]: Without dead ends: 32
[2025-04-28 21:21:31,663 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:31,664 INFO  L437           NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:31,666 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 78 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:31,667 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2025-04-28 21:21:31,674 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2025-04-28 21:21:31,675 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (20), 11 states have call predecessors, (20), 11 states have call successors, (20)
[2025-04-28 21:21:31,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions.
[2025-04-28 21:21:31,676 INFO  L79                 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 42
[2025-04-28 21:21:31,676 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:31,677 INFO  L485      AbstractCegarLoop]: Abstraction has 32 states and 46 transitions.
[2025-04-28 21:21:31,677 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:21:31,677 INFO  L278                IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions.
[2025-04-28 21:21:31,679 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2025-04-28 21:21:31,679 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:31,679 INFO  L218           NwaCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:31,685 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:31,884 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:31,884 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:31,884 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:31,885 INFO  L85        PathProgramCache]: Analyzing trace with hash 1309676470, now seen corresponding path program 1 times
[2025-04-28 21:21:31,885 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:31,885 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337249543]
[2025-04-28 21:21:31,885 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,885 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:31,897 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes.
[2025-04-28 21:21:31,905 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements.
[2025-04-28 21:21:31,905 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:31,905 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,989 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2025-04-28 21:21:31,990 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:31,990 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337249543]
[2025-04-28 21:21:31,991 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337249543] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:31,991 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698609328]
[2025-04-28 21:21:31,991 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,991 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:31,994 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:31,996 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:21:32,000 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:32,059 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes.
[2025-04-28 21:21:32,095 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements.
[2025-04-28 21:21:32,095 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:32,095 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,097 INFO  L256         TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:32,099 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:32,118 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked.
[2025-04-28 21:21:32,119 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:32,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [698609328] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:32,119 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:32,119 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4
[2025-04-28 21:21:32,119 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625826508]
[2025-04-28 21:21:32,119 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:32,120 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:32,120 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:32,120 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:32,120 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:32,121 INFO  L87              Difference]: Start difference. First operand 32 states and 46 transitions. Second operand  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:21:32,167 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:32,169 INFO  L93              Difference]: Finished difference Result 34 states and 50 transitions.
[2025-04-28 21:21:32,170 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:32,170 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 42
[2025-04-28 21:21:32,170 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:32,171 INFO  L225             Difference]: With dead ends: 34
[2025-04-28 21:21:32,171 INFO  L226             Difference]: Without dead ends: 34
[2025-04-28 21:21:32,171 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 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:32,174 INFO  L437           NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:32,174 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 92 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:32,175 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2025-04-28 21:21:32,179 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30.
[2025-04-28 21:21:32,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15)
[2025-04-28 21:21:32,180 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions.
[2025-04-28 21:21:32,180 INFO  L79                 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 42
[2025-04-28 21:21:32,180 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:32,180 INFO  L485      AbstractCegarLoop]: Abstraction has 30 states and 40 transitions.
[2025-04-28 21:21:32,180 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)
[2025-04-28 21:21:32,180 INFO  L278                IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions.
[2025-04-28 21:21:32,182 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:32,182 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:32,182 INFO  L218           NwaCegarLoop]: trace histogram [10, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:32,186 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-04-28 21:21:32,382 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:32,383 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:32,383 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:32,383 INFO  L85        PathProgramCache]: Analyzing trace with hash -2059586387, now seen corresponding path program 2 times
[2025-04-28 21:21:32,383 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:32,383 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130126287]
[2025-04-28 21:21:32,384 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:32,384 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:32,415 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes.
[2025-04-28 21:21:32,437 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:32,437 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:32,437 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,607 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked.
[2025-04-28 21:21:32,607 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:32,607 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130126287]
[2025-04-28 21:21:32,607 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130126287] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:32,607 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423612425]
[2025-04-28 21:21:32,608 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:32,608 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:32,611 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:32,615 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:21:32,618 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:21:32,700 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes.
[2025-04-28 21:21:32,792 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:32,792 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:32,792 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,795 INFO  L256         TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:32,798 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:32,855 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked.
[2025-04-28 21:21:32,855 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:32,855 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423612425] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:32,855 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:32,856 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2025-04-28 21:21:32,856 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826726520]
[2025-04-28 21:21:32,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:32,856 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:32,856 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:32,860 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:32,860 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:32,860 INFO  L87              Difference]: Start difference. First operand 30 states and 40 transitions. Second operand  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17)
[2025-04-28 21:21:32,904 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:32,904 INFO  L93              Difference]: Finished difference Result 32 states and 44 transitions.
[2025-04-28 21:21:32,906 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:32,907 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 65
[2025-04-28 21:21:32,907 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:32,907 INFO  L225             Difference]: With dead ends: 32
[2025-04-28 21:21:32,908 INFO  L226             Difference]: Without dead ends: 32
[2025-04-28 21:21:32,908 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:32,909 INFO  L437           NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:32,909 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 82 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:32,913 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2025-04-28 21:21:32,917 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2025-04-28 21:21:32,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18)
[2025-04-28 21:21:32,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions.
[2025-04-28 21:21:32,918 INFO  L79                 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 65
[2025-04-28 21:21:32,919 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:32,919 INFO  L485      AbstractCegarLoop]: Abstraction has 32 states and 44 transitions.
[2025-04-28 21:21:32,919 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17)
[2025-04-28 21:21:32,919 INFO  L278                IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions.
[2025-04-28 21:21:32,920 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:32,920 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:32,920 INFO  L218           NwaCegarLoop]: trace histogram [10, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:32,926 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-04-28 21:21:33,123 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:33,123 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:33,124 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:33,124 INFO  L85        PathProgramCache]: Analyzing trace with hash -1919911475, now seen corresponding path program 2 times
[2025-04-28 21:21:33,124 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:33,124 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449515817]
[2025-04-28 21:21:33,124 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:33,124 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,149 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes.
[2025-04-28 21:21:33,160 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:33,160 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:33,160 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,292 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked.
[2025-04-28 21:21:33,292 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:33,293 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449515817]
[2025-04-28 21:21:33,293 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449515817] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:33,293 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346798692]
[2025-04-28 21:21:33,293 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:33,293 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:33,296 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:33,298 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:21:33,302 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:21:33,373 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes.
[2025-04-28 21:21:33,435 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:33,435 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:33,436 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,439 INFO  L256         TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:33,441 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:33,462 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-04-28 21:21:33,463 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:33,463 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346798692] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:33,463 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:33,463 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5
[2025-04-28 21:21:33,463 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116702373]
[2025-04-28 21:21:33,463 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:33,464 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:33,464 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:33,464 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:33,464 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:33,465 INFO  L87              Difference]: Start difference. First operand 32 states and 44 transitions. Second operand  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)
[2025-04-28 21:21:33,494 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:33,494 INFO  L93              Difference]: Finished difference Result 32 states and 43 transitions.
[2025-04-28 21:21:33,494 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:33,495 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 65
[2025-04-28 21:21:33,495 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:33,496 INFO  L225             Difference]: With dead ends: 32
[2025-04-28 21:21:33,496 INFO  L226             Difference]: Without dead ends: 32
[2025-04-28 21:21:33,496 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:33,498 INFO  L437           NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:33,498 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 84 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:33,499 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2025-04-28 21:21:33,506 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2025-04-28 21:21:33,506 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17)
[2025-04-28 21:21:33,507 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions.
[2025-04-28 21:21:33,507 INFO  L79                 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 65
[2025-04-28 21:21:33,507 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:33,507 INFO  L485      AbstractCegarLoop]: Abstraction has 32 states and 43 transitions.
[2025-04-28 21:21:33,508 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)
[2025-04-28 21:21:33,508 INFO  L278                IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions.
[2025-04-28 21:21:33,509 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:33,509 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:33,509 INFO  L218           NwaCegarLoop]: trace histogram [10, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:33,514 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:33,709 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:33,710 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:33,710 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:33,710 INFO  L85        PathProgramCache]: Analyzing trace with hash -1923309843, now seen corresponding path program 3 times
[2025-04-28 21:21:33,710 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:33,710 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196602023]
[2025-04-28 21:21:33,710 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:33,711 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,727 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 8 equivalence classes.
[2025-04-28 21:21:33,755 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 65 statements.
[2025-04-28 21:21:33,755 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:33,755 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,939 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked.
[2025-04-28 21:21:33,940 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:33,940 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196602023]
[2025-04-28 21:21:33,940 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196602023] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:33,940 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442508107]
[2025-04-28 21:21:33,940 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:33,940 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:33,942 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:33,951 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:21:33,964 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-04-28 21:21:34,044 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 8 equivalence classes.
[2025-04-28 21:21:34,100 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 65 statements.
[2025-04-28 21:21:34,100 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:34,101 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,105 INFO  L256         TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:34,107 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:34,153 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-04-28 21:21:34,154 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:34,154 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442508107] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:34,154 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:34,154 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8
[2025-04-28 21:21:34,154 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550379511]
[2025-04-28 21:21:34,155 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:34,155 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:34,155 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:34,156 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:34,157 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:34,157 INFO  L87              Difference]: Start difference. First operand 32 states and 43 transitions. Second operand  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17)
[2025-04-28 21:21:34,191 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:34,192 INFO  L93              Difference]: Finished difference Result 32 states and 42 transitions.
[2025-04-28 21:21:34,192 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:34,192 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 65
[2025-04-28 21:21:34,193 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:34,193 INFO  L225             Difference]: With dead ends: 32
[2025-04-28 21:21:34,193 INFO  L226             Difference]: Without dead ends: 32
[2025-04-28 21:21:34,194 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:34,194 INFO  L437           NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 86 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:34,194 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 86 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:34,195 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 32 states.
[2025-04-28 21:21:34,201 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32.
[2025-04-28 21:21:34,201 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 11 states have call successors, (11), 6 states have call predecessors, (11), 8 states have return successors, (16), 11 states have call predecessors, (16), 11 states have call successors, (16)
[2025-04-28 21:21:34,206 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions.
[2025-04-28 21:21:34,206 INFO  L79                 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 65
[2025-04-28 21:21:34,206 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:34,206 INFO  L485      AbstractCegarLoop]: Abstraction has 32 states and 42 transitions.
[2025-04-28 21:21:34,206 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17)
[2025-04-28 21:21:34,206 INFO  L278                IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions.
[2025-04-28 21:21:34,207 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:34,207 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:34,208 INFO  L218           NwaCegarLoop]: trace histogram [10, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:34,216 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-04-28 21:21:34,415 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7
[2025-04-28 21:21:34,415 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:34,415 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:34,415 INFO  L85        PathProgramCache]: Analyzing trace with hash 38294541, now seen corresponding path program 4 times
[2025-04-28 21:21:34,415 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:34,415 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239732339]
[2025-04-28 21:21:34,416 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:34,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:34,453 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes.
[2025-04-28 21:21:34,462 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:34,462 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:34,462 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,563 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 8 proven. 33 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked.
[2025-04-28 21:21:34,563 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:34,563 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239732339]
[2025-04-28 21:21:34,563 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239732339] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:34,563 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365710925]
[2025-04-28 21:21:34,563 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:34,563 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:34,566 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:34,568 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:34,573 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-04-28 21:21:34,655 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes.
[2025-04-28 21:21:34,717 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:34,717 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:34,717 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,719 INFO  L256         TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:34,721 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:34,743 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked.
[2025-04-28 21:21:34,743 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:34,743 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [365710925] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:34,744 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:34,744 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2025-04-28 21:21:34,744 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199448543]
[2025-04-28 21:21:34,744 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:34,744 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:34,744 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:34,745 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:34,745 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:34,745 INFO  L87              Difference]: Start difference. First operand 32 states and 42 transitions. Second operand  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13)
[2025-04-28 21:21:34,768 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:34,769 INFO  L93              Difference]: Finished difference Result 32 states and 41 transitions.
[2025-04-28 21:21:34,769 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:34,770 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 65
[2025-04-28 21:21:34,770 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:34,770 INFO  L225             Difference]: With dead ends: 32
[2025-04-28 21:21:34,772 INFO  L226             Difference]: Without dead ends: 30
[2025-04-28 21:21:34,772 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:34,772 INFO  L437           NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:34,773 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:34,774 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2025-04-28 21:21:34,779 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2025-04-28 21:21:34,779 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 30 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 12 states have internal predecessors, (12), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15)
[2025-04-28 21:21:34,780 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions.
[2025-04-28 21:21:34,780 INFO  L79                 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 65
[2025-04-28 21:21:34,780 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:34,780 INFO  L485      AbstractCegarLoop]: Abstraction has 30 states and 38 transitions.
[2025-04-28 21:21:34,781 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13)
[2025-04-28 21:21:34,781 INFO  L278                IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions.
[2025-04-28 21:21:34,783 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-04-28 21:21:34,783 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:34,783 INFO  L218           NwaCegarLoop]: trace histogram [10, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:34,788 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:34,983 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:34,984 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:34,984 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:34,984 INFO  L85        PathProgramCache]: Analyzing trace with hash 1822305005, now seen corresponding path program 1 times
[2025-04-28 21:21:34,984 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:34,984 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135189953]
[2025-04-28 21:21:34,985 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:34,985 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:34,997 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:35,013 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:35,013 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:35,013 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:35,544 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked.
[2025-04-28 21:21:35,544 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:35,544 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135189953]
[2025-04-28 21:21:35,544 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135189953] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:35,544 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745671200]
[2025-04-28 21:21:35,545 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:35,545 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:35,547 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:35,550 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:35,553 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-04-28 21:21:35,618 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-04-28 21:21:35,670 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-04-28 21:21:35,670 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:35,670 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:35,672 INFO  L256         TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 19 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:35,675 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:36,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 41 proven. 12 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked.
[2025-04-28 21:21:36,238 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:40,073 INFO  L134       CoverageAnalysis]: Checked inductivity of 146 backedges. 41 proven. 12 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked.
[2025-04-28 21:21:40,073 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745671200] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:40,073 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:40,073 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10
[2025-04-28 21:21:40,073 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348255718]
[2025-04-28 21:21:40,073 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:40,074 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:40,074 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:40,075 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:40,075 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:40,075 INFO  L87              Difference]: Start difference. First operand 30 states and 38 transitions. Second operand  has 10 states, 5 states have (on average 3.6) internal successors, (18), 9 states have internal predecessors, (18), 8 states have call successors, (22), 1 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23)
[2025-04-28 21:21:40,201 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,201 INFO  L93              Difference]: Finished difference Result 36 states and 53 transitions.
[2025-04-28 21:21:40,201 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:40,202 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 5 states have (on average 3.6) internal successors, (18), 9 states have internal predecessors, (18), 8 states have call successors, (22), 1 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23) Word has length 65
[2025-04-28 21:21:40,202 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,202 INFO  L225             Difference]: With dead ends: 36
[2025-04-28 21:21:40,203 INFO  L226             Difference]: Without dead ends: 36
[2025-04-28 21:21:40,203 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:40,203 INFO  L437           NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,204 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 194 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:40,204 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2025-04-28 21:21:40,208 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36.
[2025-04-28 21:21:40,209 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 14 states have internal predecessors, (14), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (26), 15 states have call predecessors, (26), 13 states have call successors, (26)
[2025-04-28 21:21:40,209 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions.
[2025-04-28 21:21:40,209 INFO  L79                 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 65
[2025-04-28 21:21:40,210 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,210 INFO  L485      AbstractCegarLoop]: Abstraction has 36 states and 53 transitions.
[2025-04-28 21:21:40,210 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 5 states have (on average 3.6) internal successors, (18), 9 states have internal predecessors, (18), 8 states have call successors, (22), 1 states have call predecessors, (22), 5 states have return successors, (23), 8 states have call predecessors, (23), 8 states have call successors, (23)
[2025-04-28 21:21:40,210 INFO  L278                IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions.
[2025-04-28 21:21:40,212 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2025-04-28 21:21:40,212 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,212 INFO  L218           NwaCegarLoop]: trace histogram [26, 20, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:40,218 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2025-04-28 21:21:40,412 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2025-04-28 21:21:40,413 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:40,413 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:40,413 INFO  L85        PathProgramCache]: Analyzing trace with hash -1835424083, now seen corresponding path program 2 times
[2025-04-28 21:21:40,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:40,413 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756717458]
[2025-04-28 21:21:40,413 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:40,413 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,440 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 157 statements into 2 equivalence classes.
[2025-04-28 21:21:40,471 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 157 of 157 statements.
[2025-04-28 21:21:40,471 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:40,471 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 1140 backedges. 137 proven. 47 refuted. 0 times theorem prover too weak. 956 trivial. 0 not checked.
[2025-04-28 21:21:41,556 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:41,556 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756717458]
[2025-04-28 21:21:41,556 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756717458] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:41,556 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093904873]
[2025-04-28 21:21:41,556 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:41,557 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:41,559 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:41,561 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:41,565 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-04-28 21:21:41,690 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 157 statements into 2 equivalence classes.
[2025-04-28 21:21:41,838 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 157 of 157 statements.
[2025-04-28 21:21:41,838 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:41,838 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,842 INFO  L256         TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 28 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:41,846 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:42,362 INFO  L134       CoverageAnalysis]: Checked inductivity of 1140 backedges. 137 proven. 47 refuted. 0 times theorem prover too weak. 956 trivial. 0 not checked.
[2025-04-28 21:21:42,362 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:45,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 1140 backedges. 137 proven. 47 refuted. 0 times theorem prover too weak. 956 trivial. 0 not checked.
[2025-04-28 21:21:45,996 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093904873] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:45,996 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:45,996 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10
[2025-04-28 21:21:45,997 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527999257]
[2025-04-28 21:21:45,997 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:45,997 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:45,998 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:45,998 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:45,998 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:45,998 INFO  L87              Difference]: Start difference. First operand 36 states and 53 transitions. Second operand  has 10 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (20), 1 states have call predecessors, (20), 6 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21)
[2025-04-28 21:21:46,217 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:46,218 INFO  L93              Difference]: Finished difference Result 49 states and 98 transitions.
[2025-04-28 21:21:46,218 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:46,218 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (20), 1 states have call predecessors, (20), 6 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21) Word has length 157
[2025-04-28 21:21:46,219 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:46,220 INFO  L225             Difference]: With dead ends: 49
[2025-04-28 21:21:46,221 INFO  L226             Difference]: Without dead ends: 49
[2025-04-28 21:21:46,221 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 310 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:46,222 INFO  L437           NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:46,222 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 174 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:46,223 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2025-04-28 21:21:46,231 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44.
[2025-04-28 21:21:46,231 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 44 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 16 states have internal predecessors, (16), 17 states have call successors, (17), 6 states have call predecessors, (17), 11 states have return successors, (47), 21 states have call predecessors, (47), 17 states have call successors, (47)
[2025-04-28 21:21:46,232 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 80 transitions.
[2025-04-28 21:21:46,232 INFO  L79                 Accepts]: Start accepts. Automaton has 44 states and 80 transitions. Word has length 157
[2025-04-28 21:21:46,233 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:46,233 INFO  L485      AbstractCegarLoop]: Abstraction has 44 states and 80 transitions.
[2025-04-28 21:21:46,233 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 9 states have internal predecessors, (19), 7 states have call successors, (20), 1 states have call predecessors, (20), 6 states have return successors, (21), 8 states have call predecessors, (21), 7 states have call successors, (21)
[2025-04-28 21:21:46,234 INFO  L278                IsEmpty]: Start isEmpty. Operand 44 states and 80 transitions.
[2025-04-28 21:21:46,237 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 250
[2025-04-28 21:21:46,237 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:46,237 INFO  L218           NwaCegarLoop]: trace histogram [42, 32, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:46,244 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:46,438 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:46,438 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:46,439 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:46,439 INFO  L85        PathProgramCache]: Analyzing trace with hash -1767912721, now seen corresponding path program 3 times
[2025-04-28 21:21:46,439 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:46,439 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034682219]
[2025-04-28 21:21:46,439 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:46,439 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:46,471 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 249 statements into 21 equivalence classes.
[2025-04-28 21:21:46,830 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 187 of 249 statements.
[2025-04-28 21:21:46,831 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s)
[2025-04-28 21:21:46,831 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:49,049 INFO  L134       CoverageAnalysis]: Checked inductivity of 3078 backedges. 434 proven. 140 refuted. 0 times theorem prover too weak. 2504 trivial. 0 not checked.
[2025-04-28 21:21:49,049 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:49,049 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034682219]
[2025-04-28 21:21:49,049 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034682219] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:49,050 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274193678]
[2025-04-28 21:21:49,050 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:49,050 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:49,052 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:49,054 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:49,058 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-04-28 21:21:49,236 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 249 statements into 21 equivalence classes.
[2025-04-28 21:21:49,452 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) and asserted 187 of 249 statements.
[2025-04-28 21:21:49,453 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s)
[2025-04-28 21:21:49,453 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:49,460 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 52 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:49,466 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:50,287 INFO  L134       CoverageAnalysis]: Checked inductivity of 3078 backedges. 508 proven. 141 refuted. 0 times theorem prover too weak. 2429 trivial. 0 not checked.
[2025-04-28 21:21:50,288 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:58,277 INFO  L134       CoverageAnalysis]: Checked inductivity of 3078 backedges. 510 proven. 142 refuted. 0 times theorem prover too weak. 2426 trivial. 0 not checked.
[2025-04-28 21:21:58,278 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [274193678] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:58,278 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:58,278 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 25
[2025-04-28 21:21:58,278 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156348652]
[2025-04-28 21:21:58,278 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:58,279 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2025-04-28 21:21:58,279 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:58,284 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2025-04-28 21:21:58,284 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600
[2025-04-28 21:21:58,285 INFO  L87              Difference]: Start difference. First operand 44 states and 80 transitions. Second operand  has 25 states, 11 states have (on average 3.090909090909091) internal successors, (34), 21 states have internal predecessors, (34), 17 states have call successors, (51), 1 states have call predecessors, (51), 11 states have return successors, (57), 21 states have call predecessors, (57), 17 states have call successors, (57)
[2025-04-28 21:21:58,846 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:58,846 INFO  L93              Difference]: Finished difference Result 68 states and 116 transitions.
[2025-04-28 21:21:58,847 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:21:58,847 INFO  L79                 Accepts]: Start accepts. Automaton has  has 25 states, 11 states have (on average 3.090909090909091) internal successors, (34), 21 states have internal predecessors, (34), 17 states have call successors, (51), 1 states have call predecessors, (51), 11 states have return successors, (57), 21 states have call predecessors, (57), 17 states have call successors, (57) Word has length 249
[2025-04-28 21:21:58,848 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:58,849 INFO  L225             Difference]: With dead ends: 68
[2025-04-28 21:21:58,849 INFO  L226             Difference]: Without dead ends: 68
[2025-04-28 21:21:58,850 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870
[2025-04-28 21:21:58,850 INFO  L437           NwaCegarLoop]: 36 mSDtfsCounter, 16 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:58,851 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 435 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-04-28 21:21:58,851 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2025-04-28 21:21:58,859 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56.
[2025-04-28 21:21:58,860 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 56 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 18 states have internal predecessors, (20), 25 states have call successors, (25), 10 states have call predecessors, (25), 11 states have return successors, (55), 27 states have call predecessors, (55), 25 states have call successors, (55)
[2025-04-28 21:21:58,861 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 100 transitions.
[2025-04-28 21:21:58,861 INFO  L79                 Accepts]: Start accepts. Automaton has 56 states and 100 transitions. Word has length 249
[2025-04-28 21:21:58,861 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:58,861 INFO  L485      AbstractCegarLoop]: Abstraction has 56 states and 100 transitions.
[2025-04-28 21:21:58,862 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 11 states have (on average 3.090909090909091) internal successors, (34), 21 states have internal predecessors, (34), 17 states have call successors, (51), 1 states have call predecessors, (51), 11 states have return successors, (57), 21 states have call predecessors, (57), 17 states have call successors, (57)
[2025-04-28 21:21:58,862 INFO  L278                IsEmpty]: Start isEmpty. Operand 56 states and 100 transitions.
[2025-04-28 21:21:58,864 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 204
[2025-04-28 21:21:58,864 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:58,864 INFO  L218           NwaCegarLoop]: trace histogram [34, 26, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:58,871 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:59,069 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2025-04-28 21:21:59,069 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:59,069 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:59,070 INFO  L85        PathProgramCache]: Analyzing trace with hash 1785216519, now seen corresponding path program 4 times
[2025-04-28 21:21:59,070 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:59,070 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044864825]
[2025-04-28 21:21:59,070 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:59,070 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:59,104 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 203 statements into 2 equivalence classes.
[2025-04-28 21:21:59,209 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 203 of 203 statements.
[2025-04-28 21:21:59,209 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:59,210 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
