/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:55:20,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:55:20,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:55:20,178 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:55:20,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:55:20,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:55:20,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:55:20,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:55:20,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:55:20,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:55:20,202 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:55:20,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:55:20,203 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:55:20,203 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:55:20,203 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:55:20,203 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:55:20,204 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:55:20,204 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:55:20,204 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:55:20,204 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:55:20,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:55:20,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:55:20,204 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:55:20,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:55:20,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:55:20,204 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:55:20,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:55:20,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:55:20,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:55:20,205 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:55:20,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:55:20,205 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:55:20,205 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:55:20,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:55:20,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:55:20,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:20,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:55:20,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:55:20,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:55:20,205 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:55:20,205 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:55:20,206 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:55:20,206 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:55:20,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:55:20,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:55:20,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:55:20,445 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:55:20,447 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:55:20,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring.wvr.bpl [2025-04-26 16:55:20,450 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/ring.wvr.bpl' [2025-04-26 16:55:20,472 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:55:20,473 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:55:20,474 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:20,474 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:55:20,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:55:20,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:20" (1/1) ... [2025-04-26 16:55:20,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:20" (1/1) ... [2025-04-26 16:55:20,511 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:55:20,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:20,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:55:20,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:55:20,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:55:20,518 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:20" (1/1) ... [2025-04-26 16:55:20,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:20" (1/1) ... [2025-04-26 16:55:20,520 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:20" (1/1) ... [2025-04-26 16:55:20,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:20" (1/1) ... [2025-04-26 16:55:20,526 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:20" (1/1) ... [2025-04-26 16:55:20,527 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:20" (1/1) ... [2025-04-26 16:55:20,530 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:20" (1/1) ... [2025-04-26 16:55:20,531 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:20" (1/1) ... [2025-04-26 16:55:20,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:20" (1/1) ... [2025-04-26 16:55:20,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:55:20,544 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:55:20,544 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:55:20,544 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:55:20,545 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:20" (1/1) ... [2025-04-26 16:55:20,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:20,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:20,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:20,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:55:20,598 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:55:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:55:20,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:55:20,598 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:55:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:55:20,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:55:20,598 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:55:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:55:20,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:55:20,598 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:55:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:55:20,598 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:55:20,599 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:55:20,642 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:55:20,644 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:55:20,774 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:55:20,774 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:55:20,807 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:55:20,808 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:55:20,809 INFO L201 PluginConnector]: Adding new model ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:20 BoogieIcfgContainer [2025-04-26 16:55:20,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:55:20,810 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:55:20,810 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:55:20,814 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:55:20,815 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:20,815 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:20" (1/2) ... [2025-04-26 16:55:20,816 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28bbf878 and model type ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:55:20, skipping insertion in model container [2025-04-26 16:55:20,816 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:20,816 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:20" (2/2) ... [2025-04-26 16:55:20,817 INFO L376 chiAutomizerObserver]: Analyzing ICFG ring.wvr.bpl [2025-04-26 16:55:20,872 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:55:20,911 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:55:20,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:55:20,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:20,914 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:20,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:55:20,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 45 transitions, 111 flow [2025-04-26 16:55:20,997 INFO L116 PetriNetUnfolderBase]: 3/39 cut-off events. [2025-04-26 16:55:20,998 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:55:21,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 39 events. 3/39 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 88 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-04-26 16:55:21,004 INFO L82 GeneralOperation]: Start removeDead. Operand has 49 places, 45 transitions, 111 flow [2025-04-26 16:55:21,008 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 39 transitions, 96 flow [2025-04-26 16:55:21,009 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 46 places, 39 transitions, 96 flow [2025-04-26 16:55:21,015 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:55:21,248 WARN L140 AmpleReduction]: Number of pruned transitions: 438 [2025-04-26 16:55:21,248 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:55:21,248 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 46 [2025-04-26 16:55:21,248 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:34 [2025-04-26 16:55:21,248 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:269 [2025-04-26 16:55:21,248 WARN L145 AmpleReduction]: Times succ was already a loop node:16 [2025-04-26 16:55:21,248 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:73 [2025-04-26 16:55:21,248 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:55:21,251 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 350 states, 348 states have (on average 1.4022988505747127) internal successors, (in total 488), 349 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:21,258 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:55:21,258 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:55:21,258 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:55:21,258 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:55:21,258 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:55:21,258 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:55:21,258 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:55:21,258 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:55:21,260 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 350 states, 348 states have (on average 1.4022988505747127) internal successors, (in total 488), 349 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:21,280 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 285 [2025-04-26 16:55:21,282 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:21,282 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:21,286 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:55:21,286 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:21,286 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:55:21,286 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 350 states, 348 states have (on average 1.4022988505747127) internal successors, (in total 488), 349 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:21,291 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 285 [2025-04-26 16:55:21,291 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:21,291 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:21,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:55:21,292 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:21,296 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" [2025-04-26 16:55:21,296 INFO L754 eck$LassoCheckResult]: Loop: "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[117] L35-1-->L39: Formula: (and (= v_q3_front_10 (+ v_q3_front_11 1)) (< v_q3_front_11 v_q3_back_6) (= (select v_q3_5 v_q3_front_11) v_l_5)) InVars {q3_front=v_q3_front_11, q3_back=v_q3_back_6, q3=v_q3_5} OutVars{q3_front=v_q3_front_10, q3_back=v_q3_back_6, l=v_l_5, q3=v_q3_5} AuxVars[] AssignedVars[l, q3_front]" "[118] L39-->L45: Formula: (= (+ v_r_3 v_l_2) v_r_2) InVars {l=v_l_2, r=v_r_3} OutVars{l=v_l_2, r=v_r_2} AuxVars[] AssignedVars[r]" "[119] L45-->L34-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" [2025-04-26 16:55:21,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:21,301 INFO L85 PathProgramCache]: Analyzing trace with hash 4189637, now seen corresponding path program 1 times [2025-04-26 16:55:21,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:21,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107243985] [2025-04-26 16:55:21,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:21,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:21,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:21,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:21,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:21,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:21,356 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:21,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:21,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:21,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:21,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:21,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:21,377 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:21,377 INFO L85 PathProgramCache]: Analyzing trace with hash 136529203, now seen corresponding path program 1 times [2025-04-26 16:55:21,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:21,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700071414] [2025-04-26 16:55:21,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:21,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:21,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:21,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:21,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:21,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:21,392 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:21,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:21,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:21,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:21,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:21,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:21,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:21,403 INFO L85 PathProgramCache]: Analyzing trace with hash 306532847, now seen corresponding path program 1 times [2025-04-26 16:55:21,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:21,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462695717] [2025-04-26 16:55:21,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:21,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:21,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:21,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:21,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:21,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:21,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:21,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:21,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462695717] [2025-04-26 16:55:21,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462695717] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:21,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:21,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:55:21,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652350292] [2025-04-26 16:55:21,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:21,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:21,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:55:21,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:55:21,674 INFO L87 Difference]: Start difference. First operand has 350 states, 348 states have (on average 1.4022988505747127) internal successors, (in total 488), 349 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:21,718 INFO L93 Difference]: Finished difference Result 407 states and 563 transitions. [2025-04-26 16:55:21,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 407 states and 563 transitions. [2025-04-26 16:55:21,726 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 316 [2025-04-26 16:55:21,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 407 states to 372 states and 506 transitions. [2025-04-26 16:55:21,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 372 [2025-04-26 16:55:21,739 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 372 [2025-04-26 16:55:21,740 INFO L74 IsDeterministic]: Start isDeterministic. Operand 372 states and 506 transitions. [2025-04-26 16:55:21,741 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:21,741 INFO L218 hiAutomatonCegarLoop]: Abstraction has 372 states and 506 transitions. [2025-04-26 16:55:21,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 506 transitions. [2025-04-26 16:55:21,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 308. [2025-04-26 16:55:21,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 308 states have (on average 1.3668831168831168) internal successors, (in total 421), 307 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 421 transitions. [2025-04-26 16:55:21,776 INFO L240 hiAutomatonCegarLoop]: Abstraction has 308 states and 421 transitions. [2025-04-26 16:55:21,776 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:55:21,778 INFO L438 stractBuchiCegarLoop]: Abstraction has 308 states and 421 transitions. [2025-04-26 16:55:21,778 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:55:21,779 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 308 states and 421 transitions. [2025-04-26 16:55:21,781 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 266 [2025-04-26 16:55:21,781 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:21,781 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:21,781 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:21,781 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:21,782 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" [2025-04-26 16:55:21,782 INFO L754 eck$LassoCheckResult]: Loop: "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" [2025-04-26 16:55:21,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:21,782 INFO L85 PathProgramCache]: Analyzing trace with hash 306557897, now seen corresponding path program 1 times [2025-04-26 16:55:21,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:21,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46486991] [2025-04-26 16:55:21,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:21,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:21,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:21,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:21,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:21,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:21,793 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:21,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:21,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:21,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:21,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:21,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:21,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:21,806 INFO L85 PathProgramCache]: Analyzing trace with hash 146071260, now seen corresponding path program 1 times [2025-04-26 16:55:21,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:21,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327960802] [2025-04-26 16:55:21,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:21,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:21,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:21,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:21,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:21,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:21,817 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:21,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:21,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:21,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:21,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:21,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:21,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:21,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1649428500, now seen corresponding path program 1 times [2025-04-26 16:55:21,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:21,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105212652] [2025-04-26 16:55:21,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:21,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:21,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:55:21,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:55:21,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:21,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:21,841 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:21,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:55:21,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:55:21,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:21,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:21,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:22,095 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:22,096 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:22,096 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:22,096 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:22,096 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:22,096 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:22,096 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:22,096 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:22,096 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:55:22,096 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:22,096 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:22,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,386 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:22,388 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:22,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:22,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:22,391 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:22,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:55:22,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:22,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:22,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:22,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:22,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:22,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:22,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:22,418 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:22,432 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:55:22,433 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:55:22,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:22,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:22,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:22,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:55:22,438 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:22,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:55:22,455 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:22,456 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:22,456 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 16:55:22,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:55:22,463 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:22,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:22,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:22,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:22,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:22,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:22,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:22,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:22,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:22,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:22,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:22,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:22,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:22,570 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:55:22,571 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 308 states and 421 transitions. cyclomatic complexity: 143 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:22,655 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 308 states and 421 transitions. cyclomatic complexity: 143. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 644 states and 867 transitions. Complement of second has 5 states. [2025-04-26 16:55:22,655 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-04-26 16:55:22,658 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 9 letters. Loop has 5 letters. [2025-04-26 16:55:22,658 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:22,658 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 14 letters. Loop has 5 letters. [2025-04-26 16:55:22,658 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:22,658 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 44 transitions. Stem has 9 letters. Loop has 10 letters. [2025-04-26 16:55:22,659 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:22,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 644 states and 867 transitions. [2025-04-26 16:55:22,662 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 281 [2025-04-26 16:55:22,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 644 states to 516 states and 699 transitions. [2025-04-26 16:55:22,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 398 [2025-04-26 16:55:22,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 426 [2025-04-26 16:55:22,666 INFO L74 IsDeterministic]: Start isDeterministic. Operand 516 states and 699 transitions. [2025-04-26 16:55:22,666 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:22,666 INFO L218 hiAutomatonCegarLoop]: Abstraction has 516 states and 699 transitions. [2025-04-26 16:55:22,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states and 699 transitions. [2025-04-26 16:55:22,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 442. [2025-04-26 16:55:22,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 442 states have (on average 1.3778280542986425) internal successors, (in total 609), 441 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:22,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 609 transitions. [2025-04-26 16:55:22,688 INFO L240 hiAutomatonCegarLoop]: Abstraction has 442 states and 609 transitions. [2025-04-26 16:55:22,688 INFO L438 stractBuchiCegarLoop]: Abstraction has 442 states and 609 transitions. [2025-04-26 16:55:22,688 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:55:22,688 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 442 states and 609 transitions. [2025-04-26 16:55:22,689 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 246 [2025-04-26 16:55:22,690 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:22,690 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:22,690 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:22,690 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:22,690 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[112] L34-1-->L47: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[114] L47-->thread1FINAL: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[116] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[122] L58-1-->thread2FINAL: Formula: (not v_f_1) InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[124] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[129] $Ultimate##0-->L77: Formula: (= v_t_3 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[130] L77-->L78-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" [2025-04-26 16:55:22,691 INFO L754 eck$LassoCheckResult]: Loop: "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[136] L84-->L89: Formula: (= v_t_1 (+ v_k_3 v_t_2)) InVars {t=v_t_2, k=v_k_3} OutVars{t=v_t_1, k=v_k_3} AuxVars[] AssignedVars[t]" "[137] L89-->L78-1: Formula: (or (and (< 0 v_k_4) v_g_2) (and (<= v_k_4 0) (not v_g_2))) InVars {k=v_k_4} OutVars{k=v_k_4, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:55:22,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash -669837906, now seen corresponding path program 1 times [2025-04-26 16:55:22,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:22,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247958008] [2025-04-26 16:55:22,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:22,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:22,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:55:22,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:55:22,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:22,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:22,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247958008] [2025-04-26 16:55:22,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247958008] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:22,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:22,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:55:22,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713304545] [2025-04-26 16:55:22,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:22,721 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:22,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:22,721 INFO L85 PathProgramCache]: Analyzing trace with hash 154660005, now seen corresponding path program 1 times [2025-04-26 16:55:22,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:22,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298919980] [2025-04-26 16:55:22,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:22,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:22,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:22,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:22,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:22,727 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:22,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:22,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:22,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:22,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:22,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:22,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:55:22,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:55:22,808 INFO L87 Difference]: Start difference. First operand 442 states and 609 transitions. cyclomatic complexity: 201 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:22,845 INFO L93 Difference]: Finished difference Result 442 states and 607 transitions. [2025-04-26 16:55:22,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 442 states and 607 transitions. [2025-04-26 16:55:22,847 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 246 [2025-04-26 16:55:22,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 442 states to 442 states and 607 transitions. [2025-04-26 16:55:22,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 352 [2025-04-26 16:55:22,850 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 352 [2025-04-26 16:55:22,850 INFO L74 IsDeterministic]: Start isDeterministic. Operand 442 states and 607 transitions. [2025-04-26 16:55:22,850 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:22,850 INFO L218 hiAutomatonCegarLoop]: Abstraction has 442 states and 607 transitions. [2025-04-26 16:55:22,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states and 607 transitions. [2025-04-26 16:55:22,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-04-26 16:55:22,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 442 states have (on average 1.3733031674208145) internal successors, (in total 607), 441 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 607 transitions. [2025-04-26 16:55:22,857 INFO L240 hiAutomatonCegarLoop]: Abstraction has 442 states and 607 transitions. [2025-04-26 16:55:22,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:55:22,859 INFO L438 stractBuchiCegarLoop]: Abstraction has 442 states and 607 transitions. [2025-04-26 16:55:22,859 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:55:22,859 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 442 states and 607 transitions. [2025-04-26 16:55:22,860 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 246 [2025-04-26 16:55:22,860 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:22,860 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:22,861 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:22,861 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:22,861 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[129] $Ultimate##0-->L77: Formula: (= v_t_3 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[130] L77-->L78-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" [2025-04-26 16:55:22,861 INFO L754 eck$LassoCheckResult]: Loop: "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[136] L84-->L89: Formula: (= v_t_1 (+ v_k_3 v_t_2)) InVars {t=v_t_2, k=v_k_3} OutVars{t=v_t_1, k=v_k_3} AuxVars[] AssignedVars[t]" "[137] L89-->L78-1: Formula: (or (and (< 0 v_k_4) v_g_2) (and (<= v_k_4 0) (not v_g_2))) InVars {k=v_k_4} OutVars{k=v_k_4, g=v_g_2} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" [2025-04-26 16:55:22,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:22,862 INFO L85 PathProgramCache]: Analyzing trace with hash -387837597, now seen corresponding path program 1 times [2025-04-26 16:55:22,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:22,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476878199] [2025-04-26 16:55:22,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:22,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:22,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:55:22,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:55:22,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:22,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:22,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476878199] [2025-04-26 16:55:22,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476878199] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:22,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:22,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:55:22,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723973920] [2025-04-26 16:55:22,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:22,915 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:22,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:22,915 INFO L85 PathProgramCache]: Analyzing trace with hash 157491945, now seen corresponding path program 2 times [2025-04-26 16:55:22,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:22,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793039474] [2025-04-26 16:55:22,915 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:22,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:22,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:22,921 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:22,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:22,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:22,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:22,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:22,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:22,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:22,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:22,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:22,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:55:22,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:55:22,989 INFO L87 Difference]: Start difference. First operand 442 states and 607 transitions. cyclomatic complexity: 199 Second operand has 3 states, 2 states have (on average 7.5) internal successors, (in total 15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:23,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:23,014 INFO L93 Difference]: Finished difference Result 456 states and 624 transitions. [2025-04-26 16:55:23,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 456 states and 624 transitions. [2025-04-26 16:55:23,016 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 246 [2025-04-26 16:55:23,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 456 states to 451 states and 619 transitions. [2025-04-26 16:55:23,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 352 [2025-04-26 16:55:23,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 352 [2025-04-26 16:55:23,019 INFO L74 IsDeterministic]: Start isDeterministic. Operand 451 states and 619 transitions. [2025-04-26 16:55:23,019 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:23,019 INFO L218 hiAutomatonCegarLoop]: Abstraction has 451 states and 619 transitions. [2025-04-26 16:55:23,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states and 619 transitions. [2025-04-26 16:55:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 447. [2025-04-26 16:55:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 447 states have (on average 1.3691275167785235) internal successors, (in total 612), 446 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 612 transitions. [2025-04-26 16:55:23,026 INFO L240 hiAutomatonCegarLoop]: Abstraction has 447 states and 612 transitions. [2025-04-26 16:55:23,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:55:23,027 INFO L438 stractBuchiCegarLoop]: Abstraction has 447 states and 612 transitions. [2025-04-26 16:55:23,027 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:55:23,027 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 447 states and 612 transitions. [2025-04-26 16:55:23,028 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 246 [2025-04-26 16:55:23,028 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:23,028 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:23,029 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:23,029 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:23,029 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[112] L34-1-->L47: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[114] L47-->thread1FINAL: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" "[116] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[129] $Ultimate##0-->L77: Formula: (= v_t_3 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[122] L58-1-->thread2FINAL: Formula: (not v_f_1) InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[130] L77-->L78-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" [2025-04-26 16:55:23,029 INFO L754 eck$LassoCheckResult]: Loop: "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[136] L84-->L89: Formula: (= v_t_1 (+ v_k_3 v_t_2)) InVars {t=v_t_2, k=v_k_3} OutVars{t=v_t_1, k=v_k_3} AuxVars[] AssignedVars[t]" "[137] L89-->L78-1: Formula: (or (and (< 0 v_k_4) v_g_2) (and (<= v_k_4 0) (not v_g_2))) InVars {k=v_k_4} OutVars{k=v_k_4, g=v_g_2} AuxVars[] AssignedVars[g]" [2025-04-26 16:55:23,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:23,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1611537421, now seen corresponding path program 1 times [2025-04-26 16:55:23,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:23,031 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472396509] [2025-04-26 16:55:23,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:23,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:23,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:55:23,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:55:23,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:23,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:23,042 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:23,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:55:23,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:55:23,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:23,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:23,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:23,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:23,052 INFO L85 PathProgramCache]: Analyzing trace with hash 154660005, now seen corresponding path program 3 times [2025-04-26 16:55:23,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:23,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410402263] [2025-04-26 16:55:23,052 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:23,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:23,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:23,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:23,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:55:23,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:23,064 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:23,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:23,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:23,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:23,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:23,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:23,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:23,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1326403597, now seen corresponding path program 1 times [2025-04-26 16:55:23,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:23,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342086005] [2025-04-26 16:55:23,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:23,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:23,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:55:23,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:55:23,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:23,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:23,090 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:23,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:55:23,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:55:23,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:23,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:23,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:23,396 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:23,397 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:23,397 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:23,397 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:23,397 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:23,397 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,397 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:23,397 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:23,397 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:55:23,397 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:23,397 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:23,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,765 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:23,766 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:23,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,767 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:55:23,770 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,782 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,782 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,784 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:23,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:23,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,793 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:55:23,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,810 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:23,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:23,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,819 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:55:23,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,836 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:23,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:23,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,844 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:55:23,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,863 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:23,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:55:23,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,870 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:55:23,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,891 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:23,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:23,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,900 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:55:23,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,916 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:23,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:55:23,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,936 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:55:23,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,951 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:23,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:55:23,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,959 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:55:23,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,972 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,972 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,975 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:23,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:55:23,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,983 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:55:23,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:24,000 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:24,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:55:24,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:24,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:24,008 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:24,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:55:24,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:24,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:24,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:24,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:24,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:24,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:24,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:24,028 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:24,038 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:55:24,038 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:55:24,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:24,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:24,041 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:24,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:55:24,043 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:24,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:55:24,060 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:24,060 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:24,060 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2025-04-26 16:55:24,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:55:24,069 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:55:24,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:24,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:55:24,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:55:24,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:24,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:24,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:24,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:24,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:24,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:24,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:24,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:24,149 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:55:24,149 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 447 states and 612 transitions. cyclomatic complexity: 199 Second operand has 4 states, 4 states have (on average 6.0) internal successors, (in total 24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:24,196 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 447 states and 612 transitions. cyclomatic complexity: 199. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (in total 24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 713 states and 948 transitions. Complement of second has 5 states. [2025-04-26 16:55:24,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (in total 24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-26 16:55:24,197 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 19 letters. Loop has 5 letters. [2025-04-26 16:55:24,197 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:24,197 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 24 letters. Loop has 5 letters. [2025-04-26 16:55:24,197 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:24,197 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 19 letters. Loop has 10 letters. [2025-04-26 16:55:24,198 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:24,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 713 states and 948 transitions. [2025-04-26 16:55:24,201 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 286 [2025-04-26 16:55:24,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 713 states to 560 states and 758 transitions. [2025-04-26 16:55:24,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 411 [2025-04-26 16:55:24,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 420 [2025-04-26 16:55:24,217 INFO L74 IsDeterministic]: Start isDeterministic. Operand 560 states and 758 transitions. [2025-04-26 16:55:24,217 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:24,217 INFO L218 hiAutomatonCegarLoop]: Abstraction has 560 states and 758 transitions. [2025-04-26 16:55:24,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states and 758 transitions. [2025-04-26 16:55:24,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 489. [2025-04-26 16:55:24,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 489 states have (on average 1.3578732106339468) internal successors, (in total 664), 488 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 664 transitions. [2025-04-26 16:55:24,225 INFO L240 hiAutomatonCegarLoop]: Abstraction has 489 states and 664 transitions. [2025-04-26 16:55:24,225 INFO L438 stractBuchiCegarLoop]: Abstraction has 489 states and 664 transitions. [2025-04-26 16:55:24,225 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:55:24,225 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 489 states and 664 transitions. [2025-04-26 16:55:24,227 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 256 [2025-04-26 16:55:24,227 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:24,227 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:24,227 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:24,227 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:24,228 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[129] $Ultimate##0-->L77: Formula: (= v_t_3 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[130] L77-->L78-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[122] L58-1-->thread2FINAL: Formula: (not v_f_1) InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" [2025-04-26 16:55:24,228 INFO L754 eck$LassoCheckResult]: Loop: "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[136] L84-->L89: Formula: (= v_t_1 (+ v_k_3 v_t_2)) InVars {t=v_t_2, k=v_k_3} OutVars{t=v_t_1, k=v_k_3} AuxVars[] AssignedVars[t]" "[137] L89-->L78-1: Formula: (or (and (< 0 v_k_4) v_g_2) (and (<= v_k_4 0) (not v_g_2))) InVars {k=v_k_4} OutVars{k=v_k_4, g=v_g_2} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" [2025-04-26 16:55:24,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:24,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1667168299, now seen corresponding path program 1 times [2025-04-26 16:55:24,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:24,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449557714] [2025-04-26 16:55:24,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:24,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:24,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:55:24,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:55:24,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:24,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:24,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:24,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449557714] [2025-04-26 16:55:24,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449557714] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:24,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:24,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:55:24,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684719097] [2025-04-26 16:55:24,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:24,301 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:24,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:24,301 INFO L85 PathProgramCache]: Analyzing trace with hash 156537825, now seen corresponding path program 4 times [2025-04-26 16:55:24,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:24,301 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6411773] [2025-04-26 16:55:24,301 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:55:24,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:24,305 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 5 statements into 2 equivalence classes. [2025-04-26 16:55:24,307 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:24,307 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:55:24,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:24,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:24,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:24,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:24,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:24,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:55:24,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:55:24,367 INFO L87 Difference]: Start difference. First operand 489 states and 664 transitions. cyclomatic complexity: 215 Second operand has 6 states, 5 states have (on average 3.8) internal successors, (in total 19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:24,444 INFO L93 Difference]: Finished difference Result 601 states and 808 transitions. [2025-04-26 16:55:24,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 601 states and 808 transitions. [2025-04-26 16:55:24,447 INFO L131 ngComponentsAnalysis]: Automaton has 33 accepting balls. 285 [2025-04-26 16:55:24,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 601 states to 601 states and 808 transitions. [2025-04-26 16:55:24,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 429 [2025-04-26 16:55:24,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 429 [2025-04-26 16:55:24,451 INFO L74 IsDeterministic]: Start isDeterministic. Operand 601 states and 808 transitions. [2025-04-26 16:55:24,451 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:24,451 INFO L218 hiAutomatonCegarLoop]: Abstraction has 601 states and 808 transitions. [2025-04-26 16:55:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states and 808 transitions. [2025-04-26 16:55:24,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 498. [2025-04-26 16:55:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 498 states have (on average 1.355421686746988) internal successors, (in total 675), 497 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 675 transitions. [2025-04-26 16:55:24,460 INFO L240 hiAutomatonCegarLoop]: Abstraction has 498 states and 675 transitions. [2025-04-26 16:55:24,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 16:55:24,461 INFO L438 stractBuchiCegarLoop]: Abstraction has 498 states and 675 transitions. [2025-04-26 16:55:24,461 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:55:24,461 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 498 states and 675 transitions. [2025-04-26 16:55:24,463 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 256 [2025-04-26 16:55:24,463 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:24,463 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:24,463 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:24,463 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:24,464 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[129] $Ultimate##0-->L77: Formula: (= v_t_3 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[130] L77-->L78-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" [2025-04-26 16:55:24,464 INFO L754 eck$LassoCheckResult]: Loop: "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[136] L84-->L89: Formula: (= v_t_1 (+ v_k_3 v_t_2)) InVars {t=v_t_2, k=v_k_3} OutVars{t=v_t_1, k=v_k_3} AuxVars[] AssignedVars[t]" "[137] L89-->L78-1: Formula: (or (and (< 0 v_k_4) v_g_2) (and (<= v_k_4 0) (not v_g_2))) InVars {k=v_k_4} OutVars{k=v_k_4, g=v_g_2} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" [2025-04-26 16:55:24,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:24,464 INFO L85 PathProgramCache]: Analyzing trace with hash -142609552, now seen corresponding path program 1 times [2025-04-26 16:55:24,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:24,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803504806] [2025-04-26 16:55:24,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:24,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:24,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:55:24,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:55:24,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,476 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:24,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:55:24,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:55:24,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,487 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:24,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:24,487 INFO L85 PathProgramCache]: Analyzing trace with hash 157491945, now seen corresponding path program 5 times [2025-04-26 16:55:24,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:24,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454018137] [2025-04-26 16:55:24,487 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:55:24,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:24,489 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:24,490 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:24,490 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:24,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,491 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:24,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:24,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:24,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:24,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:24,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1347222746, now seen corresponding path program 1 times [2025-04-26 16:55:24,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:24,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306284424] [2025-04-26 16:55:24,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:24,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:24,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:55:24,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:55:24,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:24,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:24,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306284424] [2025-04-26 16:55:24,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306284424] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:55:24,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610317377] [2025-04-26 16:55:24,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:24,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:55:24,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:24,546 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:55:24,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-26 16:55:24,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:55:24,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:55:24,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:24,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:24,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:24,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-26 16:55:24,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:55:24,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-26 16:55:24,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610317377] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:55:24,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:55:24,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 3 [2025-04-26 16:55:24,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693034508] [2025-04-26 16:55:24,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:55:24,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:24,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:55:24,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:55:24,708 INFO L87 Difference]: Start difference. First operand 498 states and 675 transitions. cyclomatic complexity: 217 Second operand has 5 states, 4 states have (on average 10.0) internal successors, (in total 40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:24,754 INFO L93 Difference]: Finished difference Result 885 states and 1170 transitions. [2025-04-26 16:55:24,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 885 states and 1170 transitions. [2025-04-26 16:55:24,758 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 394 [2025-04-26 16:55:24,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 885 states to 802 states and 1071 transitions. [2025-04-26 16:55:24,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2025-04-26 16:55:24,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 628 [2025-04-26 16:55:24,761 INFO L74 IsDeterministic]: Start isDeterministic. Operand 802 states and 1071 transitions. [2025-04-26 16:55:24,762 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:24,762 INFO L218 hiAutomatonCegarLoop]: Abstraction has 802 states and 1071 transitions. [2025-04-26 16:55:24,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states and 1071 transitions. [2025-04-26 16:55:24,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 586. [2025-04-26 16:55:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 586 states have (on average 1.3447098976109215) internal successors, (in total 788), 585 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 788 transitions. [2025-04-26 16:55:24,772 INFO L240 hiAutomatonCegarLoop]: Abstraction has 586 states and 788 transitions. [2025-04-26 16:55:24,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:55:24,774 INFO L438 stractBuchiCegarLoop]: Abstraction has 586 states and 788 transitions. [2025-04-26 16:55:24,774 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:55:24,774 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 586 states and 788 transitions. [2025-04-26 16:55:24,776 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 279 [2025-04-26 16:55:24,776 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:24,776 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:24,776 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:24,776 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:24,776 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[129] $Ultimate##0-->L77: Formula: (= v_t_3 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[130] L77-->L78-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[122] L58-1-->thread2FINAL: Formula: (not v_f_1) InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" [2025-04-26 16:55:24,777 INFO L754 eck$LassoCheckResult]: Loop: "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[136] L84-->L89: Formula: (= v_t_1 (+ v_k_3 v_t_2)) InVars {t=v_t_2, k=v_k_3} OutVars{t=v_t_1, k=v_k_3} AuxVars[] AssignedVars[t]" "[137] L89-->L78-1: Formula: (or (and (< 0 v_k_4) v_g_2) (and (<= v_k_4 0) (not v_g_2))) InVars {k=v_k_4} OutVars{k=v_k_4, g=v_g_2} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" [2025-04-26 16:55:24,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:24,777 INFO L85 PathProgramCache]: Analyzing trace with hash -2043339934, now seen corresponding path program 2 times [2025-04-26 16:55:24,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:24,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545428492] [2025-04-26 16:55:24,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:24,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:24,779 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-26 16:55:24,782 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:55:24,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:24,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:24,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:24,847 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545428492] [2025-04-26 16:55:24,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545428492] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:24,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:24,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:55:24,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646313234] [2025-04-26 16:55:24,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:24,848 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:24,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:24,848 INFO L85 PathProgramCache]: Analyzing trace with hash 156537825, now seen corresponding path program 6 times [2025-04-26 16:55:24,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:24,848 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703225796] [2025-04-26 16:55:24,848 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:55:24,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:24,850 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:24,852 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:24,852 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:55:24,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,852 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:24,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:24,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:24,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:24,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:24,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:55:24,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:55:24,905 INFO L87 Difference]: Start difference. First operand 586 states and 788 transitions. cyclomatic complexity: 245 Second operand has 5 states, 5 states have (on average 4.8) internal successors, (in total 24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:24,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:24,938 INFO L93 Difference]: Finished difference Result 711 states and 914 transitions. [2025-04-26 16:55:24,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 711 states and 914 transitions. [2025-04-26 16:55:24,941 INFO L131 ngComponentsAnalysis]: Automaton has 47 accepting balls. 396 [2025-04-26 16:55:24,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 711 states to 617 states and 812 transitions. [2025-04-26 16:55:24,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 610 [2025-04-26 16:55:24,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 617 [2025-04-26 16:55:24,944 INFO L74 IsDeterministic]: Start isDeterministic. Operand 617 states and 812 transitions. [2025-04-26 16:55:24,946 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:24,946 INFO L218 hiAutomatonCegarLoop]: Abstraction has 617 states and 812 transitions. [2025-04-26 16:55:24,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states and 812 transitions. [2025-04-26 16:55:24,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 405. [2025-04-26 16:55:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 405 states have (on average 1.34320987654321) internal successors, (in total 544), 404 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:24,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 544 transitions. [2025-04-26 16:55:24,953 INFO L240 hiAutomatonCegarLoop]: Abstraction has 405 states and 544 transitions. [2025-04-26 16:55:24,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:55:24,955 INFO L438 stractBuchiCegarLoop]: Abstraction has 405 states and 544 transitions. [2025-04-26 16:55:24,955 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:55:24,955 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 405 states and 544 transitions. [2025-04-26 16:55:24,956 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 306 [2025-04-26 16:55:24,956 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:24,956 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:24,957 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:24,957 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:24,957 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[129] $Ultimate##0-->L77: Formula: (= v_t_3 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[130] L77-->L78-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" [2025-04-26 16:55:24,957 INFO L754 eck$LassoCheckResult]: Loop: "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[136] L84-->L89: Formula: (= v_t_1 (+ v_k_3 v_t_2)) InVars {t=v_t_2, k=v_k_3} OutVars{t=v_t_1, k=v_k_3} AuxVars[] AssignedVars[t]" "[137] L89-->L78-1: Formula: (or (and (< 0 v_k_4) v_g_2) (and (<= v_k_4 0) (not v_g_2))) InVars {k=v_k_4} OutVars{k=v_k_4, g=v_g_2} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[117] L35-1-->L39: Formula: (and (= v_q3_front_10 (+ v_q3_front_11 1)) (< v_q3_front_11 v_q3_back_6) (= (select v_q3_5 v_q3_front_11) v_l_5)) InVars {q3_front=v_q3_front_11, q3_back=v_q3_back_6, q3=v_q3_5} OutVars{q3_front=v_q3_front_10, q3_back=v_q3_back_6, l=v_l_5, q3=v_q3_5} AuxVars[] AssignedVars[l, q3_front]" "[118] L39-->L45: Formula: (= (+ v_r_3 v_l_2) v_r_2) InVars {l=v_l_2, r=v_r_3} OutVars{l=v_l_2, r=v_r_2} AuxVars[] AssignedVars[r]" "[119] L45-->L34-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" [2025-04-26 16:55:24,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:24,957 INFO L85 PathProgramCache]: Analyzing trace with hash -142609552, now seen corresponding path program 2 times [2025-04-26 16:55:24,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:24,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248970153] [2025-04-26 16:55:24,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:24,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:24,962 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-26 16:55:24,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:55:24,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:55:24,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,966 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:24,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:55:24,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:55:24,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:24,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:24,973 INFO L85 PathProgramCache]: Analyzing trace with hash -364142232, now seen corresponding path program 1 times [2025-04-26 16:55:24,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:24,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365553475] [2025-04-26 16:55:24,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:24,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:24,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:55:24,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:55:24,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,981 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:24,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:55:24,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:55:24,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:24,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:24,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1757839897, now seen corresponding path program 1 times [2025-04-26 16:55:24,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:24,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933066776] [2025-04-26 16:55:24,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:24,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:24,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-26 16:55:24,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-26 16:55:24,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:24,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-26 16:55:25,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-26 16:55:25,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:25,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:25,423 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:25,423 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:25,424 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:25,424 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:25,424 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:25,424 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,424 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:25,424 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:25,424 INFO L132 ssoRankerPreferences]: Filename of dumped script: ring.wvr.bpl_petrified1_Iteration9_Lasso [2025-04-26 16:55:25,424 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:25,424 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:25,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:25,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:25,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:25,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:25,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:25,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:25,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:25,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:25,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:25,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:25,889 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:25,889 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:25,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:25,891 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:25,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:55:25,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:25,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:25,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:25,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:25,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:25,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:25,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:25,906 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:25,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:25,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:25,913 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:25,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:55:25,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:25,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:25,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:25,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:25,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:25,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:25,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:25,928 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:25,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:55:25,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:25,936 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:25,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:55:25,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:25,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:25,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:25,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:25,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:25,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:25,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:25,952 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:25,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:55:25,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:25,961 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:25,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:55:25,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:25,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:25,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:25,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:25,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:25,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:25,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:25,986 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:25,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:55:25,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:25,994 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:25,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:55:25,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:26,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:26,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:26,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:26,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:26,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:26,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:26,010 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:26,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:55:26,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,018 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:26,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:55:26,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:26,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:26,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:26,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:26,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:26,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:26,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:26,033 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:26,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:55:26,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,041 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:26,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:55:26,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:26,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:26,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:26,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:26,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:26,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:26,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:26,061 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:26,069 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:55:26,069 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:55:26,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,071 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:26,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:55:26,073 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:26,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:55:26,096 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:26,096 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:26,096 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 16:55:26,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:26,111 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-04-26 16:55:26,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:26,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 16:55:26,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 16:55:26,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:26,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:26,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:26,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:55:26,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:55:26,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:26,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:26,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:26,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:26,227 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:55:26,227 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 405 states and 544 transitions. cyclomatic complexity: 168 Second operand has 5 states, 5 states have (on average 6.8) internal successors, (in total 34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:26,282 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 405 states and 544 transitions. cyclomatic complexity: 168. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (in total 34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 787 states and 1079 transitions. Complement of second has 6 states. [2025-04-26 16:55:26,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (in total 34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2025-04-26 16:55:26,284 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 20 letters. Loop has 15 letters. [2025-04-26 16:55:26,284 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:26,284 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 35 letters. Loop has 15 letters. [2025-04-26 16:55:26,284 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:26,284 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 20 letters. Loop has 30 letters. [2025-04-26 16:55:26,285 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:26,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 787 states and 1079 transitions. [2025-04-26 16:55:26,290 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 179 [2025-04-26 16:55:26,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 787 states to 511 states and 686 transitions. [2025-04-26 16:55:26,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 336 [2025-04-26 16:55:26,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 357 [2025-04-26 16:55:26,293 INFO L74 IsDeterministic]: Start isDeterministic. Operand 511 states and 686 transitions. [2025-04-26 16:55:26,293 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:26,293 INFO L218 hiAutomatonCegarLoop]: Abstraction has 511 states and 686 transitions. [2025-04-26 16:55:26,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states and 686 transitions. [2025-04-26 16:55:26,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 494. [2025-04-26 16:55:26,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 494 states have (on average 1.3299595141700404) internal successors, (in total 657), 493 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 657 transitions. [2025-04-26 16:55:26,299 INFO L240 hiAutomatonCegarLoop]: Abstraction has 494 states and 657 transitions. [2025-04-26 16:55:26,299 INFO L438 stractBuchiCegarLoop]: Abstraction has 494 states and 657 transitions. [2025-04-26 16:55:26,299 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:55:26,300 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 494 states and 657 transitions. [2025-04-26 16:55:26,301 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 179 [2025-04-26 16:55:26,301 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:26,301 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:26,301 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:26,301 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:55:26,302 INFO L752 eck$LassoCheckResult]: Stem: "[105] $Ultimate##0-->L97: Formula: (and (= v_q3_front_5 v_q3_back_2) (<= 0 v_N_3) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_8 v_q1_front_5)) InVars {q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_5, N=v_N_3, q2_back=v_q2_back_4, q3_front=v_q3_front_5, q3_back=v_q3_back_2, q1_back=v_q1_back_8, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[140] L97-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[110] $Ultimate##0-->L33: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[111] L33-->L34-1: Formula: (= v_r_1 0) InVars {} OutVars{r=v_r_1} AuxVars[] AssignedVars[r]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[143] L97-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[120] $Ultimate##0-->L57: Formula: (= v_s_1 0) InVars {} OutVars{s=v_s_1} AuxVars[] AssignedVars[s]" "[121] L57-->L58-1: Formula: v_f_2 InVars {} OutVars{f=v_f_2} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[146] L98-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[129] $Ultimate##0-->L77: Formula: (= v_t_3 0) InVars {} OutVars{t=v_t_3} AuxVars[] AssignedVars[t]" "[130] L77-->L78-1: Formula: v_g_4 InVars {} OutVars{g=v_g_4} AuxVars[] AssignedVars[g]" "[132] L78-1-->L79: Formula: v_g_1 InVars {g=v_g_1} OutVars{g=v_g_1} AuxVars[] AssignedVars[]" "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[134] L79-->L79-1: Formula: (and (< v_q2_front_11 v_q2_back_10) (= (+ v_q2_front_11 1) v_q2_front_10) (= (select v_q2_7 v_q2_front_11) v_k_9)) InVars {q2=v_q2_7, q2_front=v_q2_front_11, q2_back=v_q2_back_10} OutVars{q2=v_q2_7, k=v_k_9, q2_front=v_q2_front_10, q2_back=v_q2_back_10} AuxVars[] AssignedVars[k, q2_front]" "[135] L79-1-->L84: Formula: (and (= (+ (select v_q3_7 v_q3_back_9) 1) v_k_5) (= v_q3_back_8 (+ v_q3_back_9 1))) InVars {q3_back=v_q3_back_9, k=v_k_5, q3=v_q3_7} OutVars{q3_back=v_q3_back_8, k=v_k_5, q3=v_q3_7} AuxVars[] AssignedVars[q3_back]" "[136] L84-->L89: Formula: (= v_t_1 (+ v_k_3 v_t_2)) InVars {t=v_t_2, k=v_k_3} OutVars{t=v_t_1, k=v_k_3} AuxVars[] AssignedVars[t]" "[137] L89-->L78-1: Formula: (or (and (< 0 v_k_4) v_g_2) (and (<= v_k_4 0) (not v_g_2))) InVars {k=v_k_4} OutVars{k=v_k_4, g=v_g_2} AuxVars[] AssignedVars[g]" "[131] L78-1-->thread3FINAL: Formula: (not v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" "[117] L35-1-->L39: Formula: (and (= v_q3_front_10 (+ v_q3_front_11 1)) (< v_q3_front_11 v_q3_back_6) (= (select v_q3_5 v_q3_front_11) v_l_5)) InVars {q3_front=v_q3_front_11, q3_back=v_q3_back_6, q3=v_q3_5} OutVars{q3_front=v_q3_front_10, q3_back=v_q3_back_6, l=v_l_5, q3=v_q3_5} AuxVars[] AssignedVars[l, q3_front]" "[118] L39-->L45: Formula: (= (+ v_r_3 v_l_2) v_r_2) InVars {l=v_l_2, r=v_r_3} OutVars{l=v_l_2, r=v_r_2} AuxVars[] AssignedVars[r]" "[119] L45-->L34-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[113] L34-1-->L35: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[115] L35-->L35-1: Formula: (and (= (+ 1 v_q1_back_14) v_q1_back_13) (= 2 (select v_q1_6 v_q1_back_14))) InVars {q1=v_q1_6, q1_back=v_q1_back_14} OutVars{q1=v_q1_6, q1_back=v_q1_back_13} AuxVars[] AssignedVars[q1_back]" "[117] L35-1-->L39: Formula: (and (= v_q3_front_10 (+ v_q3_front_11 1)) (< v_q3_front_11 v_q3_back_6) (= (select v_q3_5 v_q3_front_11) v_l_5)) InVars {q3_front=v_q3_front_11, q3_back=v_q3_back_6, q3=v_q3_5} OutVars{q3_front=v_q3_front_10, q3_back=v_q3_back_6, l=v_l_5, q3=v_q3_5} AuxVars[] AssignedVars[l, q3_front]" "[118] L39-->L45: Formula: (= (+ v_r_3 v_l_2) v_r_2) InVars {l=v_l_2, r=v_r_3} OutVars{l=v_l_2, r=v_r_2} AuxVars[] AssignedVars[r]" "[119] L45-->L34-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[112] L34-1-->L47: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[114] L47-->thread1FINAL: Formula: (and (= (select v_q1_4 v_q1_back_10) 0) (= v_q1_back_9 (+ 1 v_q1_back_10))) InVars {q1=v_q1_4, q1_back=v_q1_back_10} OutVars{q1=v_q1_4, q1_back=v_q1_back_9} AuxVars[] AssignedVars[q1_back]" [2025-04-26 16:55:26,302 INFO L754 eck$LassoCheckResult]: Loop: "[125] L59-->L59-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (< v_q1_front_11 v_q1_back_17) (= (select v_q1_10 v_q1_front_11) v_j_7)) InVars {q1_front=v_q1_front_11, q1=v_q1_10, q1_back=v_q1_back_17} OutVars{q1_front=v_q1_front_10, q1=v_q1_10, q1_back=v_q1_back_17, j=v_j_7} AuxVars[] AssignedVars[q1_front, j]" "[126] L59-1-->L64: Formula: (and (= (+ (select v_q2_3 v_q2_back_7) 1) v_j_9) (= (+ v_q2_back_7 1) v_q2_back_6)) InVars {q2=v_q2_3, q2_back=v_q2_back_7, j=v_j_9} OutVars{q2=v_q2_3, q2_back=v_q2_back_6, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[127] L64-->L69: Formula: (= (+ v_j_3 v_s_3) v_s_2) InVars {s=v_s_3, j=v_j_3} OutVars{s=v_s_2, j=v_j_3} AuxVars[] AssignedVars[s]" "[128] L69-->L58-1: Formula: (or (and (< 0 v_j_4) v_f_4) (and (not v_f_4) (<= v_j_4 0))) InVars {j=v_j_4} OutVars{j=v_j_4, f=v_f_4} AuxVars[] AssignedVars[f]" "[123] L58-1-->L59: Formula: v_f_3 InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 16:55:26,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:26,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1894756789, now seen corresponding path program 1 times [2025-04-26 16:55:26,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:26,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482968222] [2025-04-26 16:55:26,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:26,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:26,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:55:26,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:55:26,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-26 16:55:26,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:26,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482968222] [2025-04-26 16:55:26,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482968222] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:55:26,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027887796] [2025-04-26 16:55:26,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:26,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:55:26,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,408 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:55:26,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-26 16:55:26,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:55:26,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:55:26,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:26,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:26,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:55:26,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:55:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:55:26,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027887796] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:55:26,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:55:26,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 9 [2025-04-26 16:55:26,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902342885] [2025-04-26 16:55:26,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:55:26,530 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:55:26,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:26,530 INFO L85 PathProgramCache]: Analyzing trace with hash 147949080, now seen corresponding path program 2 times [2025-04-26 16:55:26,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:26,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389923055] [2025-04-26 16:55:26,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:26,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:26,532 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:26,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:26,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:26,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:26,535 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:26,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:26,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:26,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:26,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:26,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:26,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-26 16:55:26,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-04-26 16:55:26,591 INFO L87 Difference]: Start difference. First operand 494 states and 657 transitions. cyclomatic complexity: 193 Second operand has 10 states, 10 states have (on average 5.8) internal successors, (in total 58), 9 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:26,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:26,725 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2025-04-26 16:55:26,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 82 transitions. [2025-04-26 16:55:26,726 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:26,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 0 states and 0 transitions. [2025-04-26 16:55:26,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:55:26,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:55:26,726 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:55:26,726 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:26,726 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:26,726 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:26,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-26 16:55:26,727 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:26,727 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:55:26,727 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:55:26,728 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:26,728 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:55:26,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:55:26,739 INFO L201 PluginConnector]: Adding new model ring.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:26 BoogieIcfgContainer [2025-04-26 16:55:26,739 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:26,740 INFO L158 Benchmark]: Toolchain (without parser) took 6266.23ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 93.9MB in the beginning and 93.3MB in the end (delta: 532.5kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:26,740 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.73ms. Allocated memory is still 167.8MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:26,740 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.64ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 91.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:26,740 INFO L158 Benchmark]: Boogie Preprocessor took 29.93ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 90.9MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:55:26,740 INFO L158 Benchmark]: RCFGBuilder took 265.20ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 79.3MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:55:26,741 INFO L158 Benchmark]: BuchiAutomizer took 5929.49ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 79.3MB in the beginning and 93.3MB in the end (delta: -14.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:26,741 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.73ms. Allocated memory is still 167.8MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.64ms. Allocated memory is still 167.8MB. Free memory was 93.9MB in the beginning and 91.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 29.93ms. Allocated memory is still 167.8MB. Free memory was 91.9MB in the beginning and 90.9MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 265.20ms. Allocated memory is still 167.8MB. Free memory was 90.8MB in the beginning and 79.3MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 5929.49ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 79.3MB in the beginning and 93.3MB in the end (delta: -14.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.8s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 4.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 761 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 500 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 497 mSDsluCounter, 653 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 393 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 469 IncrementalHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 260 mSDtfsCounter, 469 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU5 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital137 mio100 ax100 hnf100 lsp81 ukn94 mio100 lsp59 div100 bol110 ite100 ukn100 eq190 hnf89 smp100 dnf188 smp73 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 67ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 344, Number of transitions in reduction automaton: 488, Number of states in reduction automaton: 350, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (7 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. 7 modules have a trivial ranking function, the largest among these consists of 10 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:55:26,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-26 16:55:26,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-26 16:55:27,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...