/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/buffer-mult-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:55:17,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:55:17,864 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:55:17,868 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:55:17,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:55:17,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:55:17,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:55:17,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:55:17,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:55:17,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:55:17,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:55:17,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:55:17,885 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:55:17,885 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:55:17,885 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:55:17,885 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:55:17,885 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:55:17,885 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:55:17,885 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:55:17,885 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:55:17,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:55:17,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:55:17,885 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:55:17,886 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:55:17,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:55:17,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:55:17,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:55:17,886 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:55:17,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:55:17,886 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:55:17,886 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:55:17,886 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:55:17,886 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:55:17,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:55:17,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:55:17,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:17,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:55:17,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:55:17,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:55:17,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:55:17,888 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:55:17,889 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:55:17,889 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:55:18,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:55:18,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:55:18,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:55:18,116 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:55:18,116 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:55:18,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/buffer-mult-alt.wvr.bpl [2025-04-26 16:55:18,119 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/buffer-mult-alt.wvr.bpl' [2025-04-26 16:55:18,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:55:18,142 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:55:18,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:18,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:55:18,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:55:18,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:18" (1/1) ... [2025-04-26 16:55:18,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:18" (1/1) ... [2025-04-26 16:55:18,179 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:55:18,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:18,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:55:18,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:55:18,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:55:18,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:18" (1/1) ... [2025-04-26 16:55:18,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:18" (1/1) ... [2025-04-26 16:55:18,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:18" (1/1) ... [2025-04-26 16:55:18,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:18" (1/1) ... [2025-04-26 16:55:18,191 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:18" (1/1) ... [2025-04-26 16:55:18,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:18" (1/1) ... [2025-04-26 16:55:18,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:18" (1/1) ... [2025-04-26 16:55:18,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:18" (1/1) ... [2025-04-26 16:55:18,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:18" (1/1) ... [2025-04-26 16:55:18,208 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:55:18,211 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:55:18,211 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:55:18,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:55:18,212 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:18" (1/1) ... [2025-04-26 16:55:18,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:18,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:18,236 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:18,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:55:18,260 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:55:18,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:55:18,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:55:18,261 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:55:18,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:55:18,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:55:18,261 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:55:18,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:55:18,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:55:18,261 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:55:18,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:55:18,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:55:18,261 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:55:18,261 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:55:18,261 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:55:18,262 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:55:18,304 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:55:18,305 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:55:18,408 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:55:18,408 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:55:18,430 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:55:18,431 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:55:18,431 INFO L201 PluginConnector]: Adding new model buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:18 BoogieIcfgContainer [2025-04-26 16:55:18,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:55:18,432 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:55:18,432 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:55:18,437 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:55:18,438 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:18,438 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:18" (1/2) ... [2025-04-26 16:55:18,439 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@440ba39f and model type buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:55:18, skipping insertion in model container [2025-04-26 16:55:18,439 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:18,439 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:18" (2/2) ... [2025-04-26 16:55:18,441 INFO L376 chiAutomizerObserver]: Analyzing ICFG buffer-mult-alt.wvr.bpl [2025-04-26 16:55:18,501 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:55:18,547 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:55:18,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:55:18,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:18,550 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:18,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:55:18,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 106 flow [2025-04-26 16:55:18,636 INFO L116 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-04-26 16:55:18,640 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:55:18,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-26 16:55:18,644 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 106 flow [2025-04-26 16:55:18,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2025-04-26 16:55:18,647 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 40 places, 31 transitions, 86 flow [2025-04-26 16:55:18,653 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:55:18,876 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 511#[L76, L50-1, L26, thread2EXIT]true [2025-04-26 16:55:18,944 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1221#[L38, L77, L62, L26, L50]true [2025-04-26 16:55:18,945 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1133#[L38, L77, L62-1, L26, L50]true [2025-04-26 16:55:18,945 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1145#[L38-1, L77, L62-1, L26, L50]true [2025-04-26 16:55:18,945 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 689#[L38-1, L76, L50-1, L26-1]true [2025-04-26 16:55:18,946 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 683#[L38, L76, L50-1, L26]true [2025-04-26 16:55:18,947 WARN L140 AmpleReduction]: Number of pruned transitions: 933 [2025-04-26 16:55:18,948 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 6 [2025-04-26 16:55:18,948 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 168 [2025-04-26 16:55:18,948 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:47 [2025-04-26 16:55:18,948 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:379 [2025-04-26 16:55:18,948 WARN L145 AmpleReduction]: Times succ was already a loop node:231 [2025-04-26 16:55:18,948 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:201 [2025-04-26 16:55:18,948 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:55:18,954 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 589 states, 587 states have (on average 2.1822827938671208) internal successors, (in total 1281), 588 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:18,961 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:55:18,961 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:55:18,961 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:55:18,962 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:55:18,962 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:55:18,962 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:55:18,962 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:55:18,962 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:55:18,966 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 589 states, 587 states have (on average 2.1822827938671208) internal successors, (in total 1281), 588 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:18,999 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 486 [2025-04-26 16:55:18,999 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:18,999 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:19,006 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:55:19,006 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:19,006 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:55:19,007 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 589 states, 587 states have (on average 2.1822827938671208) internal successors, (in total 1281), 588 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:19,017 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 486 [2025-04-26 16:55:19,017 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:19,017 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:19,018 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:55:19,018 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:19,023 INFO L752 eck$LassoCheckResult]: Stem: "[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:55:19,023 INFO L754 eck$LassoCheckResult]: Loop: "[87] L25-->L26: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[89] L26-->L26-1: Formula: (and (= (select v_q1_3 v_q1_back_9) v_C_4) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, q1_back=v_q1_back_9, C=v_C_4} OutVars{q1=v_q1_3, q1_back=v_q1_back_8, C=v_C_4} AuxVars[] AssignedVars[q1_back]" "[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i]" [2025-04-26 16:55:19,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:19,028 INFO L85 PathProgramCache]: Analyzing trace with hash 3454, now seen corresponding path program 1 times [2025-04-26 16:55:19,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:19,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710400521] [2025-04-26 16:55:19,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:19,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:19,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:19,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:19,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:19,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:19,082 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:19,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:19,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:19,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:19,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:19,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:19,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:19,115 INFO L85 PathProgramCache]: Analyzing trace with hash 116247, now seen corresponding path program 1 times [2025-04-26 16:55:19,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:19,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861362770] [2025-04-26 16:55:19,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:19,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:19,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:19,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:19,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:19,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:19,125 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:19,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:19,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:19,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:19,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:19,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:19,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:19,136 INFO L85 PathProgramCache]: Analyzing trace with hash 102984570, now seen corresponding path program 1 times [2025-04-26 16:55:19,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:19,136 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118953448] [2025-04-26 16:55:19,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:19,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:19,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:19,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:19,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:19,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:19,147 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:19,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:19,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:19,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:19,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:19,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:19,308 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:19,308 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:19,308 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:19,308 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:19,308 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:19,309 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:19,309 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:19,309 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:19,309 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:55:19,309 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:19,309 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:19,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:19,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:19,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:19,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:19,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:19,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:19,514 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:19,516 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:19,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:19,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:19,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:19,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:55:19,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:19,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:19,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:19,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:19,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:19,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:19,540 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:19,547 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:19,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:55:19,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:19,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:19,556 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:19,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:55:19,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:19,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:19,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:19,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:19,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:19,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:19,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:19,582 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:19,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:19,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:19,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:19,591 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:19,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:55:19,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:19,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:19,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:19,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:19,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:19,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:19,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:19,609 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:19,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:19,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:19,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:19,618 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:19,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:55:19,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:19,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:19,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:19,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:19,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:19,634 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:19,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:19,642 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:19,656 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:55:19,656 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:55:19,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:19,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:19,676 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:19,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:55:19,679 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:19,697 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 16:55:19,697 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:19,698 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:19,698 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 16:55:19,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:19,706 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:19,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:19,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:19,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:19,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:19,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:19,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:19,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:19,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:19,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:19,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:19,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:19,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:19,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:19,786 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:55:19,789 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 589 states, 587 states have (on average 2.1822827938671208) internal successors, (in total 1281), 588 states have internal predecessors, (1281), 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 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:19,911 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 589 states, 587 states have (on average 2.1822827938671208) internal successors, (in total 1281), 588 states have internal predecessors, (1281), 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 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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 1614 states and 3502 transitions. Complement of second has 7 states. [2025-04-26 16:55:19,912 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 16:55:19,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:19,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2025-04-26 16:55:19,920 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 86 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:55:19,921 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:19,921 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 86 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:55:19,921 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:19,921 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 86 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:55:19,921 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:19,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1614 states and 3502 transitions. [2025-04-26 16:55:19,935 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 304 [2025-04-26 16:55:19,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1614 states to 799 states and 1759 transitions. [2025-04-26 16:55:19,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 376 [2025-04-26 16:55:19,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 506 [2025-04-26 16:55:19,953 INFO L74 IsDeterministic]: Start isDeterministic. Operand 799 states and 1759 transitions. [2025-04-26 16:55:19,953 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:19,953 INFO L218 hiAutomatonCegarLoop]: Abstraction has 799 states and 1759 transitions. [2025-04-26 16:55:19,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states and 1759 transitions. [2025-04-26 16:55:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 702. [2025-04-26 16:55:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 702 states have (on average 2.1880341880341883) internal successors, (in total 1536), 701 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1536 transitions. [2025-04-26 16:55:20,000 INFO L240 hiAutomatonCegarLoop]: Abstraction has 702 states and 1536 transitions. [2025-04-26 16:55:20,000 INFO L438 stractBuchiCegarLoop]: Abstraction has 702 states and 1536 transitions. [2025-04-26 16:55:20,000 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:55:20,000 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 702 states and 1536 transitions. [2025-04-26 16:55:20,003 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 304 [2025-04-26 16:55:20,003 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:20,003 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:20,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:55:20,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:20,003 INFO L752 eck$LassoCheckResult]: Stem: "[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L25-->L26: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[109] L74-1-->L37: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:55:20,004 INFO L754 eck$LassoCheckResult]: Loop: "[92] L37-->L38: Formula: (< v_j_2 v_M_2) InVars {M=v_M_2, j=v_j_2} OutVars{M=v_M_2, j=v_j_2} AuxVars[] AssignedVars[]" "[94] L38-->L38-1: Formula: (and (= (+ v_C_6 (select v_q2_3 v_q2_back_9)) 0) (= (+ v_q2_back_9 1) v_q2_back_8)) InVars {q2=v_q2_3, C=v_C_6, q2_back=v_q2_back_9} OutVars{q2=v_q2_3, C=v_C_6, q2_back=v_q2_back_8} AuxVars[] AssignedVars[q2_back]" "[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j]" [2025-04-26 16:55:20,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:20,004 INFO L85 PathProgramCache]: Analyzing trace with hash 3322100, now seen corresponding path program 1 times [2025-04-26 16:55:20,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:20,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625304445] [2025-04-26 16:55:20,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:20,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:20,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:20,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:20,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:20,009 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:20,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:20,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:20,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:20,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:20,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:20,013 INFO L85 PathProgramCache]: Analyzing trace with hash 121212, now seen corresponding path program 1 times [2025-04-26 16:55:20,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:20,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821615154] [2025-04-26 16:55:20,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:20,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:20,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:20,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:20,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:20,016 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:20,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:20,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:20,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:20,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:20,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:20,020 INFO L85 PathProgramCache]: Analyzing trace with hash 184524713, now seen corresponding path program 1 times [2025-04-26 16:55:20,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:20,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797159300] [2025-04-26 16:55:20,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:20,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:20,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:20,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:20,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:20,031 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:20,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:20,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:20,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:20,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:20,158 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:20,158 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:20,158 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:20,158 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:20,158 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:20,158 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:20,158 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:20,158 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:20,158 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:55:20,158 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:20,158 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:20,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:20,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:20,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:20,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:20,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:20,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:20,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:20,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:20,282 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:20,283 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:20,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:20,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:20,286 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:20,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:55:20,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:20,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:20,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:20,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:20,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:20,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:20,306 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:20,309 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:20,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:55:20,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:20,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:20,317 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:20,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:55:20,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:20,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:20,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:20,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:20,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:20,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:20,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:20,335 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:20,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:20,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:20,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:20,344 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:20,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:55:20,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:20,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:20,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:20,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:20,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:20,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:20,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:20,365 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:20,370 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 16:55:20,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:20,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:20,373 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:20,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:55:20,375 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:20,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:20,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:20,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:20,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:20,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:20,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:20,391 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:20,398 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 16:55:20,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:20,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:20,401 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:20,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:55:20,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:20,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:20,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:20,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:20,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:20,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:20,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:20,418 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:20,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:55:20,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:20,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:20,428 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:20,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:55:20,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:20,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:20,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:20,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:20,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:20,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:20,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:20,448 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:20,456 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:55:20,456 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:55:20,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:20,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:20,459 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:20,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:55:20,461 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:20,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:55:20,478 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:20,478 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:20,478 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 16:55:20,484 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 16:55:20,485 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:20,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:20,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:20,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:20,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:20,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:20,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:20,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:20,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:20,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:20,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:20,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:20,541 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:55:20,541 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 702 states and 1536 transitions. cyclomatic complexity: 946 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 16:55:20,597 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 702 states and 1536 transitions. cyclomatic complexity: 946. 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 1587 states and 3410 transitions. Complement of second has 7 states. [2025-04-26 16:55:20,597 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 16:55:20,598 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 16:55:20,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-26 16:55:20,598 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 74 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:55:20,598 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:20,598 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 74 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:55:20,598 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:20,598 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 74 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:55:20,598 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:20,599 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1587 states and 3410 transitions. [2025-04-26 16:55:20,608 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 179 [2025-04-26 16:55:20,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1587 states to 852 states and 1918 transitions. [2025-04-26 16:55:20,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2025-04-26 16:55:20,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 387 [2025-04-26 16:55:20,614 INFO L74 IsDeterministic]: Start isDeterministic. Operand 852 states and 1918 transitions. [2025-04-26 16:55:20,614 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:20,614 INFO L218 hiAutomatonCegarLoop]: Abstraction has 852 states and 1918 transitions. [2025-04-26 16:55:20,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states and 1918 transitions. [2025-04-26 16:55:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 814. [2025-04-26 16:55:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 814 states have (on average 2.264127764127764) internal successors, (in total 1843), 813 states have internal predecessors, (1843), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:20,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1843 transitions. [2025-04-26 16:55:20,635 INFO L240 hiAutomatonCegarLoop]: Abstraction has 814 states and 1843 transitions. [2025-04-26 16:55:20,635 INFO L438 stractBuchiCegarLoop]: Abstraction has 814 states and 1843 transitions. [2025-04-26 16:55:20,635 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:55:20,635 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 814 states and 1843 transitions. [2025-04-26 16:55:20,639 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 179 [2025-04-26 16:55:20,640 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:20,640 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:20,640 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:55:20,640 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:20,640 INFO L752 eck$LassoCheckResult]: Stem: "[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L25-->L26: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[109] L74-1-->L37: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[92] L37-->L38: Formula: (< v_j_2 v_M_2) InVars {M=v_M_2, j=v_j_2} OutVars{M=v_M_2, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:55:20,640 INFO L754 eck$LassoCheckResult]: Loop: "[97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[]" "[99] L50-->L50-1: Formula: (and (= (+ (select v_q1_7 v_q1_front_13) v_total_12) v_total_11) (= (+ v_q1_front_13 1) v_q1_front_12) (< v_q1_front_13 v_q1_back_12)) InVars {q1_front=v_q1_front_13, q1=v_q1_7, total=v_total_12, q1_back=v_q1_back_12} OutVars{q1_front=v_q1_front_12, q1=v_q1_7, total=v_total_11, q1_back=v_q1_back_12} AuxVars[] AssignedVars[q1_front, total]" [2025-04-26 16:55:20,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:20,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1102426232, now seen corresponding path program 1 times [2025-04-26 16:55:20,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:20,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840366233] [2025-04-26 16:55:20,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:20,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:20,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:20,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:20,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:20,650 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:20,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:20,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:20,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:20,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:20,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 16:55:20,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:20,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296000084] [2025-04-26 16:55:20,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:20,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:20,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:20,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:20,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:20,668 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:20,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:20,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:20,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:20,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:20,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:20,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1425316266, now seen corresponding path program 1 times [2025-04-26 16:55:20,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:20,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216957188] [2025-04-26 16:55:20,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:20,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:20,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:20,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:20,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:20,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:20,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216957188] [2025-04-26 16:55:20,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216957188] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:20,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:20,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:55:20,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550837692] [2025-04-26 16:55:20,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:20,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:20,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:55:20,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:55:20,757 INFO L87 Difference]: Start difference. First operand 814 states and 1843 transitions. cyclomatic complexity: 1152 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (in total 8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:20,794 INFO L93 Difference]: Finished difference Result 982 states and 2171 transitions. [2025-04-26 16:55:20,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 982 states and 2171 transitions. [2025-04-26 16:55:20,799 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 203 [2025-04-26 16:55:20,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 982 states to 966 states and 2151 transitions. [2025-04-26 16:55:20,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 416 [2025-04-26 16:55:20,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 416 [2025-04-26 16:55:20,805 INFO L74 IsDeterministic]: Start isDeterministic. Operand 966 states and 2151 transitions. [2025-04-26 16:55:20,805 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:20,805 INFO L218 hiAutomatonCegarLoop]: Abstraction has 966 states and 2151 transitions. [2025-04-26 16:55:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states and 2151 transitions. [2025-04-26 16:55:20,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 926. [2025-04-26 16:55:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 926 states have (on average 2.2591792656587475) internal successors, (in total 2092), 925 states have internal predecessors, (2092), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 2092 transitions. [2025-04-26 16:55:20,849 INFO L240 hiAutomatonCegarLoop]: Abstraction has 926 states and 2092 transitions. [2025-04-26 16:55:20,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:55:20,850 INFO L438 stractBuchiCegarLoop]: Abstraction has 926 states and 2092 transitions. [2025-04-26 16:55:20,850 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:55:20,850 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 926 states and 2092 transitions. [2025-04-26 16:55:20,853 INFO L131 ngComponentsAnalysis]: Automaton has 74 accepting balls. 189 [2025-04-26 16:55:20,854 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:20,854 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:20,854 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:20,854 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:20,854 INFO L752 eck$LassoCheckResult]: Stem: "[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L25-->L26: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[89] L26-->L26-1: Formula: (and (= (select v_q1_3 v_q1_back_9) v_C_4) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, q1_back=v_q1_back_9, C=v_C_4} OutVars{q1=v_q1_3, q1_back=v_q1_back_8, C=v_C_4} AuxVars[] AssignedVars[q1_back]" "[109] L74-1-->L37: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[92] L37-->L38: Formula: (< v_j_2 v_M_2) InVars {M=v_M_2, j=v_j_2} OutVars{M=v_M_2, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:55:20,854 INFO L754 eck$LassoCheckResult]: Loop: "[97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[]" "[99] L50-->L50-1: Formula: (and (= (+ (select v_q1_7 v_q1_front_13) v_total_12) v_total_11) (= (+ v_q1_front_13 1) v_q1_front_12) (< v_q1_front_13 v_q1_back_12)) InVars {q1_front=v_q1_front_13, q1=v_q1_7, total=v_total_12, q1_back=v_q1_back_12} OutVars{q1_front=v_q1_front_12, q1=v_q1_7, total=v_total_11, q1_back=v_q1_back_12} AuxVars[] AssignedVars[q1_front, total]" [2025-04-26 16:55:20,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:20,855 INFO L85 PathProgramCache]: Analyzing trace with hash 183945185, now seen corresponding path program 1 times [2025-04-26 16:55:20,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:20,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977741061] [2025-04-26 16:55:20,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:20,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:20,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:20,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:20,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:20,859 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:20,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:20,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:20,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:20,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:20,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:20,864 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 2 times [2025-04-26 16:55:20,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:20,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404728096] [2025-04-26 16:55:20,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:20,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:20,866 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:20,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:20,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:20,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:20,867 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:20,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:20,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:20,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:20,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:20,869 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:20,869 INFO L85 PathProgramCache]: Analyzing trace with hash 677666755, now seen corresponding path program 1 times [2025-04-26 16:55:20,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:20,869 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324504015] [2025-04-26 16:55:20,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:20,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:20,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:20,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:20,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:20,880 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:20,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:20,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:20,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:20,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:20,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:21,027 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:21,027 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:21,027 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:21,027 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:21,027 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:21,027 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:21,027 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:21,028 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:21,028 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:55:21,028 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:21,028 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:21,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,165 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:21,165 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:21,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:21,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:21,169 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:21,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:55:21,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:21,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:21,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:21,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:21,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:21,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:21,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:21,190 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:21,196 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 16:55:21,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:21,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:21,198 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 16:55:21,199 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 16:55:21,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:21,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:21,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:21,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:21,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:21,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:21,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:21,214 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:21,220 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 16:55:21,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:21,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:21,222 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:21,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:55:21,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:21,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:21,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:21,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:21,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:21,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:21,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:21,239 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:21,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:55:21,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:21,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:21,246 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:21,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:55:21,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:21,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:21,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:21,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:21,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:21,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:21,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:21,261 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:21,267 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 16:55:21,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:21,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:21,269 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:21,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:55:21,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:21,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:21,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:21,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:21,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:21,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:21,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:21,284 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:21,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:55:21,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:21,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:21,293 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:21,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:55:21,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:21,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:21,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:21,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:21,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:21,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:21,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:21,313 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:21,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:21,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:21,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:21,321 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:21,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:55:21,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:21,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:21,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:21,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:21,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:21,337 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:21,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:21,341 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:21,348 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:55:21,348 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:55:21,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:21,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:21,350 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:21,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:55:21,353 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:21,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:21,369 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:21,369 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:21,369 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 16:55:21,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:55:21,376 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:21,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:21,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:21,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:21,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:21,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:21,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:21,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:21,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:21,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:21,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:21,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:21,412 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:21,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:21,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:21,414 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:21,415 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 926 states and 2092 transitions. cyclomatic complexity: 1306 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:21,458 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 926 states and 2092 transitions. cyclomatic complexity: 1306. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2484 states and 5805 transitions. Complement of second has 5 states. [2025-04-26 16:55:21,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:21,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:21,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-04-26 16:55:21,460 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:55:21,460 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:21,460 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:55:21,460 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:21,460 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:55:21,460 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:21,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2484 states and 5805 transitions. [2025-04-26 16:55:21,491 INFO L131 ngComponentsAnalysis]: Automaton has 104 accepting balls. 249 [2025-04-26 16:55:21,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2484 states to 2047 states and 4795 transitions. [2025-04-26 16:55:21,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 659 [2025-04-26 16:55:21,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 759 [2025-04-26 16:55:21,503 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2047 states and 4795 transitions. [2025-04-26 16:55:21,503 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:21,503 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2047 states and 4795 transitions. [2025-04-26 16:55:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states and 4795 transitions. [2025-04-26 16:55:21,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1713. [2025-04-26 16:55:21,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1713 states, 1713 states have (on average 2.4424985405720956) internal successors, (in total 4184), 1712 states have internal predecessors, (4184), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:21,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 4184 transitions. [2025-04-26 16:55:21,535 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1713 states and 4184 transitions. [2025-04-26 16:55:21,535 INFO L438 stractBuchiCegarLoop]: Abstraction has 1713 states and 4184 transitions. [2025-04-26 16:55:21,535 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:55:21,535 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1713 states and 4184 transitions. [2025-04-26 16:55:21,541 INFO L131 ngComponentsAnalysis]: Automaton has 82 accepting balls. 205 [2025-04-26 16:55:21,541 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:21,541 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:21,542 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:21,542 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:21,542 INFO L752 eck$LassoCheckResult]: Stem: "[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L25-->L26: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[109] L74-1-->L37: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[92] L37-->L38: Formula: (< v_j_2 v_M_2) InVars {M=v_M_2, j=v_j_2} OutVars{M=v_M_2, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[89] L26-->L26-1: Formula: (and (= (select v_q1_3 v_q1_back_9) v_C_4) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, q1_back=v_q1_back_9, C=v_C_4} OutVars{q1=v_q1_3, q1_back=v_q1_back_8, C=v_C_4} AuxVars[] AssignedVars[q1_back]" [2025-04-26 16:55:21,542 INFO L754 eck$LassoCheckResult]: Loop: "[97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[]" "[99] L50-->L50-1: Formula: (and (= (+ (select v_q1_7 v_q1_front_13) v_total_12) v_total_11) (= (+ v_q1_front_13 1) v_q1_front_12) (< v_q1_front_13 v_q1_back_12)) InVars {q1_front=v_q1_front_13, q1=v_q1_7, total=v_total_12, q1_back=v_q1_back_12} OutVars{q1_front=v_q1_front_12, q1=v_q1_7, total=v_total_11, q1_back=v_q1_back_12} AuxVars[] AssignedVars[q1_front, total]" [2025-04-26 16:55:21,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:21,543 INFO L85 PathProgramCache]: Analyzing trace with hash 184525265, now seen corresponding path program 2 times [2025-04-26 16:55:21,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:21,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393081340] [2025-04-26 16:55:21,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:21,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:21,548 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:21,552 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:21,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:21,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:21,552 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:21,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:21,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:21,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:21,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:21,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:21,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:21,561 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 3 times [2025-04-26 16:55:21,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:21,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354005601] [2025-04-26 16:55:21,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:21,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:21,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:21,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:21,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:55:21,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:21,567 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:21,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:21,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:21,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:21,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:21,573 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:21,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:21,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1235123635, now seen corresponding path program 2 times [2025-04-26 16:55:21,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:21,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150187604] [2025-04-26 16:55:21,574 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:21,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:21,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:21,583 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:21,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:21,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:21,584 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:21,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:21,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:21,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:21,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:21,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:21,727 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:21,727 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:21,727 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:21,727 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:21,727 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:21,727 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:21,727 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:21,727 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:21,727 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:55:21,727 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:21,727 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:21,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:21,873 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:21,874 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:21,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:21,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:21,875 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:21,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:55:21,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:21,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:21,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:21,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:21,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:21,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:21,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:21,894 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:21,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:21,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:21,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:21,902 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:21,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:55:21,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:21,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:21,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:21,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:21,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:21,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:21,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:21,920 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:21,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:21,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:21,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:21,928 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:21,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:55:21,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:21,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:21,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:21,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:21,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:21,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:21,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:21,945 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:21,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:55:21,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:21,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:21,953 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:21,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:55:21,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:21,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:21,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:21,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:21,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:21,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:21,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:21,970 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:21,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:21,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:21,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:21,978 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:21,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:55:21,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:21,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:21,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:21,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:21,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:21,993 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:21,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:21,996 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:22,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:22,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:22,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:22,004 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:22,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:55:22,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:22,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:22,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:22,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:22,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:22,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:22,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:22,020 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:22,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:22,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:22,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:22,029 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:22,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:55:22,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:22,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:22,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:22,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:22,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:22,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:22,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:22,049 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:22,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:22,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:22,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:22,057 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:22,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:55:22,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:22,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:22,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:22,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:22,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:22,071 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:22,071 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:22,074 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:22,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:22,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:22,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:22,082 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:22,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:55:22,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:22,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:22,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:22,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:22,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:22,097 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:22,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:22,102 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:22,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:22,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:22,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:22,111 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:22,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:55:22,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:22,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:22,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:22,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:22,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:22,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:22,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:22,130 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:22,137 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:55:22,137 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:55:22,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:22,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:22,139 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:22,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:55:22,142 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:22,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:22,160 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:22,160 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:22,160 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 16:55:22,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:55:22,167 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:22,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:22,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:22,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:22,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:22,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:22,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:22,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:22,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:22,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:22,208 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:22,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:22,211 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:22,211 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1713 states and 4184 transitions. cyclomatic complexity: 2705 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:22,284 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1713 states and 4184 transitions. cyclomatic complexity: 2705. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 5316 states and 13085 transitions. Complement of second has 5 states. [2025-04-26 16:55:22,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:22,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-26 16:55:22,286 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:55:22,286 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:22,286 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:55:22,286 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:22,287 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:55:22,287 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:22,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5316 states and 13085 transitions. [2025-04-26 16:55:22,322 INFO L131 ngComponentsAnalysis]: Automaton has 137 accepting balls. 315 [2025-04-26 16:55:22,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5316 states to 4067 states and 9917 transitions. [2025-04-26 16:55:22,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1119 [2025-04-26 16:55:22,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1265 [2025-04-26 16:55:22,354 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4067 states and 9917 transitions. [2025-04-26 16:55:22,354 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:22,354 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4067 states and 9917 transitions. [2025-04-26 16:55:22,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states and 9917 transitions. [2025-04-26 16:55:22,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 1975. [2025-04-26 16:55:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1975 states, 1975 states have (on average 2.4440506329113925) internal successors, (in total 4827), 1974 states have internal predecessors, (4827), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 4827 transitions. [2025-04-26 16:55:22,406 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1975 states and 4827 transitions. [2025-04-26 16:55:22,406 INFO L438 stractBuchiCegarLoop]: Abstraction has 1975 states and 4827 transitions. [2025-04-26 16:55:22,406 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:55:22,406 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1975 states and 4827 transitions. [2025-04-26 16:55:22,413 INFO L131 ngComponentsAnalysis]: Automaton has 87 accepting balls. 215 [2025-04-26 16:55:22,413 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:22,413 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:22,414 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:22,414 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:22,414 INFO L752 eck$LassoCheckResult]: Stem: "[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L25-->L26: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[109] L74-1-->L37: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[91] L37-->thread2FINAL: Formula: (<= v_M_1 v_j_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[93] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 16:55:22,414 INFO L754 eck$LassoCheckResult]: Loop: "[101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[]" "[103] L62-->L62-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front]" [2025-04-26 16:55:22,415 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:22,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1425268697, now seen corresponding path program 1 times [2025-04-26 16:55:22,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:22,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219353984] [2025-04-26 16:55:22,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:22,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:22,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:22,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:22,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:22,424 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:22,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:22,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:22,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:22,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:22,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:22,428 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 16:55:22,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:22,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205813688] [2025-04-26 16:55:22,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:22,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:22,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:22,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:22,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:22,431 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:22,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:22,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:22,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:22,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:22,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:22,433 INFO L85 PathProgramCache]: Analyzing trace with hash -411346373, now seen corresponding path program 1 times [2025-04-26 16:55:22,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:22,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187731806] [2025-04-26 16:55:22,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:22,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:22,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:22,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:22,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:22,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:22,471 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187731806] [2025-04-26 16:55:22,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187731806] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:22,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:22,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:55:22,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615056120] [2025-04-26 16:55:22,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:22,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:22,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:55:22,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:55:22,494 INFO L87 Difference]: Start difference. First operand 1975 states and 4827 transitions. cyclomatic complexity: 3112 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:22,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:22,546 INFO L93 Difference]: Finished difference Result 2784 states and 6751 transitions. [2025-04-26 16:55:22,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2784 states and 6751 transitions. [2025-04-26 16:55:22,559 INFO L131 ngComponentsAnalysis]: Automaton has 119 accepting balls. 279 [2025-04-26 16:55:22,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2784 states to 2704 states and 6612 transitions. [2025-04-26 16:55:22,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 875 [2025-04-26 16:55:22,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 875 [2025-04-26 16:55:22,575 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2704 states and 6612 transitions. [2025-04-26 16:55:22,576 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:22,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2704 states and 6612 transitions. [2025-04-26 16:55:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states and 6612 transitions. [2025-04-26 16:55:22,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2643. [2025-04-26 16:55:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2643 states, 2643 states have (on average 2.4646235338630342) internal successors, (in total 6514), 2642 states have internal predecessors, (6514), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:22,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 6514 transitions. [2025-04-26 16:55:22,638 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2643 states and 6514 transitions. [2025-04-26 16:55:22,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:55:22,639 INFO L438 stractBuchiCegarLoop]: Abstraction has 2643 states and 6514 transitions. [2025-04-26 16:55:22,639 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:55:22,639 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2643 states and 6514 transitions. [2025-04-26 16:55:22,647 INFO L131 ngComponentsAnalysis]: Automaton has 109 accepting balls. 259 [2025-04-26 16:55:22,648 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:22,648 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:22,648 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:22,648 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:22,648 INFO L752 eck$LassoCheckResult]: Stem: "[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L25-->L26: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[89] L26-->L26-1: Formula: (and (= (select v_q1_3 v_q1_back_9) v_C_4) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, q1_back=v_q1_back_9, C=v_C_4} OutVars{q1=v_q1_3, q1_back=v_q1_back_8, C=v_C_4} AuxVars[] AssignedVars[q1_back]" "[109] L74-1-->L37: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[92] L37-->L38: Formula: (< v_j_2 v_M_2) InVars {M=v_M_2, j=v_j_2} OutVars{M=v_M_2, j=v_j_2} AuxVars[] AssignedVars[]" "[94] L38-->L38-1: Formula: (and (= (+ v_C_6 (select v_q2_3 v_q2_back_9)) 0) (= (+ v_q2_back_9 1) v_q2_back_8)) InVars {q2=v_q2_3, C=v_C_6, q2_back=v_q2_back_9} OutVars{q2=v_q2_3, C=v_C_6, q2_back=v_q2_back_8} AuxVars[] AssignedVars[q2_back]" "[112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 16:55:22,649 INFO L754 eck$LassoCheckResult]: Loop: "[101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[]" "[103] L62-->L62-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front]" [2025-04-26 16:55:22,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:22,649 INFO L85 PathProgramCache]: Analyzing trace with hash 677649938, now seen corresponding path program 1 times [2025-04-26 16:55:22,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:22,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103503100] [2025-04-26 16:55:22,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:22,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:22,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:22,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:22,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:22,654 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:22,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:22,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:22,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:22,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:22,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:22,659 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 2 times [2025-04-26 16:55:22,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:22,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020418273] [2025-04-26 16:55:22,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:22,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:22,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:22,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:22,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:22,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:22,661 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:22,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:22,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:22,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:22,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:22,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:22,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1613435340, now seen corresponding path program 1 times [2025-04-26 16:55:22,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:22,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349262011] [2025-04-26 16:55:22,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:22,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:22,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:22,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:22,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:22,668 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:22,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:22,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:22,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:22,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:22,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:22,851 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:22,852 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:22,852 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:22,852 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:22,852 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:22,852 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:22,852 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:22,852 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:22,852 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:55:22,852 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:22,852 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:22,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,892 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,894 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:22,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,031 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:23,031 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:23,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,033 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:55:23,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,046 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,049 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:23,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:23,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,057 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:55:23,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,076 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:23,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:55:23,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,098 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:55:23,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,115 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:23,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:23,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,123 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:55:23,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,139 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:23,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:23,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,147 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:55:23,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,167 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:23,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 16:55:23,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,174 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:55:23,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,192 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:23,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 16:55:23,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,200 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:55:23,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,217 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:23,230 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:55:23,230 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:55:23,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,232 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:55:23,235 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:23,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:23,252 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:23,252 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:23,252 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2025-04-26 16:55:23,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 16:55:23,258 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:23,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:23,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:23,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:23,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:23,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:23,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:23,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:23,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:23,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:23,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:23,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:23,297 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:23,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:23,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:23,299 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:23,299 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2643 states and 6514 transitions. cyclomatic complexity: 4243 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:23,356 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2643 states and 6514 transitions. cyclomatic complexity: 4243. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 6406 states and 15366 transitions. Complement of second has 5 states. [2025-04-26 16:55:23,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-04-26 16:55:23,359 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:55:23,359 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:23,359 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:55:23,359 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:23,359 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:55:23,359 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:23,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6406 states and 15366 transitions. [2025-04-26 16:55:23,429 INFO L131 ngComponentsAnalysis]: Automaton has 157 accepting balls. 355 [2025-04-26 16:55:23,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6406 states to 4991 states and 12151 transitions. [2025-04-26 16:55:23,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1256 [2025-04-26 16:55:23,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1347 [2025-04-26 16:55:23,460 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4991 states and 12151 transitions. [2025-04-26 16:55:23,460 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:23,460 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4991 states and 12151 transitions. [2025-04-26 16:55:23,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states and 12151 transitions. [2025-04-26 16:55:23,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 4250. [2025-04-26 16:55:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 4250 states have (on average 2.471764705882353) internal successors, (in total 10505), 4249 states have internal predecessors, (10505), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:23,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 10505 transitions. [2025-04-26 16:55:23,537 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4250 states and 10505 transitions. [2025-04-26 16:55:23,537 INFO L438 stractBuchiCegarLoop]: Abstraction has 4250 states and 10505 transitions. [2025-04-26 16:55:23,537 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:55:23,537 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4250 states and 10505 transitions. [2025-04-26 16:55:23,548 INFO L131 ngComponentsAnalysis]: Automaton has 131 accepting balls. 303 [2025-04-26 16:55:23,548 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:23,548 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:23,548 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:23,548 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:23,549 INFO L752 eck$LassoCheckResult]: Stem: "[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L25-->L26: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[109] L74-1-->L37: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[92] L37-->L38: Formula: (< v_j_2 v_M_2) InVars {M=v_M_2, j=v_j_2} OutVars{M=v_M_2, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[]" "[94] L38-->L38-1: Formula: (and (= (+ v_C_6 (select v_q2_3 v_q2_back_9)) 0) (= (+ v_q2_back_9 1) v_q2_back_8)) InVars {q2=v_q2_3, C=v_C_6, q2_back=v_q2_back_9} OutVars{q2=v_q2_3, C=v_C_6, q2_back=v_q2_back_8} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:55:23,549 INFO L754 eck$LassoCheckResult]: Loop: "[101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[]" "[103] L62-->L62-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front]" [2025-04-26 16:55:23,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:23,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1235148616, now seen corresponding path program 1 times [2025-04-26 16:55:23,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:23,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775909875] [2025-04-26 16:55:23,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:23,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:23,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:23,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:23,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:23,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:23,555 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:23,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:23,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:23,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:23,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:23,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:23,563 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:23,563 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 3 times [2025-04-26 16:55:23,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:23,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850191200] [2025-04-26 16:55:23,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:23,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:23,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:23,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:23,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:55:23,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:23,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:23,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:23,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:23,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:23,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:23,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:23,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:23,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1566849514, now seen corresponding path program 1 times [2025-04-26 16:55:23,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:23,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139086671] [2025-04-26 16:55:23,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:23,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:23,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:23,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:23,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:23,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:23,582 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:23,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:23,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:23,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:23,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:23,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:23,740 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:23,741 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:23,741 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:23,741 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:23,741 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:23,741 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,741 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:23,741 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:23,741 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:55:23,741 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:23,741 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:23,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,751 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:23,904 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:23,904 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:23,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,938 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:55:23,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,951 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,953 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:23,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 16:55:23,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,962 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:55:23,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,975 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,975 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,977 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:23,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-04-26 16:55:23,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:23,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:23,984 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:23,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:55:23,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:23,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:23,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:23,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:23,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:23,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:23,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:23,999 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:24,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-04-26 16:55:24,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:24,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:24,008 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:24,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 16:55:24,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:24,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:24,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:24,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:24,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:24,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:24,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:24,026 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:24,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 16:55:24,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:24,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:24,034 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:24,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 16:55:24,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:24,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:24,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:24,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:24,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:24,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:24,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:24,069 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:24,073 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:55:24,073 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:55:24,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:24,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:24,075 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:24,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 16:55:24,077 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:24,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:24,097 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:24,097 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:24,097 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2025-04-26 16:55:24,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-04-26 16:55:24,104 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:24,121 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:24,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:24,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:24,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:24,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:24,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:24,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:24,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:24,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:24,140 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:24,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:24,143 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:24,143 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4250 states and 10505 transitions. cyclomatic complexity: 6837 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:24,225 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4250 states and 10505 transitions. cyclomatic complexity: 6837. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 14285 states and 35105 transitions. Complement of second has 5 states. [2025-04-26 16:55:24,225 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:24,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:24,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-04-26 16:55:24,226 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:55:24,226 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:24,226 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:55:24,226 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:24,226 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:55:24,226 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:24,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14285 states and 35105 transitions. [2025-04-26 16:55:24,296 INFO L131 ngComponentsAnalysis]: Automaton has 247 accepting balls. 535 [2025-04-26 16:55:24,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14285 states to 11078 states and 26973 transitions. [2025-04-26 16:55:24,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2395 [2025-04-26 16:55:24,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2520 [2025-04-26 16:55:24,358 INFO L74 IsDeterministic]: Start isDeterministic. Operand 11078 states and 26973 transitions. [2025-04-26 16:55:24,358 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:24,358 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11078 states and 26973 transitions. [2025-04-26 16:55:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11078 states and 26973 transitions. [2025-04-26 16:55:24,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11078 to 5912. [2025-04-26 16:55:24,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5912 states, 5912 states have (on average 2.4944181326116373) internal successors, (in total 14747), 5911 states have internal predecessors, (14747), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 14747 transitions. [2025-04-26 16:55:24,556 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5912 states and 14747 transitions. [2025-04-26 16:55:24,556 INFO L438 stractBuchiCegarLoop]: Abstraction has 5912 states and 14747 transitions. [2025-04-26 16:55:24,557 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:55:24,557 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5912 states and 14747 transitions. [2025-04-26 16:55:24,579 INFO L131 ngComponentsAnalysis]: Automaton has 153 accepting balls. 347 [2025-04-26 16:55:24,579 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:24,579 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:24,580 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:24,580 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:24,580 INFO L752 eck$LassoCheckResult]: Stem: "[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L25-->L26: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[89] L26-->L26-1: Formula: (and (= (select v_q1_3 v_q1_back_9) v_C_4) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, q1_back=v_q1_back_9, C=v_C_4} OutVars{q1=v_q1_3, q1_back=v_q1_back_8, C=v_C_4} AuxVars[] AssignedVars[q1_back]" "[90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i]" "[87] L25-->L26: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[109] L74-1-->L37: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[92] L37-->L38: Formula: (< v_j_2 v_M_2) InVars {M=v_M_2, j=v_j_2} OutVars{M=v_M_2, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[89] L26-->L26-1: Formula: (and (= (select v_q1_3 v_q1_back_9) v_C_4) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, q1_back=v_q1_back_9, C=v_C_4} OutVars{q1=v_q1_3, q1_back=v_q1_back_8, C=v_C_4} AuxVars[] AssignedVars[q1_back]" [2025-04-26 16:55:24,580 INFO L754 eck$LassoCheckResult]: Loop: "[97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[]" "[99] L50-->L50-1: Formula: (and (= (+ (select v_q1_7 v_q1_front_13) v_total_12) v_total_11) (= (+ v_q1_front_13 1) v_q1_front_12) (< v_q1_front_13 v_q1_back_12)) InVars {q1_front=v_q1_front_13, q1=v_q1_7, total=v_total_12, q1_back=v_q1_back_12} OutVars{q1_front=v_q1_front_12, q1=v_q1_7, total=v_total_11, q1_back=v_q1_back_12} AuxVars[] AssignedVars[q1_front, total]" [2025-04-26 16:55:24,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:24,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1015832235, now seen corresponding path program 1 times [2025-04-26 16:55:24,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:24,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229036883] [2025-04-26 16:55:24,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:24,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:24,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:24,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:24,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,585 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:24,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:24,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:24,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:24,590 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:24,590 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 4 times [2025-04-26 16:55:24,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:24,590 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732820418] [2025-04-26 16:55:24,590 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:55:24,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:24,595 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-04-26 16:55:24,598 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:24,598 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:55:24,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,598 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:24,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:24,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:24,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:24,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:24,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1257198537, now seen corresponding path program 1 times [2025-04-26 16:55:24,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:24,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621140800] [2025-04-26 16:55:24,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:24,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:24,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:24,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:24,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,610 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:24,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:24,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:24,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:24,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:24,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:24,771 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:24,771 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:24,771 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:24,771 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:24,771 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:24,771 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:24,771 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:24,771 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:24,771 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_petrified1_Iteration9_Lasso [2025-04-26 16:55:24,771 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:24,771 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:24,772 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:24,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:24,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:24,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:24,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:24,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:24,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:24,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:24,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:24,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:24,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:24,926 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:24,926 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:24,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:24,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:24,929 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:24,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 16:55:24,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:24,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:24,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:24,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:24,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:24,942 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:24,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:24,945 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:24,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2025-04-26 16:55:24,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:24,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:24,953 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:24,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 16:55:24,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:24,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:24,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:24,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:24,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:24,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:24,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:24,969 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:24,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 16:55:24,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:24,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:24,977 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:24,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 16:55:24,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:24,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:24,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:24,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:24,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:24,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:24,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:24,994 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:25,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:25,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:25,002 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:25,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 16:55:25,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:25,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:25,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:25,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:25,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:25,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:25,023 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:25,026 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:25,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-04-26 16:55:25,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:25,089 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:25,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 16:55:25,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:25,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:25,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:25,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:25,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:25,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:25,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:25,110 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:25,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 16:55:25,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:25,121 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:25,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 16:55:25,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:25,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:25,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:25,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:25,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:25,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:25,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:25,137 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:25,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-04-26 16:55:25,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:25,149 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:25,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 16:55:25,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:25,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:25,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:25,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:25,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:25,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:25,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:25,165 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:25,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:25,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:25,173 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:25,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 16:55:25,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:25,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:25,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:25,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:25,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:25,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:25,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:25,190 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:25,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-04-26 16:55:25,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:25,198 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:25,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 16:55:25,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:25,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:25,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:25,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:25,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:25,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:25,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:25,216 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:25,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-04-26 16:55:25,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:25,223 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:25,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-04-26 16:55:25,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:25,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:25,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:25,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:25,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:25,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:25,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:25,241 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:25,247 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:55:25,247 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:55:25,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:25,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:25,249 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:25,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-04-26 16:55:25,250 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:25,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-04-26 16:55:25,266 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:25,266 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:25,266 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2025-04-26 16:55:25,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-04-26 16:55:25,274 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:55:25,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:25,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:25,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:25,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:25,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:25,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:25,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:25,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:25,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:25,309 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:25,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:25,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:25,311 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:25,311 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5912 states and 14747 transitions. cyclomatic complexity: 9630 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:25,380 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5912 states and 14747 transitions. cyclomatic complexity: 9630. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 12263 states and 29934 transitions. Complement of second has 5 states. [2025-04-26 16:55:25,380 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-04-26 16:55:25,381 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:55:25,381 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:25,381 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:25,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:25,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:25,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:25,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:25,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:25,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:25,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:25,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:25,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:25,415 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:25,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:25,417 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:25,417 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5912 states and 14747 transitions. cyclomatic complexity: 9630 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:25,483 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5912 states and 14747 transitions. cyclomatic complexity: 9630. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 12263 states and 29934 transitions. Complement of second has 5 states. [2025-04-26 16:55:25,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:25,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-04-26 16:55:25,484 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:55:25,484 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:25,484 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:25,492 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:25,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:25,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:25,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:25,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:25,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:25,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:25,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:25,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:25,515 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:25,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:25,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:25,517 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:25,517 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5912 states and 14747 transitions. cyclomatic complexity: 9630 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:25,617 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5912 states and 14747 transitions. cyclomatic complexity: 9630. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 13406 states and 32814 transitions. Complement of second has 5 states. [2025-04-26 16:55:25,617 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-04-26 16:55:25,618 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 72 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:55:25,618 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:25,618 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 72 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:55:25,618 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:25,618 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 72 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:55:25,618 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:25,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13406 states and 32814 transitions. [2025-04-26 16:55:25,685 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 106 [2025-04-26 16:55:25,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13406 states to 6599 states and 16138 transitions. [2025-04-26 16:55:25,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1183 [2025-04-26 16:55:25,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1327 [2025-04-26 16:55:25,720 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6599 states and 16138 transitions. [2025-04-26 16:55:25,720 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:25,720 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6599 states and 16138 transitions. [2025-04-26 16:55:25,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6599 states and 16138 transitions. [2025-04-26 16:55:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6599 to 3103. [2025-04-26 16:55:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3103 states, 3103 states have (on average 2.4215275539800194) internal successors, (in total 7514), 3102 states have internal predecessors, (7514), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 7514 transitions. [2025-04-26 16:55:25,814 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3103 states and 7514 transitions. [2025-04-26 16:55:25,814 INFO L438 stractBuchiCegarLoop]: Abstraction has 3103 states and 7514 transitions. [2025-04-26 16:55:25,814 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:55:25,814 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3103 states and 7514 transitions. [2025-04-26 16:55:25,820 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 60 [2025-04-26 16:55:25,821 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:25,821 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:25,821 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:25,821 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:25,821 INFO L752 eck$LassoCheckResult]: Stem: "[77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L25-->L26: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[89] L26-->L26-1: Formula: (and (= (select v_q1_3 v_q1_back_9) v_C_4) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, q1_back=v_q1_back_9, C=v_C_4} OutVars{q1=v_q1_3, q1_back=v_q1_back_8, C=v_C_4} AuxVars[] AssignedVars[q1_back]" "[109] L74-1-->L37: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[92] L37-->L38: Formula: (< v_j_2 v_M_2) InVars {M=v_M_2, j=v_j_2} OutVars{M=v_M_2, j=v_j_2} AuxVars[] AssignedVars[]" "[94] L38-->L38-1: Formula: (and (= (+ v_C_6 (select v_q2_3 v_q2_back_9)) 0) (= (+ v_q2_back_9 1) v_q2_back_8)) InVars {q2=v_q2_3, C=v_C_6, q2_back=v_q2_back_9} OutVars{q2=v_q2_3, C=v_C_6, q2_back=v_q2_back_8} AuxVars[] AssignedVars[q2_back]" "[112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j]" "[92] L37-->L38: Formula: (< v_j_2 v_M_2) InVars {M=v_M_2, j=v_j_2} OutVars{M=v_M_2, j=v_j_2} AuxVars[] AssignedVars[]" "[94] L38-->L38-1: Formula: (and (= (+ v_C_6 (select v_q2_3 v_q2_back_9)) 0) (= (+ v_q2_back_9 1) v_q2_back_8)) InVars {q2=v_q2_3, C=v_C_6, q2_back=v_q2_back_9} OutVars{q2=v_q2_3, C=v_C_6, q2_back=v_q2_back_8} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:55:25,821 INFO L754 eck$LassoCheckResult]: Loop: "[101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[]" "[103] L62-->L62-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front]" [2025-04-26 16:55:25,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:25,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1523105999, now seen corresponding path program 1 times [2025-04-26 16:55:25,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:25,822 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811230840] [2025-04-26 16:55:25,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:25,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:25,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:25,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:25,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:25,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:25,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:25,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:25,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:25,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:25,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:25,833 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 4 times [2025-04-26 16:55:25,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:25,833 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001411865] [2025-04-26 16:55:25,833 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:55:25,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:25,834 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-04-26 16:55:25,835 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:25,835 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:55:25,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:25,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:25,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:25,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:25,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:25,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:25,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:25,837 INFO L85 PathProgramCache]: Analyzing trace with hash -878979663, now seen corresponding path program 1 times [2025-04-26 16:55:25,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:25,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366893080] [2025-04-26 16:55:25,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:25,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:25,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:55:25,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:55:25,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:25,841 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:25,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:55:25,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:55:25,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:25,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:25,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:26,058 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:26,058 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:26,058 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:26,058 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:26,058 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:26,058 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,058 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:26,058 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:26,058 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_petrified1_Iteration10_Lasso [2025-04-26 16:55:26,058 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:26,058 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:26,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,109 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:26,341 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:26,342 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:26,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,344 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:26,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-04-26 16:55:26,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:26,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:26,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:26,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:26,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:26,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:26,358 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:26,361 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:26,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:26,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,368 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:26,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-04-26 16:55:26,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:26,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:26,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:26,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:26,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:26,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:26,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:26,384 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:26,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-04-26 16:55:26,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,392 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:26,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 16:55:26,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:26,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:26,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:26,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:26,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:26,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:26,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:26,407 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:26,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:26,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,414 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:26,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-04-26 16:55:26,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:26,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:26,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:26,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:26,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:26,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:26,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:26,429 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:26,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-04-26 16:55:26,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,437 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:26,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-04-26 16:55:26,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:26,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:26,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:26,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:26,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:26,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:26,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:26,454 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:26,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:26,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,463 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:26,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-04-26 16:55:26,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:26,476 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:26,476 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:26,476 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:26,476 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:26,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:26,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:26,480 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:26,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-04-26 16:55:26,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,488 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:26,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-04-26 16:55:26,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:26,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:26,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:26,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:26,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:26,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:26,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:26,506 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:26,513 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:55:26,513 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:55:26,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:26,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:26,515 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:26,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-04-26 16:55:26,518 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:26,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:26,533 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:26,533 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:26,533 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2025-04-26 16:55:26,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-04-26 16:55:26,542 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:55:26,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:26,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:26,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:26,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:26,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:26,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:26,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:26,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:26,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:26,584 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:26,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:26,587 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:26,587 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3103 states and 7514 transitions. cyclomatic complexity: 4730 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:26,637 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3103 states and 7514 transitions. cyclomatic complexity: 4730. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 6300 states and 15017 transitions. Complement of second has 5 states. [2025-04-26 16:55:26,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:26,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:26,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-04-26 16:55:26,640 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:55:26,640 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:26,641 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:26,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:26,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:26,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:26,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:26,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:26,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:26,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:26,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:26,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:26,674 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:26,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:26,676 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:26,676 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3103 states and 7514 transitions. cyclomatic complexity: 4730 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:26,719 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3103 states and 7514 transitions. cyclomatic complexity: 4730. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 6300 states and 15017 transitions. Complement of second has 5 states. [2025-04-26 16:55:26,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:26,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:26,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-04-26 16:55:26,720 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:55:26,721 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:26,721 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:26,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:26,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:26,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:26,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:26,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:26,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:26,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:26,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:26,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:26,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:26,754 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:26,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:26,756 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:26,757 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3103 states and 7514 transitions. cyclomatic complexity: 4730 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:26,814 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3103 states and 7514 transitions. cyclomatic complexity: 4730. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 7236 states and 17212 transitions. Complement of second has 5 states. [2025-04-26 16:55:26,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-04-26 16:55:26,815 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 62 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:55:26,815 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:26,815 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 62 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 16:55:26,815 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:26,815 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 62 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:55:26,815 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:26,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7236 states and 17212 transitions. [2025-04-26 16:55:26,852 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:26,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7236 states to 0 states and 0 transitions. [2025-04-26 16:55:26,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:55:26,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:55:26,853 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:55:26,853 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:26,853 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:26,853 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:26,853 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:26,853 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:55:26,853 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:55:26,853 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:26,853 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:55:26,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:26,866 INFO L201 PluginConnector]: Adding new model buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:26 BoogieIcfgContainer [2025-04-26 16:55:26,866 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:26,866 INFO L158 Benchmark]: Toolchain (without parser) took 8724.52ms. Allocated memory was 142.6MB in the beginning and 461.4MB in the end (delta: 318.8MB). Free memory was 76.9MB in the beginning and 199.3MB in the end (delta: -122.4MB). Peak memory consumption was 199.0MB. Max. memory is 8.0GB. [2025-04-26 16:55:26,866 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.71ms. Allocated memory is still 142.6MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:26,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.47ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 75.0MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:55:26,867 INFO L158 Benchmark]: Boogie Preprocessor took 26.81ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 73.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:26,867 INFO L158 Benchmark]: RCFGBuilder took 219.84ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 63.2MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:55:26,868 INFO L158 Benchmark]: BuchiAutomizer took 8433.45ms. Allocated memory was 142.6MB in the beginning and 461.4MB in the end (delta: 318.8MB). Free memory was 63.2MB in the beginning and 199.3MB in the end (delta: -136.1MB). Peak memory consumption was 182.2MB. Max. memory is 8.0GB. [2025-04-26 16:55:26,868 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.71ms. Allocated memory is still 142.6MB. Free memory is still 77.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.47ms. Allocated memory is still 142.6MB. Free memory was 76.9MB in the beginning and 75.0MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.81ms. Allocated memory is still 142.6MB. Free memory was 75.0MB in the beginning and 73.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 219.84ms. Allocated memory is still 142.6MB. Free memory was 73.8MB in the beginning and 63.2MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 8433.45ms. Allocated memory was 142.6MB in the beginning and 461.4MB in the end (delta: 318.8MB). Free memory was 63.2MB in the beginning and 199.3MB in the end (delta: -136.1MB). Peak memory consumption was 182.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 5.1s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 12065 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.5s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 557 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 545 mSDsluCounter, 466 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 167 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 440 IncrementalHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 299 mSDtfsCounter, 440 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital79 mio100 ax100 hnf100 lsp49 ukn95 mio100 lsp63 div100 bol100 ite100 ukn100 eq182 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 406, Number of transitions in reduction automaton: 1281, Number of states in reduction automaton: 589, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (2 trivial, 6 deterministic, 2 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function M + -1 * j and consists of 5 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One nondeterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One nondeterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:55:26,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...