/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-more/queue-add-2-nl.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:21,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:21,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:21,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:21,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:21,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:21,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:21,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:21,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:21,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:21,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:21,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:21,786 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:21,786 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:21,786 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:21,787 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:21,787 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:21,787 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:21,787 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:21,787 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:21,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:21,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:21,787 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:21,787 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:21,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:21,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:21,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:21,787 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:21,787 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:21,787 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:21,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:21,788 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:21,788 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:21,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:21,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:21,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:21,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:21,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:21,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:21,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:21,788 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:21,788 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:21,788 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:22,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:22,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:22,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:22,024 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:22,025 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:22,027 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-2-nl.wvr.bpl [2025-04-26 18:41:22,028 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-2-nl.wvr.bpl' [2025-04-26 18:41:22,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:22,046 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:22,047 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:22,048 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:22,048 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:22,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:22,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:22,086 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:22,087 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:22,088 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:22,088 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:22,088 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:22,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:22,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:22,096 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:22,096 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:22,098 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:22,099 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:22,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:22,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:22,102 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:22,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:22,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:22,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:22,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:22,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/1) ... [2025-04-26 18:41:22,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:22,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:22,137 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 18:41:22,139 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 18:41:22,157 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:22,157 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:22,157 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:22,157 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:22,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:22,158 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:22,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:22,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:22,159 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 18:41:22,197 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:22,199 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:22,296 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:22,296 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:22,314 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:22,315 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:22,315 INFO L201 PluginConnector]: Adding new model queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:22 BoogieIcfgContainer [2025-04-26 18:41:22,315 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:22,316 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:22,316 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:22,320 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:22,321 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:22,321 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:22" (1/2) ... [2025-04-26 18:41:22,322 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@702f73b7 and model type queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:22, skipping insertion in model container [2025-04-26 18:41:22,322 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:22,322 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:22" (2/2) ... [2025-04-26 18:41:22,323 INFO L376 chiAutomizerObserver]: Analyzing ICFG queue-add-2-nl.wvr.bpl [2025-04-26 18:41:22,370 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:41:22,404 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:22,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:22,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:22,407 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 18:41:22,409 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 18:41:22,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 31 transitions, 76 flow [2025-04-26 18:41:22,473 INFO L116 PetriNetUnfolderBase]: 2/27 cut-off events. [2025-04-26 18:41:22,474 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:41:22,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 2/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 18:41:22,477 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 31 transitions, 76 flow [2025-04-26 18:41:22,479 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 27 transitions, 66 flow [2025-04-26 18:41:22,480 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 32 places, 27 transitions, 66 flow [2025-04-26 18:41:22,480 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 27 transitions, 66 flow [2025-04-26 18:41:22,493 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 106 states, 104 states have (on average 1.9711538461538463) internal successors, (in total 205), 105 states have internal predecessors, (205), 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 18:41:22,494 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 106 states, 104 states have (on average 1.9711538461538463) internal successors, (in total 205), 105 states have internal predecessors, (205), 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 18:41:22,496 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:22,570 WARN L140 AmpleReduction]: Number of pruned transitions: 61 [2025-04-26 18:41:22,570 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:22,570 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 10 [2025-04-26 18:41:22,570 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:22 [2025-04-26 18:41:22,570 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:56 [2025-04-26 18:41:22,570 WARN L145 AmpleReduction]: Times succ was already a loop node:3 [2025-04-26 18:41:22,570 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:13 [2025-04-26 18:41:22,570 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:22,571 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 89 states, 87 states have (on average 1.2758620689655173) internal successors, (in total 111), 88 states have internal predecessors, (111), 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 18:41:22,578 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:22,578 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:22,578 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:22,578 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:22,578 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:22,578 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:22,579 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:22,579 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:22,580 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 89 states, 87 states have (on average 1.2758620689655173) internal successors, (in total 111), 88 states have internal predecessors, (111), 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 18:41:22,590 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 51 [2025-04-26 18:41:22,590 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:22,590 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:22,593 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:22,593 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:22,593 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:22,594 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 89 states, 87 states have (on average 1.2758620689655173) internal successors, (in total 111), 88 states have internal predecessors, (111), 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 18:41:22,596 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 51 [2025-04-26 18:41:22,596 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:22,596 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:22,596 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:22,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 18:41:22,600 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[]" "[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" [2025-04-26 18:41:22,600 INFO L754 eck$LassoCheckResult]: Loop: "[72] L25-1-->L26: 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[]" "[74] L26-->L26-1: Formula: (and (= 1 (select v_q_4 v_q_back_10)) (= (+ v_q_back_10 1) v_q_back_9)) InVars {q=v_q_4, q_back=v_q_back_10} OutVars{q=v_q_4, q_back=v_q_back_9} AuxVars[] AssignedVars[q_back]" "[76] L26-1-->L31: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[78] L31-->L25-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 18:41:22,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash 98092, now seen corresponding path program 1 times [2025-04-26 18:41:22,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:22,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766896465] [2025-04-26 18:41:22,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:22,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:22,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:22,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:22,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:22,653 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:22,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:22,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:22,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:22,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:22,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:22,669 INFO L85 PathProgramCache]: Analyzing trace with hash 3142021, now seen corresponding path program 1 times [2025-04-26 18:41:22,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:22,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926694788] [2025-04-26 18:41:22,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:22,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:22,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:22,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:22,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:22,677 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:22,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:22,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:22,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:22,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:22,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:22,682 INFO L85 PathProgramCache]: Analyzing trace with hash 397927216, now seen corresponding path program 1 times [2025-04-26 18:41:22,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:22,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69353534] [2025-04-26 18:41:22,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:22,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:22,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:22,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:22,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:22,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:22,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:22,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:22,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:22,697 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:22,806 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:22,807 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:22,807 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:22,807 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:22,807 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:22,807 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:22,807 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:22,807 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:22,807 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:41:22,807 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:22,807 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:22,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:22,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:22,860 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:22,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:22,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:22,975 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:22,978 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:22,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:22,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:22,982 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 18:41:22,984 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 18:41:22,985 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 18:41:22,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:22,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:22,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:22,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:23,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:23,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:23,008 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:23,014 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 18:41:23,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:23,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:23,016 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 18:41:23,016 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 18:41:23,017 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 18:41:23,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:23,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:23,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:23,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:23,031 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:23,031 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:23,036 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:23,060 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:23,060 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:23,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:23,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:23,067 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 18:41:23,068 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 18:41:23,069 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:23,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:41:23,095 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:23,095 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:23,096 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 18:41:23,101 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 18:41:23,103 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:23,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:23,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:23,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:23,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:23,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:23,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:23,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:23,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:23,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:23,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:23,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:23,171 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 18:41:23,187 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 18:41:23,188 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 89 states, 87 states have (on average 1.2758620689655173) internal successors, (in total 111), 88 states have internal predecessors, (111), 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 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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 18:41:23,260 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 89 states, 87 states have (on average 1.2758620689655173) internal successors, (in total 111), 88 states have internal predecessors, (111), 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 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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 176 states and 229 transitions. Complement of second has 7 states. [2025-04-26 18:41:23,262 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:23,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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 18:41:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2025-04-26 18:41:23,270 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 18:41:23,270 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:23,270 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:41:23,272 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:23,272 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 3 letters. Loop has 8 letters. [2025-04-26 18:41:23,273 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:23,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 229 transitions. [2025-04-26 18:41:23,281 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-04-26 18:41:23,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 70 states and 88 transitions. [2025-04-26 18:41:23,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2025-04-26 18:41:23,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-04-26 18:41:23,287 INFO L74 IsDeterministic]: Start isDeterministic. Operand 70 states and 88 transitions. [2025-04-26 18:41:23,288 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:23,288 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 88 transitions. [2025-04-26 18:41:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 88 transitions. [2025-04-26 18:41:23,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2025-04-26 18:41:23,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.2608695652173914) internal successors, (in total 87), 68 states have internal predecessors, (87), 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 18:41:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2025-04-26 18:41:23,311 INFO L240 hiAutomatonCegarLoop]: Abstraction has 69 states and 87 transitions. [2025-04-26 18:41:23,311 INFO L438 stractBuchiCegarLoop]: Abstraction has 69 states and 87 transitions. [2025-04-26 18:41:23,311 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:23,311 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 87 transitions. [2025-04-26 18:41:23,312 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-04-26 18:41:23,312 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:23,312 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:23,312 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:23,314 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:23,315 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[]" "[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[71] L25-1-->L33: 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[]" "[73] L33-->L33-1: Formula: (and (= (+ v_q_back_14 1) v_q_back_13) (= (select v_q_6 v_q_back_14) 0)) InVars {q=v_q_6, q_back=v_q_back_14} OutVars{q=v_q_6, q_back=v_q_back_13} AuxVars[] AssignedVars[q_back]" "[75] L33-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" "[77] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L44: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[80] L44-->L45-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" [2025-04-26 18:41:23,315 INFO L754 eck$LassoCheckResult]: Loop: "[82] L45-1-->L46: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[84] L46-->L46-1: Formula: (and (= v_q_front_10 (+ v_q_front_11 1)) (< v_q_front_11 v_q_back_17) (= (select v_q_10 v_q_front_11) v_j_6)) InVars {q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_11} OutVars{q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_10, j=v_j_6} AuxVars[] AssignedVars[j, q_front]" "[85] L46-1-->L52: Formula: (= (+ v_j_2 v_s_2) v_s_1) InVars {s=v_s_2, j=v_j_2} OutVars{s=v_s_1, j=v_j_2} AuxVars[] AssignedVars[s]" "[86] L52-->L53: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[87] L53-->L45-1: Formula: (let ((.cse0 (= v_j_3 0))) (or (and (not v_f_3) .cse0) (and (not .cse0) v_f_3))) InVars {j=v_j_3} OutVars{j=v_j_3, f=v_f_3} AuxVars[] AssignedVars[f]" [2025-04-26 18:41:23,316 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:23,316 INFO L85 PathProgramCache]: Analyzing trace with hash -377042229, now seen corresponding path program 1 times [2025-04-26 18:41:23,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:23,316 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651471442] [2025-04-26 18:41:23,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:23,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:23,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:23,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:23,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,326 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:23,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:23,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:23,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:23,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:23,335 INFO L85 PathProgramCache]: Analyzing trace with hash 106944755, now seen corresponding path program 1 times [2025-04-26 18:41:23,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:23,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699984388] [2025-04-26 18:41:23,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:23,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:23,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:23,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:23,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,339 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:23,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:23,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:23,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:23,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:23,343 INFO L85 PathProgramCache]: Analyzing trace with hash 742014057, now seen corresponding path program 1 times [2025-04-26 18:41:23,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:23,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023920575] [2025-04-26 18:41:23,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:23,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:23,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:23,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:23,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,354 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:23,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:23,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:23,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:23,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:23,540 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:23,540 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:23,540 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:23,540 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:23,540 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:23,540 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:23,540 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:23,540 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:23,540 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:41:23,540 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:23,540 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:23,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:23,783 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:23,783 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:23,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:23,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:23,794 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 18:41:23,795 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 18:41: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 18:41:23,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:23,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:23,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:23,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:23,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:23,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:23,811 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:23,817 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 18:41:23,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:23,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41: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 18:41:23,819 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 18:41: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 18:41:23,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:23,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:23,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:23,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:23,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:23,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:23,836 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:23,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:41:23,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:23,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:23,843 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 18:41: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 18:41:23,846 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 18:41:23,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:23,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:23,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:23,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:23,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:23,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:23,860 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:23,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:23,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:23,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:23,867 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 18:41:23,869 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 18:41:23,870 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 18:41:23,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:23,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:23,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:23,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:23,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:23,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:23,884 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:23,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:41:23,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:23,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:23,892 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 18:41:23,893 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 18:41:23,894 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 18:41:23,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:23,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:23,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:23,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:23,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:23,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:23,912 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:23,923 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 18:41:23,923 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:23,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:23,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:23,925 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 18:41:23,927 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 18:41:23,928 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:23,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:23,944 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:23,944 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:23,944 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_front, q_back) = -1*q_front + 1*q_back Supporting invariants [] [2025-04-26 18:41:23,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:23,950 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:23,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:23,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:23,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:23,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:23,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:23,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:23,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:23,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:23,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:23,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:23,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:23,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:24,037 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 18:41:24,038 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 18:41:24,038 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 87 transitions. cyclomatic complexity: 24 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 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 18:41:24,064 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 87 transitions. cyclomatic complexity: 24. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 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) Result 111 states and 135 transitions. Complement of second has 5 states. [2025-04-26 18:41:24,066 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 18:41:24,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 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 18:41:24,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2025-04-26 18:41:24,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 10 letters. Loop has 5 letters. [2025-04-26 18:41:24,066 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:24,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 15 letters. Loop has 5 letters. [2025-04-26 18:41:24,067 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:24,067 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 10 letters. Loop has 10 letters. [2025-04-26 18:41:24,067 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:24,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 135 transitions. [2025-04-26 18:41:24,070 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-04-26 18:41:24,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 66 states and 83 transitions. [2025-04-26 18:41:24,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-04-26 18:41:24,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-04-26 18:41:24,070 INFO L74 IsDeterministic]: Start isDeterministic. Operand 66 states and 83 transitions. [2025-04-26 18:41:24,070 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:24,070 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 83 transitions. [2025-04-26 18:41:24,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 83 transitions. [2025-04-26 18:41:24,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2025-04-26 18:41:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.25) internal successors, (in total 75), 59 states have internal predecessors, (75), 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 18:41:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2025-04-26 18:41:24,073 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 75 transitions. [2025-04-26 18:41:24,073 INFO L438 stractBuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2025-04-26 18:41:24,073 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:24,074 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 75 transitions. [2025-04-26 18:41:24,074 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2025-04-26 18:41:24,074 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:24,074 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:24,074 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:24,074 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:24,075 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[]" "[93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[72] L25-1-->L26: 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[]" "[74] L26-->L26-1: Formula: (and (= 1 (select v_q_4 v_q_back_10)) (= (+ v_q_back_10 1) v_q_back_9)) InVars {q=v_q_4, q_back=v_q_back_10} OutVars{q=v_q_4, q_back=v_q_back_9} AuxVars[] AssignedVars[q_back]" "[76] L26-1-->L31: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L44: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[78] L31-->L25-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[72] L25-1-->L26: 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[]" "[74] L26-->L26-1: Formula: (and (= 1 (select v_q_4 v_q_back_10)) (= (+ v_q_back_10 1) v_q_back_9)) InVars {q=v_q_4, q_back=v_q_back_10} OutVars{q=v_q_4, q_back=v_q_back_9} AuxVars[] AssignedVars[q_back]" "[80] L44-->L45-1: Formula: v_f_1 InVars {} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[76] L26-1-->L31: Formula: (= (+ v_C_1 v_x_2) v_x_1) InVars {x=v_x_2, C=v_C_1} OutVars{x=v_x_1, C=v_C_1} AuxVars[] AssignedVars[x]" "[78] L31-->L25-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[71] L25-1-->L33: 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[]" "[73] L33-->L33-1: Formula: (and (= (+ v_q_back_14 1) v_q_back_13) (= (select v_q_6 v_q_back_14) 0)) InVars {q=v_q_6, q_back=v_q_back_14} OutVars{q=v_q_6, q_back=v_q_back_13} AuxVars[] AssignedVars[q_back]" "[75] L33-1-->thread1FINAL: Formula: (= (+ v_C_2 v_x_4) v_x_3) InVars {x=v_x_4, C=v_C_2} OutVars{x=v_x_3, C=v_C_2} AuxVars[] AssignedVars[x]" [2025-04-26 18:41:24,075 INFO L754 eck$LassoCheckResult]: Loop: "[82] L45-1-->L46: Formula: v_f_2 InVars {f=v_f_2} OutVars{f=v_f_2} AuxVars[] AssignedVars[]" "[84] L46-->L46-1: Formula: (and (= v_q_front_10 (+ v_q_front_11 1)) (< v_q_front_11 v_q_back_17) (= (select v_q_10 v_q_front_11) v_j_6)) InVars {q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_11} OutVars{q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_10, j=v_j_6} AuxVars[] AssignedVars[j, q_front]" "[85] L46-1-->L52: Formula: (= (+ v_j_2 v_s_2) v_s_1) InVars {s=v_s_2, j=v_j_2} OutVars{s=v_s_1, j=v_j_2} AuxVars[] AssignedVars[s]" "[86] L52-->L53: Formula: (= v_y_1 (+ v_C_3 v_y_2)) InVars {y=v_y_2, C=v_C_3} OutVars{y=v_y_1, C=v_C_3} AuxVars[] AssignedVars[y]" "[87] L53-->L45-1: Formula: (let ((.cse0 (= v_j_3 0))) (or (and (not v_f_3) .cse0) (and (not .cse0) v_f_3))) InVars {j=v_j_3} OutVars{j=v_j_3, f=v_f_3} AuxVars[] AssignedVars[f]" [2025-04-26 18:41:24,075 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1833875252, now seen corresponding path program 1 times [2025-04-26 18:41:24,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:24,075 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806811610] [2025-04-26 18:41:24,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:24,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:24,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:41:24,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:41:24,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,086 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:24,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:41:24,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:41:24,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:24,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,100 INFO L85 PathProgramCache]: Analyzing trace with hash 106944755, now seen corresponding path program 2 times [2025-04-26 18:41:24,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:24,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405908232] [2025-04-26 18:41:24,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:24,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:24,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:24,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:24,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:24,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,113 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:24,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:24,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:24,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:24,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1471326624, now seen corresponding path program 1 times [2025-04-26 18:41:24,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:24,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867656875] [2025-04-26 18:41:24,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:24,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:24,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 18:41:24,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 18:41:24,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,134 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:24,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 18:41:24,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 18:41:24,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:24,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:24,377 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:24,377 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:24,377 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:24,377 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:24,377 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:24,378 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,378 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:24,378 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:24,378 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:41:24,378 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:24,378 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:24,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:24,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:24,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:24,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:24,394 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:24,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:24,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:24,636 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:24,636 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:24,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,640 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 18:41:24,641 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 18:41:24,643 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 18:41:24,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:24,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:24,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:24,657 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:24,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:24,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,666 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 18:41:24,669 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 18:41:24,669 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 18:41:24,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:24,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:24,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:24,683 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:24,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:24,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,691 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 18:41:24,692 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 18:41:24,694 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 18:41:24,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:24,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:24,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:24,710 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:24,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:24,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,718 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 18:41:24,719 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 18:41:24,721 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 18:41:24,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:24,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:24,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:24,735 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:24,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:24,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,742 INFO L229 MonitoredProcess]: Starting monitored process 16 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 18:41:24,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:41:24,745 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 18:41:24,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:24,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:24,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:24,759 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:24,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:24,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,767 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 18:41:24,768 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 18:41:24,769 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 18:41:24,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,780 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 18:41:24,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,803 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 18:41:24,803 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 18:41:24,830 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:24,837 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 18:41:24,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,839 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 18:41:24,840 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 18:41:24,842 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 18:41:24,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:24,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:24,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:24,856 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:24,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:24,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,864 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 18:41:24,865 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 18:41:24,867 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 18:41:24,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:24,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:24,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:24,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:24,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:24,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:24,883 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:24,890 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:41:24,890 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:24,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:24,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:24,892 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 18:41:24,894 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 18:41:24,895 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:24,910 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 18:41:24,911 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:24,911 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:24,911 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_front, q_back) = -1*q_front + 1*q_back Supporting invariants [] [2025-04-26 18:41:24,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:24,919 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:24,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:24,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:41:24,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:41:24,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:24,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:24,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:24,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:24,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:24,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:24,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:24,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:24,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:24,991 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 18:41:24,991 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 18:41:24,991 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (in total 18), 4 states have internal predecessors, (18), 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 18:41:25,006 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (in total 18), 4 states have internal predecessors, (18), 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 81 states and 105 transitions. Complement of second has 4 states. [2025-04-26 18:41:25,006 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 18:41:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (in total 18), 4 states have internal predecessors, (18), 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 18:41:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2025-04-26 18:41:25,007 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 17 letters. Loop has 5 letters. [2025-04-26 18:41:25,007 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:25,007 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 22 letters. Loop has 5 letters. [2025-04-26 18:41:25,007 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:25,007 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 17 letters. Loop has 10 letters. [2025-04-26 18:41:25,007 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:25,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 105 transitions. [2025-04-26 18:41:25,008 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:25,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 0 states and 0 transitions. [2025-04-26 18:41:25,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:25,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:25,008 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:25,008 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:25,008 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:25,008 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:25,008 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:25,008 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:25,008 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:25,009 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:25,009 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:25,019 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 18:41:25,020 INFO L201 PluginConnector]: Adding new model queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:25 BoogieIcfgContainer [2025-04-26 18:41:25,020 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:25,021 INFO L158 Benchmark]: Toolchain (without parser) took 2974.28ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.8MB in the beginning and 31.8MB in the end (delta: 55.1MB). Peak memory consumption was 52.6MB. Max. memory is 8.0GB. [2025-04-26 18:41:25,021 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.83ms. Allocated memory is still 159.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:25,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.69ms. Allocated memory is still 159.4MB. Free memory was 86.8MB in the beginning and 84.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:25,021 INFO L158 Benchmark]: Boogie Preprocessor took 23.75ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 84.0MB in the end (delta: 967.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:25,021 INFO L158 Benchmark]: RCFGBuilder took 203.24ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 73.9MB in the end (delta: 9.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:41:25,022 INFO L158 Benchmark]: BuchiAutomizer took 2704.57ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.8MB in the beginning and 31.8MB in the end (delta: 42.0MB). Peak memory consumption was 40.0MB. Max. memory is 8.0GB. [2025-04-26 18:41:25,023 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.83ms. Allocated memory is still 159.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.69ms. Allocated memory is still 159.4MB. Free memory was 86.8MB in the beginning and 84.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.75ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 84.0MB in the end (delta: 967.4kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 203.24ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 73.9MB in the end (delta: 9.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2704.57ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.8MB in the beginning and 31.8MB in the end (delta: 42.0MB). Peak memory consumption was 40.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 1.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 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, 79 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 100 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 57 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital75 mio100 ax100 hnf100 lsp56 ukn94 mio100 lsp74 div100 bol114 ite100 ukn100 eq168 hnf92 smp100 dnf226 smp70 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 65ms VariablesStem: 4 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 169, Number of transitions in reduction automaton: 111, Number of states in reduction automaton: 89, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 3 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:25,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...