/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 18:40:47,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:48,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:48,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:48,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:48,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:40:48,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:48,062 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:48,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:48,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:48,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:48,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:48,063 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:48,063 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:48,063 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:48,063 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:48,063 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:48,063 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:48,063 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:48,063 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:48,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:48,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:48,064 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:48,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:48,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:48,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:48,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:48,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:48,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:48,064 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:48,064 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:48,064 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:48,064 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:48,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:48,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:48,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:48,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:48,066 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:48,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:48,066 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:48,066 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:48,066 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:48,066 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:48,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:48,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:48,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:48,292 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:48,294 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:48,295 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 18:40:48,297 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 18:40:48,315 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:48,316 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:48,317 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:48,317 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:48,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:48,325 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 06:40:48" (1/1) ... [2025-04-26 18:40:48,344 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 06:40:48" (1/1) ... [2025-04-26 18:40:48,348 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:48,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:48,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:48,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:48,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:48,355 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 06:40:48" (1/1) ... [2025-04-26 18:40:48,355 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 06:40:48" (1/1) ... [2025-04-26 18:40:48,357 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 06:40:48" (1/1) ... [2025-04-26 18:40:48,357 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 06:40:48" (1/1) ... [2025-04-26 18:40:48,359 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 06:40:48" (1/1) ... [2025-04-26 18:40:48,360 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 06:40:48" (1/1) ... [2025-04-26 18:40:48,363 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 06:40:48" (1/1) ... [2025-04-26 18:40:48,367 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 06:40:48" (1/1) ... [2025-04-26 18:40:48,367 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 06:40:48" (1/1) ... [2025-04-26 18:40:48,379 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:48,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:48,380 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:48,380 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:48,381 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 06:40:48" (1/1) ... [2025-04-26 18:40:48,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:48,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:48,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:48,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:40:48,433 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:48,433 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:48,433 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:48,433 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:48,433 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:48,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:48,433 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:40:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:40:48,433 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:40:48,434 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:40:48,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:40:48,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:40:48,435 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:40:48,475 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:48,476 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:48,565 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:48,565 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:48,586 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:48,586 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:40:48,587 INFO L201 PluginConnector]: Adding new model buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:48 BoogieIcfgContainer [2025-04-26 18:40:48,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:48,587 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:48,587 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:48,593 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:48,593 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:48,593 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 06:40:48" (1/2) ... [2025-04-26 18:40:48,594 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c65ae98 and model type buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:48, skipping insertion in model container [2025-04-26 18:40:48,594 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:48,594 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 06:40:48" (2/2) ... [2025-04-26 18:40:48,595 INFO L376 chiAutomizerObserver]: Analyzing ICFG buffer-mult-alt.wvr.bpl [2025-04-26 18:40:48,648 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:40:48,684 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:48,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:48,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:48,689 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:48,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:40:48,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 106 flow [2025-04-26 18:40:48,766 INFO L116 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-04-26 18:40:48,767 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:40:48,772 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 18:40:48,772 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 106 flow [2025-04-26 18:40:48,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2025-04-26 18:40:48,775 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 40 places, 31 transitions, 86 flow [2025-04-26 18:40:48,775 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 31 transitions, 86 flow [2025-04-26 18:40:48,837 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 637 states, 635 states have (on average 3.8866141732283466) internal successors, (in total 2468), 636 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:48,839 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 637 states, 635 states have (on average 3.8866141732283466) internal successors, (in total 2468), 636 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:48,841 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:48,993 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 237#[L50-1, L76, thread2EXIT, L26]true [2025-04-26 18:40:49,063 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 675#[L62, L77, L38, L50, L26]true [2025-04-26 18:40:49,063 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 415#[L77, L38, L50, L26, L62-1]true [2025-04-26 18:40:49,064 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 671#[L77, L38-1, L50, L26, L62-1]true [2025-04-26 18:40:49,064 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 383#[L26-1, L50-1, L76, L38-1]true [2025-04-26 18:40:49,064 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 135#[L50-1, L76, L38, L26]true [2025-04-26 18:40:49,068 WARN L140 AmpleReduction]: Number of pruned transitions: 933 [2025-04-26 18:40:49,068 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 6 [2025-04-26 18:40:49,068 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 168 [2025-04-26 18:40:49,068 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:47 [2025-04-26 18:40:49,068 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:379 [2025-04-26 18:40:49,068 WARN L145 AmpleReduction]: Times succ was already a loop node:232 [2025-04-26 18:40:49,068 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:205 [2025-04-26 18:40:49,068 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:49,070 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 18:40:49,079 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:49,079 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:49,079 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:49,079 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:49,079 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:49,079 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:49,079 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:49,080 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:49,082 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 18:40:49,118 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 486 [2025-04-26 18:40:49,119 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:49,119 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:49,123 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:49,123 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:49,124 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:49,125 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 18:40:49,136 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 486 [2025-04-26 18:40:49,136 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:49,136 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:49,136 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:49,136 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:49,141 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 18:40:49,142 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 18:40:49,147 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:49,147 INFO L85 PathProgramCache]: Analyzing trace with hash 3454, now seen corresponding path program 1 times [2025-04-26 18:40:49,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:49,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743516944] [2025-04-26 18:40:49,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:49,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:49,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:49,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:49,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:49,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:49,205 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:49,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:49,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:49,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:49,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:49,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:49,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:49,228 INFO L85 PathProgramCache]: Analyzing trace with hash 116247, now seen corresponding path program 1 times [2025-04-26 18:40:49,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:49,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434576362] [2025-04-26 18:40:49,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:49,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:49,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:49,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:49,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:49,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:49,238 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:49,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:49,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:49,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:49,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:49,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:49,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:49,247 INFO L85 PathProgramCache]: Analyzing trace with hash 102984570, now seen corresponding path program 1 times [2025-04-26 18:40:49,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:49,247 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086907645] [2025-04-26 18:40:49,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:49,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:49,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:49,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:49,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:49,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:49,258 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:49,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:49,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:49,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:49,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:49,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:49,408 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:49,409 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:49,409 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:49,409 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:49,409 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:49,409 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:49,409 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:49,409 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:49,409 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:40:49,409 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:49,410 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:49,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:49,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:49,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:49,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:49,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:49,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:49,596 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:49,598 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:49,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:49,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:49,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:49,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:40:49,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:49,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:49,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:49,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:49,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:49,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:49,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:49,635 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:49,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:40:49,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:49,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:49,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:49,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:40:49,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:49,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:49,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:49,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:49,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:49,662 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:49,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:49,667 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:49,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:40:49,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:49,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:49,675 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:49,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:40:49,678 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:49,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:49,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:49,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:49,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:49,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:49,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:49,698 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:49,705 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 18:40:49,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:49,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:49,710 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:49,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:40:49,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:49,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:49,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:49,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:49,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:49,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:49,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:49,730 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:49,741 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:40:49,741 INFO L437 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:40:49,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:49,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:49,744 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:49,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:40:49,747 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:49,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:40:49,765 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:49,765 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:49,765 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 18:40:49,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:40:49,773 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:49,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:49,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:49,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:49,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:49,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:49,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:49,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:49,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:49,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:49,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:49,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:49,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:49,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:49,848 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:40:49,851 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 18:40:49,977 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 18:40:49,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:49,982 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 18:40:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2025-04-26 18:40:49,985 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 86 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 18:40:49,986 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:49,986 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 86 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:40:49,986 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:49,986 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 86 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 18:40:49,986 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:49,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1614 states and 3502 transitions. [2025-04-26 18:40:50,001 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 304 [2025-04-26 18:40:50,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1614 states to 799 states and 1759 transitions. [2025-04-26 18:40:50,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 376 [2025-04-26 18:40:50,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 506 [2025-04-26 18:40:50,018 INFO L74 IsDeterministic]: Start isDeterministic. Operand 799 states and 1759 transitions. [2025-04-26 18:40:50,019 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:50,019 INFO L218 hiAutomatonCegarLoop]: Abstraction has 799 states and 1759 transitions. [2025-04-26 18:40:50,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states and 1759 transitions. [2025-04-26 18:40:50,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 702. [2025-04-26 18:40:50,074 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 18:40:50,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1536 transitions. [2025-04-26 18:40:50,077 INFO L240 hiAutomatonCegarLoop]: Abstraction has 702 states and 1536 transitions. [2025-04-26 18:40:50,077 INFO L438 stractBuchiCegarLoop]: Abstraction has 702 states and 1536 transitions. [2025-04-26 18:40:50,077 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:50,077 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 702 states and 1536 transitions. [2025-04-26 18:40:50,080 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 304 [2025-04-26 18:40:50,080 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:50,080 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:50,081 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:40:50,081 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:50,081 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 18:40:50,081 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 18:40:50,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,082 INFO L85 PathProgramCache]: Analyzing trace with hash 3322100, now seen corresponding path program 1 times [2025-04-26 18:40:50,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328344298] [2025-04-26 18:40:50,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:50,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:50,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:50,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:50,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:50,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:50,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:50,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,091 INFO L85 PathProgramCache]: Analyzing trace with hash 121212, now seen corresponding path program 1 times [2025-04-26 18:40:50,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518470650] [2025-04-26 18:40:50,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:50,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:50,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:50,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,094 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:50,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:50,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:50,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:50,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash 184524713, now seen corresponding path program 1 times [2025-04-26 18:40:50,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409483988] [2025-04-26 18:40:50,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:50,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:50,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:50,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,111 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:50,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:50,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:50,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:50,231 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:50,231 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:50,231 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:50,231 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:50,232 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:50,232 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:50,232 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:50,232 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:50,232 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:40:50,232 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:50,232 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:50,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:50,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:50,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:50,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:50,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:50,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:50,260 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:50,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:50,345 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:50,345 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:50,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:50,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:50,348 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:50,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:40:50,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:50,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:50,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:50,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:50,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:50,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:50,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:50,365 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:50,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:50,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:50,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:50,373 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:50,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:40:50,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:50,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:50,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:50,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:50,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:50,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:50,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:50,391 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:50,397 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 18:40:50,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:50,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:50,399 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:50,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:40:50,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 18:40:50,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:50,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:50,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:50,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:50,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:50,414 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:50,417 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:50,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:50,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:50,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:50,426 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:50,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:40:50,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:50,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:50,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:50,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:50,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:50,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:50,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:50,441 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:50,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:40:50,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:50,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:50,450 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:50,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:40:50,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:50,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:50,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:50,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:50,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:50,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:50,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:50,467 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:50,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:50,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:50,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:50,475 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:50,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:40:50,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:50,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:50,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:50,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:50,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:50,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:50,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:50,495 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:50,503 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:40:50,503 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:40:50,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:50,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:50,505 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:50,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:40:50,507 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:50,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:50,523 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:50,523 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:50,523 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 18:40:50,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:40:50,531 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:50,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:50,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:50,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:50,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:50,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:50,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:50,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:50,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:50,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:50,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:50,583 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:40:50,583 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 18:40:50,673 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 18:40:50,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:50,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-04-26 18:40:50,675 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 74 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 18:40:50,675 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:50,675 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 74 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 18:40:50,675 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:50,675 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 74 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 18:40:50,675 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:50,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1587 states and 3410 transitions. [2025-04-26 18:40:50,687 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 179 [2025-04-26 18:40:50,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1587 states to 852 states and 1918 transitions. [2025-04-26 18:40:50,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2025-04-26 18:40:50,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 387 [2025-04-26 18:40:50,694 INFO L74 IsDeterministic]: Start isDeterministic. Operand 852 states and 1918 transitions. [2025-04-26 18:40:50,695 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:50,695 INFO L218 hiAutomatonCegarLoop]: Abstraction has 852 states and 1918 transitions. [2025-04-26 18:40:50,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states and 1918 transitions. [2025-04-26 18:40:50,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 814. [2025-04-26 18:40:50,713 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 18:40:50,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1843 transitions. [2025-04-26 18:40:50,715 INFO L240 hiAutomatonCegarLoop]: Abstraction has 814 states and 1843 transitions. [2025-04-26 18:40:50,715 INFO L438 stractBuchiCegarLoop]: Abstraction has 814 states and 1843 transitions. [2025-04-26 18:40:50,715 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:50,716 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 814 states and 1843 transitions. [2025-04-26 18:40:50,719 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 179 [2025-04-26 18:40:50,719 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:50,719 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:50,719 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:40:50,719 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:50,720 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 18:40:50,720 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 18:40:50,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1102426232, now seen corresponding path program 1 times [2025-04-26 18:40:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885133212] [2025-04-26 18:40:50,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:50,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:50,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:50,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,730 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:50,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:50,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:50,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:50,736 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,736 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 18:40:50,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661299074] [2025-04-26 18:40:50,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:50,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:50,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:50,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,747 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:50,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:50,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:50,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:50,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1425316266, now seen corresponding path program 1 times [2025-04-26 18:40:50,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436542854] [2025-04-26 18:40:50,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:50,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:50,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:50,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:50,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:50,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:50,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436542854] [2025-04-26 18:40:50,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436542854] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:50,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:50,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 18:40:50,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202621275] [2025-04-26 18:40:50,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:50,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:50,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:40:50,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:40:50,843 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 18:40:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:50,873 INFO L93 Difference]: Finished difference Result 982 states and 2171 transitions. [2025-04-26 18:40:50,873 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 982 states and 2171 transitions. [2025-04-26 18:40:50,880 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 203 [2025-04-26 18:40:50,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 982 states to 966 states and 2151 transitions. [2025-04-26 18:40:50,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 416 [2025-04-26 18:40:50,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 416 [2025-04-26 18:40:50,888 INFO L74 IsDeterministic]: Start isDeterministic. Operand 966 states and 2151 transitions. [2025-04-26 18:40:50,888 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:50,888 INFO L218 hiAutomatonCegarLoop]: Abstraction has 966 states and 2151 transitions. [2025-04-26 18:40:50,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states and 2151 transitions. [2025-04-26 18:40:50,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 926. [2025-04-26 18:40:50,903 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 18:40:50,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 2092 transitions. [2025-04-26 18:40:50,907 INFO L240 hiAutomatonCegarLoop]: Abstraction has 926 states and 2092 transitions. [2025-04-26 18:40:50,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:40:50,909 INFO L438 stractBuchiCegarLoop]: Abstraction has 926 states and 2092 transitions. [2025-04-26 18:40:50,909 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:40:50,909 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 926 states and 2092 transitions. [2025-04-26 18:40:50,912 INFO L131 ngComponentsAnalysis]: Automaton has 74 accepting balls. 189 [2025-04-26 18:40:50,912 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:50,912 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:50,912 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:50,912 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:50,913 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 18:40:50,913 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 18:40:50,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,913 INFO L85 PathProgramCache]: Analyzing trace with hash 183945185, now seen corresponding path program 1 times [2025-04-26 18:40:50,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6035240] [2025-04-26 18:40:50,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:50,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:50,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:50,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,921 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:50,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:50,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:50,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:50,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,929 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 2 times [2025-04-26 18:40:50,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735682006] [2025-04-26 18:40:50,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:50,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:50,936 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:50,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:50,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:50,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:50,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:50,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,941 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:50,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:50,942 INFO L85 PathProgramCache]: Analyzing trace with hash 677666755, now seen corresponding path program 1 times [2025-04-26 18:40:50,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:50,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169437048] [2025-04-26 18:40:50,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:50,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:50,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:50,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:50,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,950 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:50,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:50,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:50,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:50,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:50,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:51,105 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:51,106 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:51,106 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:51,106 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:51,106 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:51,106 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,106 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:51,106 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:51,106 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:40:51,106 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:51,106 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:51,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,149 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,250 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:51,250 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:51,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:51,254 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:51,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:40:51,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:51,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:51,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:51,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:51,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:51,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:51,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:51,274 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:51,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:51,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:51,283 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:51,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:40:51,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:51,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:51,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:51,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:51,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:51,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:51,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:51,311 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:51,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:51,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:51,319 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:51,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:40:51,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:51,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:51,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:51,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:51,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:51,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:51,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:51,335 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:51,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:51,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:51,342 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:51,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:40:51,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:51,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:51,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:51,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:51,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:51,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:51,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:51,359 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:51,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:51,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:51,366 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:51,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:40:51,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:51,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:51,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:51,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:51,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:51,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:51,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:51,383 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:51,388 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 18:40:51,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:51,391 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:51,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:40:51,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:51,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:51,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:51,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:51,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:51,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:51,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:51,409 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:51,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:40:51,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:51,417 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 18:40:51,418 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 18:40:51,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:51,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:51,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:51,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:51,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:51,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:51,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:51,436 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:51,441 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:40:51,441 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:40:51,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:51,443 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 18:40:51,444 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 18:40:51,445 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:51,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:40:51,463 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:51,463 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:51,463 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 18:40:51,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:51,470 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:51,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:51,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:51,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:51,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:51,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:51,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:51,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:51,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:51,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:51,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:51,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:51,501 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:51,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:51,503 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 18:40:51,503 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 18:40:51,549 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 18:40:51,549 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:51,551 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 18:40:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-04-26 18:40:51,552 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:40:51,552 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:51,552 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:40:51,552 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:51,552 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:40:51,552 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:51,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2484 states and 5805 transitions. [2025-04-26 18:40:51,566 INFO L131 ngComponentsAnalysis]: Automaton has 104 accepting balls. 249 [2025-04-26 18:40:51,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2484 states to 2047 states and 4795 transitions. [2025-04-26 18:40:51,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 659 [2025-04-26 18:40:51,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 759 [2025-04-26 18:40:51,580 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2047 states and 4795 transitions. [2025-04-26 18:40:51,580 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:51,580 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2047 states and 4795 transitions. [2025-04-26 18:40:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2047 states and 4795 transitions. [2025-04-26 18:40:51,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2047 to 1713. [2025-04-26 18:40:51,605 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 18:40:51,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 4184 transitions. [2025-04-26 18:40:51,609 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1713 states and 4184 transitions. [2025-04-26 18:40:51,609 INFO L438 stractBuchiCegarLoop]: Abstraction has 1713 states and 4184 transitions. [2025-04-26 18:40:51,609 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:40:51,609 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1713 states and 4184 transitions. [2025-04-26 18:40:51,616 INFO L131 ngComponentsAnalysis]: Automaton has 82 accepting balls. 205 [2025-04-26 18:40:51,616 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:51,616 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:51,616 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:51,616 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:51,616 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 18:40:51,616 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 18:40:51,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:51,617 INFO L85 PathProgramCache]: Analyzing trace with hash 184525265, now seen corresponding path program 2 times [2025-04-26 18:40:51,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:51,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631418898] [2025-04-26 18:40:51,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:51,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:51,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:51,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:51,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:51,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:51,621 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:51,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:51,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:51,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:51,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:51,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:51,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:51,625 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 3 times [2025-04-26 18:40:51,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:51,625 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332254551] [2025-04-26 18:40:51,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:40:51,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:51,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:51,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:51,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:40:51,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:51,627 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:51,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:51,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:51,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:51,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:51,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:51,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:51,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1235123635, now seen corresponding path program 2 times [2025-04-26 18:40:51,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:51,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39725582] [2025-04-26 18:40:51,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:51,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:51,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:51,640 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:51,640 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:51,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:51,640 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:51,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:51,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:51,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:51,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:51,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:51,777 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:51,777 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:51,777 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:51,777 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:51,777 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:51,777 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,777 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:51,777 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:51,777 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:40:51,777 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:51,777 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:51,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,784 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,794 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:51,909 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:51,909 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:51,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:51,914 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 18:40:51,914 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 18:40:51,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:51,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:51,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:51,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:51,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:51,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:51,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:51,932 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:51,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 18:40:51,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:51,940 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 18:40:51,941 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 18:40:51,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:51,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:51,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:51,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:51,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:51,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:51,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:51,955 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:51,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:40:51,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:51,963 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 18:40:51,963 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 18:40:51,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 18:40:51,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:51,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:51,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:51,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:51,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:51,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:51,988 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:51,994 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 18:40:51,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:51,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:51,996 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 18:40:51,996 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 18:40:51,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:52,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:52,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:52,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:52,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:52,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:52,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:52,011 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:52,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 18:40:52,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:52,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:52,017 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 18:40:52,019 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 18:40:52,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:52,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:52,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:52,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:52,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:52,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:52,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:52,032 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:52,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 18:40:52,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:52,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:52,039 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 18:40:52,040 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 18:40:52,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:52,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:52,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:52,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:52,051 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:52,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:52,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:52,054 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:52,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 18:40:52,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:52,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:52,061 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 18:40:52,062 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 18:40:52,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:52,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:52,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:52,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:52,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:52,074 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:52,074 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:52,076 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:52,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 18:40:52,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:52,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:52,085 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 18:40:52,085 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 18:40:52,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:52,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:52,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:52,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:52,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:52,098 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:52,098 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:52,103 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:52,109 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 18:40:52,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:52,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:52,111 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 18:40:52,112 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 18:40:52,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:52,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:52,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:52,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:52,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:52,126 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:52,126 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:52,130 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:52,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 18:40:52,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:52,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:52,137 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 18:40:52,138 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 18:40:52,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:52,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:52,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:52,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:52,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:52,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:52,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:52,155 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:52,161 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:40:52,161 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 18:40:52,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:52,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:52,163 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 18:40:52,163 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 18:40:52,164 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:52,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 18:40:52,180 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:52,180 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:52,180 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 18:40:52,185 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 18:40:52,186 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:52,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:52,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:52,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:52,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:52,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:52,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:52,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:52,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:52,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:52,222 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:52,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:52,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:52,226 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 18:40:52,226 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 18:40:52,291 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 18:40:52,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:52,293 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 18:40:52,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-26 18:40:52,294 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:40:52,294 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:52,294 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:40:52,294 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:52,294 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:40:52,294 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:52,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5316 states and 13085 transitions. [2025-04-26 18:40:52,324 INFO L131 ngComponentsAnalysis]: Automaton has 137 accepting balls. 315 [2025-04-26 18:40:52,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5316 states to 4067 states and 9917 transitions. [2025-04-26 18:40:52,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1119 [2025-04-26 18:40:52,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1265 [2025-04-26 18:40:52,349 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4067 states and 9917 transitions. [2025-04-26 18:40:52,349 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:52,349 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4067 states and 9917 transitions. [2025-04-26 18:40:52,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states and 9917 transitions. [2025-04-26 18:40:52,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 1975. [2025-04-26 18:40:52,388 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 18:40:52,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 4827 transitions. [2025-04-26 18:40:52,392 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1975 states and 4827 transitions. [2025-04-26 18:40:52,392 INFO L438 stractBuchiCegarLoop]: Abstraction has 1975 states and 4827 transitions. [2025-04-26 18:40:52,392 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:40:52,392 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1975 states and 4827 transitions. [2025-04-26 18:40:52,398 INFO L131 ngComponentsAnalysis]: Automaton has 87 accepting balls. 215 [2025-04-26 18:40:52,398 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:52,398 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:52,398 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:52,398 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:52,399 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 18:40:52,399 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 18:40:52,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:52,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1425268697, now seen corresponding path program 1 times [2025-04-26 18:40:52,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:52,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643250610] [2025-04-26 18:40:52,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:52,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:52,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:52,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:52,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,403 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:52,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:52,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:52,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:52,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:52,406 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 18:40:52,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:52,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446489903] [2025-04-26 18:40:52,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:52,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:52,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:52,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:52,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,410 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:52,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:52,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:52,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:52,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:52,417 INFO L85 PathProgramCache]: Analyzing trace with hash -411346373, now seen corresponding path program 1 times [2025-04-26 18:40:52,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:52,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537178422] [2025-04-26 18:40:52,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:52,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:52,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:52,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:52,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:52,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:52,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:52,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537178422] [2025-04-26 18:40:52,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537178422] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:52,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:52,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:40:52,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193480946] [2025-04-26 18:40:52,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:52,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:52,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:40:52,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:40:52,509 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 18:40:52,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:52,551 INFO L93 Difference]: Finished difference Result 2784 states and 6751 transitions. [2025-04-26 18:40:52,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2784 states and 6751 transitions. [2025-04-26 18:40:52,564 INFO L131 ngComponentsAnalysis]: Automaton has 119 accepting balls. 279 [2025-04-26 18:40:52,578 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2784 states to 2704 states and 6612 transitions. [2025-04-26 18:40:52,578 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 875 [2025-04-26 18:40:52,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 875 [2025-04-26 18:40:52,580 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2704 states and 6612 transitions. [2025-04-26 18:40:52,580 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:52,580 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2704 states and 6612 transitions. [2025-04-26 18:40:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states and 6612 transitions. [2025-04-26 18:40:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2643. [2025-04-26 18:40:52,617 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 18:40:52,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 6514 transitions. [2025-04-26 18:40:52,623 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2643 states and 6514 transitions. [2025-04-26 18:40:52,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:40:52,624 INFO L438 stractBuchiCegarLoop]: Abstraction has 2643 states and 6514 transitions. [2025-04-26 18:40:52,624 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:40:52,624 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2643 states and 6514 transitions. [2025-04-26 18:40:52,632 INFO L131 ngComponentsAnalysis]: Automaton has 109 accepting balls. 259 [2025-04-26 18:40:52,632 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:52,632 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:52,633 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:52,633 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:52,633 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 18:40:52,633 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 18:40:52,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:52,633 INFO L85 PathProgramCache]: Analyzing trace with hash 677649938, now seen corresponding path program 1 times [2025-04-26 18:40:52,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:52,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667815736] [2025-04-26 18:40:52,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:52,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:52,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:52,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:52,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:52,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:52,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:52,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:52,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:52,641 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 2 times [2025-04-26 18:40:52,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:52,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001800698] [2025-04-26 18:40:52,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:52,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:52,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:52,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:52,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:52,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,643 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:52,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:52,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:52,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:52,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:52,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1613435340, now seen corresponding path program 1 times [2025-04-26 18:40:52,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:52,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345085031] [2025-04-26 18:40:52,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:52,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:52,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:52,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:52,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,649 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:52,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:52,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:52,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:52,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:52,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:52,829 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:52,829 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:52,830 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:52,830 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:52,830 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:52,830 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:52,830 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:52,830 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:52,830 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 18:40:52,830 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:52,830 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:52,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:52,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,001 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:53,001 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:53,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,003 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 18:40:53,004 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 18:40:53,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:53,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:53,020 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:53,026 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 18:40:53,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,028 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 18:40:53,029 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 18:40:53,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 18:40:53,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:53,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:53,045 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:53,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:53,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,052 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 18:40:53,053 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 18:40:53,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 18:40:53,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,065 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:53,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:53,068 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:53,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 18:40:53,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,075 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 18:40:53,076 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 18:40:53,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:53,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:53,092 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:53,098 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 18:40:53,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,100 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 18:40:53,101 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 18:40:53,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:53,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:53,118 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:53,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:53,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,126 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 18:40:53,126 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 18:40:53,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:53,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:53,146 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:53,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:53,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,154 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 18:40:53,155 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 18:40:53,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:53,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:53,172 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:53,178 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:40:53,178 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:40:53,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,180 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 18:40:53,181 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 18:40:53,182 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:53,199 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 18:40:53,200 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:53,200 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:53,200 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 18:40:53,206 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 18:40:53,207 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:53,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:53,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:53,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:53,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:53,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:53,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:53,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:53,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:53,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:53,249 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:53,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:53,251 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 18:40:53,251 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 18:40:53,310 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 18:40:53,311 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:53,313 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 18:40:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-04-26 18:40:53,313 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:40:53,313 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:53,313 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:40:53,313 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:53,314 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:40:53,314 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:53,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6406 states and 15366 transitions. [2025-04-26 18:40:53,349 INFO L131 ngComponentsAnalysis]: Automaton has 157 accepting balls. 355 [2025-04-26 18:40:53,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6406 states to 4991 states and 12151 transitions. [2025-04-26 18:40:53,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1256 [2025-04-26 18:40:53,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1347 [2025-04-26 18:40:53,379 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4991 states and 12151 transitions. [2025-04-26 18:40:53,379 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:53,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4991 states and 12151 transitions. [2025-04-26 18:40:53,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states and 12151 transitions. [2025-04-26 18:40:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 4250. [2025-04-26 18:40:53,442 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 18:40:53,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 10505 transitions. [2025-04-26 18:40:53,485 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4250 states and 10505 transitions. [2025-04-26 18:40:53,485 INFO L438 stractBuchiCegarLoop]: Abstraction has 4250 states and 10505 transitions. [2025-04-26 18:40:53,485 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:40:53,485 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4250 states and 10505 transitions. [2025-04-26 18:40:53,497 INFO L131 ngComponentsAnalysis]: Automaton has 131 accepting balls. 303 [2025-04-26 18:40:53,497 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:53,497 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:53,498 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:53,498 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:53,498 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 18:40:53,498 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 18:40:53,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:53,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1235148616, now seen corresponding path program 1 times [2025-04-26 18:40:53,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:53,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383438182] [2025-04-26 18:40:53,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:53,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:53,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:53,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:53,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,503 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:53,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:53,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:53,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:53,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:53,510 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 3 times [2025-04-26 18:40:53,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:53,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416975954] [2025-04-26 18:40:53,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:40:53,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:53,511 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:53,516 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:53,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:40:53,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,516 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:53,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:53,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:53,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:53,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:53,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1566849514, now seen corresponding path program 1 times [2025-04-26 18:40:53,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:53,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162962281] [2025-04-26 18:40:53,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:53,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:53,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:53,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:53,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:53,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:53,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:53,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:53,687 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:53,687 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:53,687 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:53,687 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:53,687 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:53,688 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,688 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:53,688 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:53,688 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_petrified1_Iteration8_Lasso [2025-04-26 18:40:53,688 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:53,688 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:53,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,852 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:53,852 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:53,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,855 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 18:40:53,857 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 18:40:53,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:53,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:53,873 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:53,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:53,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,881 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 18:40:53,882 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 18:40:53,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:53,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:53,898 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:53,907 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 18:40:53,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,909 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 18:40:53,911 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 18:40:53,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:53,923 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:53,926 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:53,931 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 18:40:53,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,933 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 18:40:53,934 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 18:40:53,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,946 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,949 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:53,949 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:53,953 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:53,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:53,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,985 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 18:40:53,986 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 18:40:53,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:54,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:54,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:54,005 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:54,012 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:40:54,012 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:40:54,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:54,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:54,014 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 18:40:54,015 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 18:40:54,016 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:54,033 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 18:40:54,033 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:54,033 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:54,033 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 18:40:54,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:54,040 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:54,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:54,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:54,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:54,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:54,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:54,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:54,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:54,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:54,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:54,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:54,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:54,072 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:54,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:54,074 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 18:40:54,074 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 18:40:54,193 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 18:40:54,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:54,194 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 18:40:54,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-04-26 18:40:54,194 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:40:54,194 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:54,194 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:40:54,194 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:54,194 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 63 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:40:54,195 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:54,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14285 states and 35105 transitions. [2025-04-26 18:40:54,260 INFO L131 ngComponentsAnalysis]: Automaton has 247 accepting balls. 535 [2025-04-26 18:40:54,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14285 states to 11078 states and 26973 transitions. [2025-04-26 18:40:54,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2395 [2025-04-26 18:40:54,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2520 [2025-04-26 18:40:54,374 INFO L74 IsDeterministic]: Start isDeterministic. Operand 11078 states and 26973 transitions. [2025-04-26 18:40:54,374 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:54,374 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11078 states and 26973 transitions. [2025-04-26 18:40:54,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11078 states and 26973 transitions. [2025-04-26 18:40:54,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11078 to 5912. [2025-04-26 18:40:54,559 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 18:40:54,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5912 states to 5912 states and 14747 transitions. [2025-04-26 18:40:54,601 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5912 states and 14747 transitions. [2025-04-26 18:40:54,601 INFO L438 stractBuchiCegarLoop]: Abstraction has 5912 states and 14747 transitions. [2025-04-26 18:40:54,601 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:40:54,601 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5912 states and 14747 transitions. [2025-04-26 18:40:54,648 INFO L131 ngComponentsAnalysis]: Automaton has 153 accepting balls. 347 [2025-04-26 18:40:54,648 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:54,648 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:54,648 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:54,648 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:54,649 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 18:40:54,649 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 18:40:54,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:54,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1015832235, now seen corresponding path program 1 times [2025-04-26 18:40:54,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:54,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110206262] [2025-04-26 18:40:54,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:54,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:54,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:54,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:54,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:54,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:54,656 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:54,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:54,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:54,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:54,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:54,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:54,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:54,662 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 4 times [2025-04-26 18:40:54,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:54,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686819922] [2025-04-26 18:40:54,662 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:40:54,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:54,665 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-04-26 18:40:54,670 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 18:40:54,670 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:40:54,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:54,670 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:54,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:54,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:54,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:54,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:54,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:54,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:54,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1257198537, now seen corresponding path program 1 times [2025-04-26 18:40:54,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:54,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340930572] [2025-04-26 18:40:54,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:54,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:54,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:40:54,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:40:54,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:54,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:54,705 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:54,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:40:54,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:40:54,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:54,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:54,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:54,916 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:54,917 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:54,917 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:54,917 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:54,917 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:54,917 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:54,917 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:54,917 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:54,917 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_petrified1_Iteration9_Lasso [2025-04-26 18:40:54,917 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:54,917 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:54,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:54,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:54,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:54,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:54,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:54,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:54,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:54,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:54,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:54,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:54,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:55,070 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:55,070 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:55,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:55,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:55,072 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 18:40:55,073 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 18:40:55,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:55,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:55,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:55,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:55,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:55,085 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:55,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:55,087 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:55,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:55,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:55,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:55,095 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 18:40:55,095 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 18:40:55,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:55,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:55,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:55,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:55,106 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:55,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:55,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:55,110 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:55,115 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 18:40:55,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:55,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:55,133 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 18:40:55,133 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 18:40:55,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:55,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:55,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:55,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:55,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:55,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:55,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:55,148 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:55,156 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 18:40:55,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:55,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:55,158 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 18:40:55,159 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 18:40:55,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:55,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:55,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:55,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:55,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:55,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:55,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:55,175 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:55,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:55,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:55,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:55,184 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 18:40:55,184 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 18:40:55,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:55,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:55,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:55,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:55,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:55,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:55,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:55,202 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:55,209 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 18:40:55,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:55,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:55,211 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 18:40:55,213 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 18:40:55,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:55,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:55,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:55,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:55,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:55,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:55,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:55,229 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:55,235 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 18:40:55,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:55,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:55,237 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 18:40:55,238 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 18:40:55,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:55,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:55,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:55,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:55,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:55,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:55,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:55,253 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:55,258 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 18:40:55,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:55,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:55,260 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 18:40:55,260 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 18:40:55,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:55,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:55,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:55,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:55,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:55,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:55,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:55,275 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:55,280 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 18:40:55,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:55,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:55,282 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 18:40:55,283 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 18:40:55,288 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:55,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:55,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:55,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:55,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:55,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:55,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:55,307 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:55,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:55,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:55,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:55,314 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 18:40:55,315 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 18:40:55,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:55,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:55,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:55,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:55,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:55,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:55,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:55,332 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:55,337 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:40:55,337 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:40:55,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:55,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:55,339 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 18:40:55,340 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 18:40:55,340 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:55,356 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 18:40:55,356 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:55,356 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:55,356 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 18:40:55,361 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 18:40:55,363 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:40:55,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:55,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:55,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:55,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:55,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:55,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:55,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:55,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:55,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:55,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:55,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:55,395 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:55,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:55,398 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 18:40:55,398 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 18:40:55,509 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 18:40:55,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:55,510 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 18:40:55,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-04-26 18:40:55,511 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:40:55,511 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:55,511 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:40:55,519 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:55,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:55,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:55,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:55,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:55,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:55,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:55,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:55,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:55,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:55,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:55,544 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:55,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:55,546 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 18:40:55,546 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 18:40:55,605 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 18:40:55,605 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:55,606 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 18:40:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-04-26 18:40:55,606 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:40:55,607 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:55,607 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:40:55,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:55,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:40:55,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:40:55,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:55,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:55,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:55,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:55,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:55,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:55,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:55,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:55,637 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:55,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:55,640 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 18:40:55,640 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 18:40:55,733 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 18:40:55,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:55,734 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 18:40:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2025-04-26 18:40:55,734 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 72 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:40:55,734 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:55,734 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 72 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:40:55,734 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:55,734 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 72 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 18:40:55,735 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:55,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13406 states and 32814 transitions. [2025-04-26 18:40:55,839 INFO L131 ngComponentsAnalysis]: Automaton has 53 accepting balls. 106 [2025-04-26 18:40:55,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13406 states to 6599 states and 16138 transitions. [2025-04-26 18:40:55,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1183 [2025-04-26 18:40:55,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1327 [2025-04-26 18:40:55,869 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6599 states and 16138 transitions. [2025-04-26 18:40:55,869 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:55,869 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6599 states and 16138 transitions. [2025-04-26 18:40:55,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6599 states and 16138 transitions. [2025-04-26 18:40:55,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6599 to 3103. [2025-04-26 18:40:55,925 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 18:40:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3103 states to 3103 states and 7514 transitions. [2025-04-26 18:40:55,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3103 states and 7514 transitions. [2025-04-26 18:40:55,932 INFO L438 stractBuchiCegarLoop]: Abstraction has 3103 states and 7514 transitions. [2025-04-26 18:40:55,932 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 18:40:55,932 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3103 states and 7514 transitions. [2025-04-26 18:40:55,938 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 60 [2025-04-26 18:40:55,939 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:55,939 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:55,939 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:55,939 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:55,939 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 18:40:55,939 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 18:40:55,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1523105999, now seen corresponding path program 1 times [2025-04-26 18:40:55,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:55,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550897840] [2025-04-26 18:40:55,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:55,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:55,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:40:55,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:40:55,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:55,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:55,944 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:55,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:40:55,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:40:55,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:55,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:55,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:55,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:55,948 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 4 times [2025-04-26 18:40:55,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:55,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119187580] [2025-04-26 18:40:55,948 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:40:55,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:55,950 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-04-26 18:40:55,951 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 18:40:55,951 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:40:55,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:55,951 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:55,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:55,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:55,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:55,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:55,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:55,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:55,953 INFO L85 PathProgramCache]: Analyzing trace with hash -878979663, now seen corresponding path program 1 times [2025-04-26 18:40:55,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:55,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801256339] [2025-04-26 18:40:55,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:55,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:55,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:55,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:55,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:55,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:55,957 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:55,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:40:55,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:40:55,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:55,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:55,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:56,167 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:56,167 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:56,167 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:56,167 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:56,168 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:56,168 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:56,168 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:56,168 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:56,168 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_petrified1_Iteration10_Lasso [2025-04-26 18:40:56,168 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:56,168 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:56,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,208 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:56,378 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:56,379 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:56,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:56,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:56,381 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 18:40:56,382 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 18:40:56,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:56,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:56,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:56,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:56,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:56,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:56,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:56,397 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:56,403 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 18:40:56,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:56,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:56,405 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 18:40:56,406 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 18:40:56,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:56,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:56,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:56,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:56,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:56,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:56,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:56,420 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:56,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:56,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:56,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:56,429 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 18:40:56,429 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 18:40:56,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 18:40:56,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:56,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:56,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:56,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:56,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:56,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:56,444 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:56,449 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 18:40:56,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:56,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:56,451 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 18:40:56,453 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 18:40:56,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:56,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:56,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:56,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:56,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:56,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:56,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:56,470 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:56,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:56,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:56,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:56,477 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 18:40:56,477 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 18:40:56,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:56,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:56,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:56,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:56,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:56,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:56,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:56,492 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:56,497 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 18:40:56,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:56,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:56,499 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 18:40:56,500 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 18:40:56,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:56,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:56,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:56,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:56,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:56,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:56,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:56,513 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:56,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:56,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:56,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:56,520 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 18:40:56,521 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 18:40:56,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 18:40:56,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:56,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:56,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:56,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:56,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:56,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:56,536 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:56,547 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:40:56,547 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:40:56,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:56,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:56,549 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 18:40:56,550 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 18:40:56,550 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:56,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-04-26 18:40:56,566 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:40:56,566 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:56,566 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 18:40:56,571 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 18:40:56,578 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 18:40:56,586 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:56,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:40:56,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:40:56,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:56,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:56,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:56,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:56,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:56,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:56,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:56,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:56,610 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:56,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:56,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:56,612 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 18:40:56,612 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 18:40:56,654 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 18:40:56,655 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:56,656 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 18:40:56,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-04-26 18:40:56,656 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:40:56,656 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:56,656 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:40:56,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:56,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:40:56,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:40:56,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:56,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:56,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:56,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:56,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:56,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:56,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:56,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:56,689 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:56,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:56,690 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 18:40:56,691 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 18:40:56,727 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 18:40:56,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:56,728 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 18:40:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-04-26 18:40:56,728 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:40:56,728 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:56,728 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:40:56,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:56,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:40:56,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:40:56,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:56,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:56,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:56,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:56,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:56,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:56,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:56,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:56,758 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:56,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:56,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:56,763 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 18:40:56,763 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 18:40:56,813 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 18:40:56,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:56,813 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 18:40:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-04-26 18:40:56,814 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 62 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:40:56,814 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:56,814 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 62 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:40:56,814 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:56,814 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 62 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 18:40:56,814 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:56,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7236 states and 17212 transitions. [2025-04-26 18:40:56,841 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:56,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7236 states to 0 states and 0 transitions. [2025-04-26 18:40:56,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:56,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:56,841 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:56,841 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:56,842 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:56,842 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:56,842 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:56,842 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 18:40:56,842 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:40:56,842 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:56,842 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:40:56,852 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 18:40:56,853 INFO L201 PluginConnector]: Adding new model buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:56 BoogieIcfgContainer [2025-04-26 18:40:56,853 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:56,854 INFO L158 Benchmark]: Toolchain (without parser) took 8538.19ms. Allocated memory was 159.4MB in the beginning and 343.9MB in the end (delta: 184.5MB). Free memory was 88.1MB in the beginning and 92.7MB in the end (delta: -4.6MB). Peak memory consumption was 185.7MB. Max. memory is 8.0GB. [2025-04-26 18:40:56,854 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.31ms. Allocated memory is still 159.4MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:56,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.47ms. Allocated memory is still 159.4MB. Free memory was 88.0MB in the beginning and 86.2MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:40:56,854 INFO L158 Benchmark]: Boogie Preprocessor took 28.40ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 85.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:56,854 INFO L158 Benchmark]: RCFGBuilder took 207.45ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 74.3MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:40:56,855 INFO L158 Benchmark]: BuchiAutomizer took 8265.78ms. Allocated memory was 159.4MB in the beginning and 343.9MB in the end (delta: 184.5MB). Free memory was 74.1MB in the beginning and 92.7MB in the end (delta: -18.5MB). Peak memory consumption was 168.9MB. Max. memory is 8.0GB. [2025-04-26 18:40:56,855 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.31ms. Allocated memory is still 159.4MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.47ms. Allocated memory is still 159.4MB. Free memory was 88.0MB in the beginning and 86.2MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.40ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 85.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 207.45ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 74.3MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 8265.78ms. Allocated memory was 159.4MB in the beginning and 343.9MB in the end (delta: 184.5MB). Free memory was 74.1MB in the beginning and 92.7MB in the end (delta: -18.5MB). Peak memory consumption was 168.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.1s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 4.9s. Construction of modules took 0.2s. Büchi inclusion checks took 1.2s. 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, 560 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 548 mSDsluCounter, 464 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 433 IncrementalHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 299 mSDtfsCounter, 433 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: 36ms 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.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 389, 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 18:40:56,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...