/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-series.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:55:30,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:55:30,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:55:30,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:55:30,059 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:55:30,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:55:30,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:55:30,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:55:30,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:55:30,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:55:30,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:55:30,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:55:30,085 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:55:30,085 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:55:30,085 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:55:30,085 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:55:30,085 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:55:30,086 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:55:30,086 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:55:30,086 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:55:30,086 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:55:30,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:55:30,086 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:55:30,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:55:30,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:55:30,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:55:30,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:55:30,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:55:30,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:55:30,086 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:55:30,086 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:55:30,086 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:55:30,086 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:55:30,086 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:55:30,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:55:30,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:30,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:55:30,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:55:30,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:55:30,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:55:30,087 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:55:30,087 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:55:30,087 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:55:30,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:55:30,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:55:30,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:55:30,319 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:55:30,320 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:55:30,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-series.wvr.bpl [2025-04-26 16:55:30,322 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-series.wvr.bpl' [2025-04-26 16:55:30,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:55:30,336 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:55:30,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:30,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:55:30,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:55:30,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:30" (1/1) ... [2025-04-26 16:55:30,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:30" (1/1) ... [2025-04-26 16:55:30,364 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:55:30,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:30,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:55:30,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:55:30,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:55:30,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:30" (1/1) ... [2025-04-26 16:55:30,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:30" (1/1) ... [2025-04-26 16:55:30,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:30" (1/1) ... [2025-04-26 16:55:30,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:30" (1/1) ... [2025-04-26 16:55:30,372 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:30" (1/1) ... [2025-04-26 16:55:30,372 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:30" (1/1) ... [2025-04-26 16:55:30,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:30" (1/1) ... [2025-04-26 16:55:30,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:30" (1/1) ... [2025-04-26 16:55:30,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:30" (1/1) ... [2025-04-26 16:55:30,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:55:30,383 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:55:30,383 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:55:30,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:55:30,384 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:30" (1/1) ... [2025-04-26 16:55:30,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:30,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:30,405 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:30,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:55:30,423 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:55:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:55:30,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:55:30,423 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:55:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:55:30,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:55:30,423 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:55:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:55:30,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:55:30,423 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:55:30,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:55:30,423 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:55:30,424 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:55:30,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:55:30,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:55:30,424 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:55:30,461 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:55:30,463 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:55:30,536 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:55:30,537 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:55:30,560 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:55:30,560 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:55:30,560 INFO L201 PluginConnector]: Adding new model buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:30 BoogieIcfgContainer [2025-04-26 16:55:30,560 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:55:30,561 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:55:30,561 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:55:30,565 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:55:30,565 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:30,565 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:30" (1/2) ... [2025-04-26 16:55:30,566 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5205765b and model type buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:55:30, skipping insertion in model container [2025-04-26 16:55:30,566 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:30,566 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:30" (2/2) ... [2025-04-26 16:55:30,567 INFO L376 chiAutomizerObserver]: Analyzing ICFG buffer-series.wvr.bpl [2025-04-26 16:55:30,605 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:55:30,634 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:55:30,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:55:30,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:30,636 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:30,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:55:30,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 106 flow [2025-04-26 16:55:30,706 INFO L116 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-04-26 16:55:30,708 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:55:30,711 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 7. Compared 54 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-26 16:55:30,711 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 106 flow [2025-04-26 16:55:30,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2025-04-26 16:55:30,714 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 40 places, 31 transitions, 86 flow [2025-04-26 16:55:30,719 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:55:30,926 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 511#[L49-1, L25, thread2EXIT, L75]true [2025-04-26 16:55:31,012 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1135#[L25-1, L37, L76, L61-1, L49]true [2025-04-26 16:55:31,013 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1145#[L49, L25, L37-1, L76, L61-1]true [2025-04-26 16:55:31,014 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 689#[L25-1, L49-1, L37-1, L75]true [2025-04-26 16:55:31,014 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 683#[L37, L49-1, L25, L75]true [2025-04-26 16:55:31,016 WARN L140 AmpleReduction]: Number of pruned transitions: 947 [2025-04-26 16:55:31,017 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 5 [2025-04-26 16:55:31,017 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 168 [2025-04-26 16:55:31,018 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:47 [2025-04-26 16:55:31,018 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:381 [2025-04-26 16:55:31,018 WARN L145 AmpleReduction]: Times succ was already a loop node:238 [2025-04-26 16:55:31,018 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:212 [2025-04-26 16:55:31,018 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:55:31,022 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 592 states, 590 states have (on average 2.183050847457627) internal successors, (in total 1288), 591 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:31,028 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:55:31,028 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:55:31,028 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:55:31,028 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:55:31,028 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:55:31,028 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:55:31,028 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:55:31,028 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:55:31,031 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 592 states, 590 states have (on average 2.183050847457627) internal successors, (in total 1288), 591 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:31,065 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 489 [2025-04-26 16:55:31,066 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:31,066 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:31,072 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:55:31,073 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:31,073 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:55:31,074 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 592 states, 590 states have (on average 2.183050847457627) internal successors, (in total 1288), 591 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:31,083 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 489 [2025-04-26 16:55:31,084 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:31,084 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:31,084 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:55:31,084 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:31,089 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_6 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (= v_j_6 0) (<= 0 v_N_5) (= v_total_1 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:55:31,089 INFO L754 eck$LassoCheckResult]: Loop: "[87] L24-->L25: 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] L25-->L25-1: Formula: (and (= (select v_q1_3 v_q1_back_9) (select v_f_3 v_i_9)) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, i=v_i_9, f=v_f_3, q1_back=v_q1_back_9} OutVars{q1=v_q1_3, i=v_i_9, f=v_f_3, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_back]" "[90] L25-1-->L24: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" [2025-04-26 16:55:31,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:31,093 INFO L85 PathProgramCache]: Analyzing trace with hash 3578, now seen corresponding path program 1 times [2025-04-26 16:55:31,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:31,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552135055] [2025-04-26 16:55:31,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:31,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:31,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:31,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:31,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,143 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:31,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:31,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:31,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:31,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:31,160 INFO L85 PathProgramCache]: Analyzing trace with hash 116247, now seen corresponding path program 1 times [2025-04-26 16:55:31,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:31,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377282846] [2025-04-26 16:55:31,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:31,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:31,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:31,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:31,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:31,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:31,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:31,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:31,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:31,181 INFO L85 PathProgramCache]: Analyzing trace with hash 106678654, now seen corresponding path program 1 times [2025-04-26 16:55:31,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:31,181 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852066803] [2025-04-26 16:55:31,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:31,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:31,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:31,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:31,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,193 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:31,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:55:31,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:55:31,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:31,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:31,358 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:31,363 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:31,364 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:31,364 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:31,364 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:31,364 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,364 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:31,364 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:31,364 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-series.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:55:31,364 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:31,364 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:31,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:31,545 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:31,548 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:31,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:31,551 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:31,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:55:31,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:31,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:31,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:31,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:31,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:31,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:31,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:31,584 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:31,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:31,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:31,593 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:31,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:55:31,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:31,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:31,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:31,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:31,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:31,612 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:31,612 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:31,619 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:31,632 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:55:31,633 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:55:31,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:31,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:31,636 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:31,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:55:31,639 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:31,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:55:31,656 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:31,656 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:31,656 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 16:55:31,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:31,664 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:31,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:31,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:31,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:31,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:31,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:31,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:31,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:31,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:31,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:31,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:31,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:31,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:31,743 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:55:31,746 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 592 states, 590 states have (on average 2.183050847457627) internal successors, (in total 1288), 591 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:31,888 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 592 states, 590 states have (on average 2.183050847457627) internal successors, (in total 1288), 591 states have internal predecessors, (1288), 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 1604 states and 3454 transitions. Complement of second has 7 states. [2025-04-26 16:55:31,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:31,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2025-04-26 16:55:31,898 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:55:31,898 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:31,898 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:55:31,898 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:31,899 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:55:31,899 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:31,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1604 states and 3454 transitions. [2025-04-26 16:55:31,916 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 306 [2025-04-26 16:55:31,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1604 states to 789 states and 1710 transitions. [2025-04-26 16:55:31,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 373 [2025-04-26 16:55:31,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 497 [2025-04-26 16:55:31,934 INFO L74 IsDeterministic]: Start isDeterministic. Operand 789 states and 1710 transitions. [2025-04-26 16:55:31,934 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:31,934 INFO L218 hiAutomatonCegarLoop]: Abstraction has 789 states and 1710 transitions. [2025-04-26 16:55:31,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states and 1710 transitions. [2025-04-26 16:55:31,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 701. [2025-04-26 16:55:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 701 states have (on average 2.172610556348074) internal successors, (in total 1523), 700 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:31,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1523 transitions. [2025-04-26 16:55:31,996 INFO L240 hiAutomatonCegarLoop]: Abstraction has 701 states and 1523 transitions. [2025-04-26 16:55:31,996 INFO L438 stractBuchiCegarLoop]: Abstraction has 701 states and 1523 transitions. [2025-04-26 16:55:31,996 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:55:31,996 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 701 states and 1523 transitions. [2025-04-26 16:55:32,000 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 306 [2025-04-26 16:55:32,000 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:32,000 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:32,000 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:55:32,000 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:55:32,001 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_6 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (= v_j_6 0) (<= 0 v_N_5) (= v_total_1 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L24-->L25: 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] L73-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:55:32,001 INFO L754 eck$LassoCheckResult]: Loop: "[92] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[94] L37-->L37-1: Formula: (and (= (+ v_q2_back_9 1) v_q2_back_8) (= (+ (select v_q2_3 v_q2_back_9) (select v_f_5 v_j_9)) 0)) InVars {q2=v_q2_3, f=v_f_5, q2_back=v_q2_back_9, j=v_j_9} OutVars{q2=v_q2_3, f=v_f_5, q2_back=v_q2_back_8, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[95] L37-1-->L36: Formula: (= v_j_4 (+ v_j_5 1)) InVars {j=v_j_5} OutVars{j=v_j_4} AuxVars[] AssignedVars[j]" [2025-04-26 16:55:32,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,001 INFO L85 PathProgramCache]: Analyzing trace with hash 3441264, now seen corresponding path program 1 times [2025-04-26 16:55:32,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:32,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438349202] [2025-04-26 16:55:32,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:32,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:32,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:32,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:32,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:32,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:32,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:32,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:32,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,018 INFO L85 PathProgramCache]: Analyzing trace with hash 121212, now seen corresponding path program 1 times [2025-04-26 16:55:32,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:32,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196643370] [2025-04-26 16:55:32,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:32,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:32,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:32,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:32,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,026 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:32,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:32,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:32,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:32,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,038 INFO L85 PathProgramCache]: Analyzing trace with hash -560427859, now seen corresponding path program 1 times [2025-04-26 16:55:32,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:32,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41691416] [2025-04-26 16:55:32,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:32,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:32,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:32,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:32,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,047 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:32,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:32,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:32,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:32,133 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:32,133 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:32,133 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:32,133 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:32,133 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:32,134 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:32,134 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:32,134 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:32,134 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-series.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:55:32,134 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:32,134 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:32,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:32,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:32,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:32,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:32,157 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:32,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:32,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:32,242 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:32,242 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:32,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:32,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:32,246 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:32,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:55:32,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:32,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:32,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:32,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:32,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:32,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:32,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:32,263 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:32,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:32,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:32,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:32,271 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:32,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:55:32,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:32,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:32,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:32,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:32,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:32,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:32,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:32,289 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:32,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:32,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:32,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:32,298 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:32,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:55:32,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:32,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:32,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:32,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:32,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:32,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:32,312 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:32,318 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:32,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:55:32,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:32,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:32,326 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:32,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:55:32,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:32,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:32,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:32,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:32,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:32,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:32,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:32,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:32,342 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:32,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:32,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:32,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:32,352 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:32,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:55:32,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:32,364 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:32,364 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:32,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:32,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:32,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:32,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:32,370 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:32,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:32,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:32,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:32,378 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:32,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:55:32,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:32,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:32,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:32,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:32,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:32,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:32,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:32,398 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:32,406 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:55:32,406 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:55:32,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:32,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:32,409 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:32,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:55:32,411 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:32,428 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 16:55:32,428 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:32,428 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:32,428 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(j, N) = -1*j + 1*N Supporting invariants [] [2025-04-26 16:55:32,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:32,435 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:32,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:55:32,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:55:32,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:32,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:32,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:32,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:55:32,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:55:32,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:32,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:32,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:32,506 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:55:32,506 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 701 states and 1523 transitions. cyclomatic complexity: 933 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:32,590 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 701 states and 1523 transitions. cyclomatic complexity: 933. 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 1845 states and 3949 transitions. Complement of second has 7 states. [2025-04-26 16:55:32,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:32,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-04-26 16:55:32,592 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:55:32,592 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:32,592 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:55:32,592 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:32,592 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:55:32,592 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:32,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1845 states and 3949 transitions. [2025-04-26 16:55:32,604 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 180 [2025-04-26 16:55:32,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1845 states to 1027 states and 2213 transitions. [2025-04-26 16:55:32,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 358 [2025-04-26 16:55:32,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 444 [2025-04-26 16:55:32,611 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1027 states and 2213 transitions. [2025-04-26 16:55:32,612 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:32,612 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1027 states and 2213 transitions. [2025-04-26 16:55:32,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states and 2213 transitions. [2025-04-26 16:55:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 956. [2025-04-26 16:55:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 956 states have (on average 2.1841004184100417) internal successors, (in total 2088), 955 states have internal predecessors, (2088), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:32,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2088 transitions. [2025-04-26 16:55:32,640 INFO L240 hiAutomatonCegarLoop]: Abstraction has 956 states and 2088 transitions. [2025-04-26 16:55:32,640 INFO L438 stractBuchiCegarLoop]: Abstraction has 956 states and 2088 transitions. [2025-04-26 16:55:32,640 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:55:32,640 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 956 states and 2088 transitions. [2025-04-26 16:55:32,643 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 180 [2025-04-26 16:55:32,643 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:32,643 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:32,644 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:55:32,644 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:32,644 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_6 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (= v_j_6 0) (<= 0 v_N_5) (= v_total_1 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L24-->L25: 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] L73-1-->L36: 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] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:55:32,644 INFO L754 eck$LassoCheckResult]: Loop: "[97] L49-1-->L49: Formula: (or (< v_i_7 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[]" "[99] L49-->L49-1: Formula: (and (= (+ (select v_q1_7 v_q1_front_13) v_total_12) v_total_11) (= (+ v_q1_front_13 1) v_q1_front_12) (< v_q1_front_13 v_q1_back_12)) InVars {q1_front=v_q1_front_13, q1=v_q1_7, total=v_total_12, q1_back=v_q1_back_12} OutVars{q1_front=v_q1_front_12, q1=v_q1_7, total=v_total_11, q1_back=v_q1_back_12} AuxVars[] AssignedVars[q1_front, total]" [2025-04-26 16:55:32,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,645 INFO L85 PathProgramCache]: Analyzing trace with hash -987909628, now seen corresponding path program 1 times [2025-04-26 16:55:32,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:32,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776724815] [2025-04-26 16:55:32,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:32,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:32,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:32,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:32,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,652 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:32,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:32,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:32,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:32,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,661 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 16:55:32,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:32,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53339593] [2025-04-26 16:55:32,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:32,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:32,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:32,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:32,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,665 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:32,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:32,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:32,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,667 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:32,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,668 INFO L85 PathProgramCache]: Analyzing trace with hash -193376986, now seen corresponding path program 1 times [2025-04-26 16:55:32,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:32,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510587312] [2025-04-26 16:55:32,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:32,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:32,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:32,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:32,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:32,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:32,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510587312] [2025-04-26 16:55:32,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510587312] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:32,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:32,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:55:32,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638478302] [2025-04-26 16:55:32,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:32,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:32,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:55:32,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:55:32,736 INFO L87 Difference]: Start difference. First operand 956 states and 2088 transitions. cyclomatic complexity: 1268 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (in total 8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:32,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:32,767 INFO L93 Difference]: Finished difference Result 1136 states and 2450 transitions. [2025-04-26 16:55:32,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1136 states and 2450 transitions. [2025-04-26 16:55:32,773 INFO L131 ngComponentsAnalysis]: Automaton has 83 accepting balls. 206 [2025-04-26 16:55:32,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1136 states to 1118 states and 2423 transitions. [2025-04-26 16:55:32,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 443 [2025-04-26 16:55:32,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 443 [2025-04-26 16:55:32,780 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1118 states and 2423 transitions. [2025-04-26 16:55:32,780 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:32,780 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1118 states and 2423 transitions. [2025-04-26 16:55:32,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states and 2423 transitions. [2025-04-26 16:55:32,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1078. [2025-04-26 16:55:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1078 states have (on average 2.1929499072356213) internal successors, (in total 2364), 1077 states have internal predecessors, (2364), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:32,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 2364 transitions. [2025-04-26 16:55:32,808 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1078 states and 2364 transitions. [2025-04-26 16:55:32,808 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:55:32,809 INFO L438 stractBuchiCegarLoop]: Abstraction has 1078 states and 2364 transitions. [2025-04-26 16:55:32,809 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:55:32,809 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1078 states and 2364 transitions. [2025-04-26 16:55:32,812 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 192 [2025-04-26 16:55:32,812 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:32,812 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:32,813 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:32,813 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:32,813 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_6 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (= v_j_6 0) (<= 0 v_N_5) (= v_total_1 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L24-->L25: 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] L25-->L25-1: Formula: (and (= (select v_q1_3 v_q1_back_9) (select v_f_3 v_i_9)) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, i=v_i_9, f=v_f_3, q1_back=v_q1_back_9} OutVars{q1=v_q1_3, i=v_i_9, f=v_f_3, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_back]" "[109] L73-1-->L36: 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] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L74-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:55:32,813 INFO L754 eck$LassoCheckResult]: Loop: "[97] L49-1-->L49: Formula: (or (< v_i_7 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[]" "[99] L49-->L49-1: Formula: (and (= (+ (select v_q1_7 v_q1_front_13) v_total_12) v_total_11) (= (+ v_q1_front_13 1) v_q1_front_12) (< v_q1_front_13 v_q1_back_12)) InVars {q1_front=v_q1_front_13, q1=v_q1_7, total=v_total_12, q1_back=v_q1_back_12} OutVars{q1_front=v_q1_front_12, q1=v_q1_7, total=v_total_11, q1_back=v_q1_back_12} AuxVars[] AssignedVars[q1_front, total]" [2025-04-26 16:55:32,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,813 INFO L85 PathProgramCache]: Analyzing trace with hash -561007387, now seen corresponding path program 1 times [2025-04-26 16:55:32,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:32,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229109205] [2025-04-26 16:55:32,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:32,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:32,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:32,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:32,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:32,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:32,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:32,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:32,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,826 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 2 times [2025-04-26 16:55:32,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:32,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977857829] [2025-04-26 16:55:32,827 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:32,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:32,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:32,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:32,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:32,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,833 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:32,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:32,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:32,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:32,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:32,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2037783495, now seen corresponding path program 1 times [2025-04-26 16:55:32,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:32,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908414752] [2025-04-26 16:55:32,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:32,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:32,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:32,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:32,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,848 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:32,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:32,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:32,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:32,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:32,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:33,004 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:33,004 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:33,004 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:33,004 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:33,004 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:33,004 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,004 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:33,004 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:33,005 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-series.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:55:33,005 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:33,005 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:33,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,020 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,145 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:33,146 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:33,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:33,148 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:33,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:55:33,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:33,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:33,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:33,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:33,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:33,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:33,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:33,164 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:33,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:33,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:33,172 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:33,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:55:33,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:33,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:33,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:33,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:33,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:33,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:33,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:33,188 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:33,194 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 16:55:33,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:33,196 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:33,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:55:33,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:33,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:33,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:33,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:33,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:33,210 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:33,210 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:33,213 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:33,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:33,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:33,221 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:33,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:55:33,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:33,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:33,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:33,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:33,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:33,235 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:33,235 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:33,237 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:33,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:33,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:33,245 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:33,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:55:33,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:33,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:33,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:33,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:33,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:33,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:33,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:33,262 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:33,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:33,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:33,269 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:33,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:55:33,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:33,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:33,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:33,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:33,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:33,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:33,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:33,286 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:33,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:33,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:33,293 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:33,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:55:33,295 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:33,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:33,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:33,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:33,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:33,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:33,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:33,310 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:33,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:55:33,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:33,318 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:33,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:55:33,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:33,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:33,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:33,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:33,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:33,331 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:33,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:33,333 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:33,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:55:33,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:33,341 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:33,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:55:33,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:33,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:33,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:33,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:33,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:33,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:33,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:33,360 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:33,365 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 16:55:33,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:33,368 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:33,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:55:33,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:33,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:33,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:33,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:33,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:33,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:33,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:33,387 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:33,395 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:55:33,395 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:55:33,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:33,397 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:33,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:55:33,399 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:33,415 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 16:55:33,415 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:33,415 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:33,415 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 16:55:33,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:33,422 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:33,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:33,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:33,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:33,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:33,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:33,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:33,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:33,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:33,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:33,455 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:33,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:33,461 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:33,462 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1078 states and 2364 transitions. cyclomatic complexity: 1442 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:33,513 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1078 states and 2364 transitions. cyclomatic complexity: 1442. 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 2974 states and 6628 transitions. Complement of second has 5 states. [2025-04-26 16:55:33,513 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:33,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-04-26 16:55:33,514 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:55:33,514 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:33,514 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:55:33,515 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:33,515 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:55:33,515 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:33,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2974 states and 6628 transitions. [2025-04-26 16:55:33,533 INFO L131 ngComponentsAnalysis]: Automaton has 106 accepting balls. 252 [2025-04-26 16:55:33,546 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2974 states to 2344 states and 5244 transitions. [2025-04-26 16:55:33,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 710 [2025-04-26 16:55:33,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 810 [2025-04-26 16:55:33,548 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2344 states and 5244 transitions. [2025-04-26 16:55:33,548 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:33,549 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2344 states and 5244 transitions. [2025-04-26 16:55:33,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states and 5244 transitions. [2025-04-26 16:55:33,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 1970. [2025-04-26 16:55:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1970 states, 1970 states have (on average 2.3203045685279187) internal successors, (in total 4571), 1969 states have internal predecessors, (4571), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 4571 transitions. [2025-04-26 16:55:33,584 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1970 states and 4571 transitions. [2025-04-26 16:55:33,584 INFO L438 stractBuchiCegarLoop]: Abstraction has 1970 states and 4571 transitions. [2025-04-26 16:55:33,584 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:55:33,584 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1970 states and 4571 transitions. [2025-04-26 16:55:33,591 INFO L131 ngComponentsAnalysis]: Automaton has 83 accepting balls. 206 [2025-04-26 16:55:33,591 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:33,591 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:33,591 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:33,591 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:33,592 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_6 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (= v_j_6 0) (<= 0 v_N_5) (= v_total_1 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L24-->L25: 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] L73-1-->L36: 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] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L74-->L49-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] L75-->L61-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 16:55:33,592 INFO L754 eck$LassoCheckResult]: Loop: "[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_7 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_7, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_7, q2_back=v_q2_back_5} AuxVars[] AssignedVars[]" "[103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front]" [2025-04-26 16:55:33,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:33,592 INFO L85 PathProgramCache]: Analyzing trace with hash -560427281, now seen corresponding path program 1 times [2025-04-26 16:55:33,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:33,592 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355803830] [2025-04-26 16:55:33,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:33,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:33,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:33,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:33,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:33,596 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:33,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:33,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:33,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:33,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:33,599 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:33,599 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 16:55:33,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:33,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142396284] [2025-04-26 16:55:33,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:33,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:33,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:33,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:33,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:33,603 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:33,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:33,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:33,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:33,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:33,605 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:33,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1699701807, now seen corresponding path program 1 times [2025-04-26 16:55:33,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:33,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405106829] [2025-04-26 16:55:33,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:33,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:33,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:33,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:33,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:33,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:55:33,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405106829] [2025-04-26 16:55:33,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405106829] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:55:33,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:55:33,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:55:33,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758255424] [2025-04-26 16:55:33,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:55:33,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:55:33,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:55:33,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:55:33,687 INFO L87 Difference]: Start difference. First operand 1970 states and 4571 transitions. cyclomatic complexity: 2862 Second operand has 3 states, 2 states have (on average 4.5) internal successors, (in total 9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:33,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:55:33,725 INFO L93 Difference]: Finished difference Result 2641 states and 6085 transitions. [2025-04-26 16:55:33,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2641 states and 6085 transitions. [2025-04-26 16:55:33,739 INFO L131 ngComponentsAnalysis]: Automaton has 117 accepting balls. 274 [2025-04-26 16:55:33,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2641 states to 2522 states and 5870 transitions. [2025-04-26 16:55:33,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 799 [2025-04-26 16:55:33,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 801 [2025-04-26 16:55:33,754 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2522 states and 5870 transitions. [2025-04-26 16:55:33,754 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:33,754 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2522 states and 5870 transitions. [2025-04-26 16:55:33,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states and 5870 transitions. [2025-04-26 16:55:33,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2466. [2025-04-26 16:55:33,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 2466 states have (on average 2.3438767234387674) internal successors, (in total 5780), 2465 states have internal predecessors, (5780), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 5780 transitions. [2025-04-26 16:55:33,797 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2466 states and 5780 transitions. [2025-04-26 16:55:33,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:55:33,798 INFO L438 stractBuchiCegarLoop]: Abstraction has 2466 states and 5780 transitions. [2025-04-26 16:55:33,798 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:55:33,798 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2466 states and 5780 transitions. [2025-04-26 16:55:33,807 INFO L131 ngComponentsAnalysis]: Automaton has 107 accepting balls. 254 [2025-04-26 16:55:33,807 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:33,807 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:33,808 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:33,809 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:33,809 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_6 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (= v_j_6 0) (<= 0 v_N_5) (= v_total_1 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L24-->L25: 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] L73-1-->L36: 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] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L74-->L49-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] L25-->L25-1: Formula: (and (= (select v_q1_3 v_q1_back_9) (select v_f_3 v_i_9)) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, i=v_i_9, f=v_f_3, q1_back=v_q1_back_9} OutVars{q1=v_q1_3, i=v_i_9, f=v_f_3, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_back]" [2025-04-26 16:55:33,809 INFO L754 eck$LassoCheckResult]: Loop: "[97] L49-1-->L49: Formula: (or (< v_i_7 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[]" "[99] L49-->L49-1: Formula: (and (= (+ (select v_q1_7 v_q1_front_13) v_total_12) v_total_11) (= (+ v_q1_front_13 1) v_q1_front_12) (< v_q1_front_13 v_q1_back_12)) InVars {q1_front=v_q1_front_13, q1=v_q1_7, total=v_total_12, q1_back=v_q1_back_12} OutVars{q1_front=v_q1_front_12, q1=v_q1_7, total=v_total_11, q1_back=v_q1_back_12} AuxVars[] AssignedVars[q1_front, total]" [2025-04-26 16:55:33,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:33,810 INFO L85 PathProgramCache]: Analyzing trace with hash -560427307, now seen corresponding path program 2 times [2025-04-26 16:55:33,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:33,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429702172] [2025-04-26 16:55:33,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:33,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:33,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:33,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:33,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:33,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:33,818 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:33,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:33,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:33,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:33,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:33,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:33,826 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 3 times [2025-04-26 16:55:33,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:33,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481822733] [2025-04-26 16:55:33,826 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:33,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:33,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:33,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:33,829 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:55:33,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:33,829 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:33,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:33,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:33,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:33,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:33,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:33,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1699726921, now seen corresponding path program 2 times [2025-04-26 16:55:33,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:33,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878007567] [2025-04-26 16:55:33,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:33,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:33,833 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:33,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:33,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:33,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:33,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:33,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:33,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:33,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:33,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:33,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:33,947 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:33,947 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:33,947 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:33,947 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:33,947 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:33,948 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:33,948 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:33,948 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:33,948 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-series.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:55:33,948 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:33,948 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:33,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:33,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:34,091 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:34,093 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:34,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:34,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:34,095 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:34,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:55:34,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:34,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:34,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:34,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:34,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:34,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:34,109 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:34,113 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:34,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:34,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:34,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:34,121 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:34,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:55:34,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:34,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:34,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:34,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:34,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:34,133 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:34,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:34,138 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:34,146 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:55:34,146 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:55:34,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:34,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:34,148 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:34,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:55:34,151 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:34,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:34,167 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:34,167 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:34,167 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 16:55:34,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:55:34,174 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:34,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:34,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:55:34,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:55:34,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:34,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:34,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:34,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:34,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:34,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:34,204 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:34,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:34,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:34,206 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:34,207 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2466 states and 5780 transitions. cyclomatic complexity: 3675 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:34,298 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2466 states and 5780 transitions. cyclomatic complexity: 3675. 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 7727 states and 18185 transitions. Complement of second has 5 states. [2025-04-26 16:55:34,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:34,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-26 16:55:34,300 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:55:34,300 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:34,300 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:55:34,300 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:34,300 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:55:34,300 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:34,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7727 states and 18185 transitions. [2025-04-26 16:55:34,351 INFO L131 ngComponentsAnalysis]: Automaton has 163 accepting balls. 366 [2025-04-26 16:55:34,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7727 states to 5781 states and 13536 transitions. [2025-04-26 16:55:34,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2025-04-26 16:55:34,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1698 [2025-04-26 16:55:34,391 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5781 states and 13536 transitions. [2025-04-26 16:55:34,391 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:34,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5781 states and 13536 transitions. [2025-04-26 16:55:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5781 states and 13536 transitions. [2025-04-26 16:55:34,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5781 to 2854. [2025-04-26 16:55:34,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 2854 states have (on average 2.3665031534688157) internal successors, (in total 6754), 2853 states have internal predecessors, (6754), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:34,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 6754 transitions. [2025-04-26 16:55:34,453 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2854 states and 6754 transitions. [2025-04-26 16:55:34,453 INFO L438 stractBuchiCegarLoop]: Abstraction has 2854 states and 6754 transitions. [2025-04-26 16:55:34,453 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:55:34,453 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2854 states and 6754 transitions. [2025-04-26 16:55:34,463 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 264 [2025-04-26 16:55:34,463 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:34,463 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:34,463 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:34,463 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:34,464 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_6 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (= v_j_6 0) (<= 0 v_N_5) (= v_total_1 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L24-->L25: 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] L73-1-->L36: 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] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L74-->L49-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] L75-->L61-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] L49-1-->L49: Formula: (or (< v_i_7 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[]" "[94] L37-->L37-1: Formula: (and (= (+ v_q2_back_9 1) v_q2_back_8) (= (+ (select v_q2_3 v_q2_back_9) (select v_f_5 v_j_9)) 0)) InVars {q2=v_q2_3, f=v_f_5, q2_back=v_q2_back_9, j=v_j_9} OutVars{q2=v_q2_3, f=v_f_5, q2_back=v_q2_back_8, j=v_j_9} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:55:34,464 INFO L754 eck$LassoCheckResult]: Loop: "[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_7 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_7, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_7, q2_back=v_q2_back_5} AuxVars[] AssignedVars[]" "[103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front]" [2025-04-26 16:55:34,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:34,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1699701940, now seen corresponding path program 1 times [2025-04-26 16:55:34,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:34,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336970695] [2025-04-26 16:55:34,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:34,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:34,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:34,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:34,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,469 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:34,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:34,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:34,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:34,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:34,473 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 2 times [2025-04-26 16:55:34,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:34,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167520803] [2025-04-26 16:55:34,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:55:34,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:34,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:34,475 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:34,475 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:55:34,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,475 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:34,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:34,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:34,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:34,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:34,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1325988626, now seen corresponding path program 1 times [2025-04-26 16:55:34,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:34,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673140598] [2025-04-26 16:55:34,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:34,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:34,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:34,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:34,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,489 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:34,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:55:34,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:55:34,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:34,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:34,680 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:34,680 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:34,680 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:34,680 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:34,680 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:34,680 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:34,680 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:34,680 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:34,680 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-series.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:55:34,680 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:34,680 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:34,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:34,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:34,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:34,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:34,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:34,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:34,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:34,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:34,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:34,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:34,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:34,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:34,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:34,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:34,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:34,843 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:34,843 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:34,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:34,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:34,850 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:34,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:55:34,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:34,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:34,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:34,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:34,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:34,870 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:34,870 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:34,875 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:34,881 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 16:55:34,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:34,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:34,882 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:34,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:55:34,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:34,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:34,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:34,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:34,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:34,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:34,897 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:34,901 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:34,909 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:55:34,909 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:55:34,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:34,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:34,911 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:34,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:55:34,913 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:34,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:34,930 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:34,930 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:34,931 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2025-04-26 16:55:34,936 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 16:55:34,937 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:34,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:34,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:55:34,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:55:34,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:34,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:34,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:34,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:34,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:34,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:34,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:34,969 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:34,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:34,972 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:34,972 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2854 states and 6754 transitions. cyclomatic complexity: 4291 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:35,049 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2854 states and 6754 transitions. cyclomatic complexity: 4291. 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 8142 states and 19179 transitions. Complement of second has 5 states. [2025-04-26 16:55:35,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:35,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-04-26 16:55:35,050 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:55:35,050 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:35,050 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:55:35,050 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:35,050 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:55:35,051 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:35,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8142 states and 19179 transitions. [2025-04-26 16:55:35,090 INFO L131 ngComponentsAnalysis]: Automaton has 182 accepting balls. 404 [2025-04-26 16:55:35,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8142 states to 6807 states and 16075 transitions. [2025-04-26 16:55:35,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1615 [2025-04-26 16:55:35,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1695 [2025-04-26 16:55:35,135 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6807 states and 16075 transitions. [2025-04-26 16:55:35,135 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:35,136 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6807 states and 16075 transitions. [2025-04-26 16:55:35,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6807 states and 16075 transitions. [2025-04-26 16:55:35,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6807 to 6158. [2025-04-26 16:55:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6158 states, 6158 states have (on average 2.3980188372848326) internal successors, (in total 14767), 6157 states have internal predecessors, (14767), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:35,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6158 states to 6158 states and 14767 transitions. [2025-04-26 16:55:35,270 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6158 states and 14767 transitions. [2025-04-26 16:55:35,270 INFO L438 stractBuchiCegarLoop]: Abstraction has 6158 states and 14767 transitions. [2025-04-26 16:55:35,270 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:55:35,270 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6158 states and 14767 transitions. [2025-04-26 16:55:35,287 INFO L131 ngComponentsAnalysis]: Automaton has 144 accepting balls. 328 [2025-04-26 16:55:35,287 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:35,287 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:35,287 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:35,288 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:35,288 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_6 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (= v_j_6 0) (<= 0 v_N_5) (= v_total_1 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L24-->L25: 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] L25-->L25-1: Formula: (and (= (select v_q1_3 v_q1_back_9) (select v_f_3 v_i_9)) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, i=v_i_9, f=v_f_3, q1_back=v_q1_back_9} OutVars{q1=v_q1_3, i=v_i_9, f=v_f_3, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_back]" "[90] L25-1-->L24: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[87] L24-->L25: 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] L73-1-->L36: 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] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L74-->L49-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] L25-->L25-1: Formula: (and (= (select v_q1_3 v_q1_back_9) (select v_f_3 v_i_9)) (= (+ v_q1_back_9 1) v_q1_back_8)) InVars {q1=v_q1_3, i=v_i_9, f=v_f_3, q1_back=v_q1_back_9} OutVars{q1=v_q1_3, i=v_i_9, f=v_f_3, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_back]" [2025-04-26 16:55:35,288 INFO L754 eck$LassoCheckResult]: Loop: "[97] L49-1-->L49: Formula: (or (< v_i_7 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[]" "[99] L49-->L49-1: Formula: (and (= (+ (select v_q1_7 v_q1_front_13) v_total_12) v_total_11) (= (+ v_q1_front_13 1) v_q1_front_12) (< v_q1_front_13 v_q1_back_12)) InVars {q1_front=v_q1_front_13, q1=v_q1_7, total=v_total_12, q1_back=v_q1_back_12} OutVars{q1_front=v_q1_front_12, q1=v_q1_7, total=v_total_11, q1_back=v_q1_back_12} AuxVars[] AssignedVars[q1_front, total]" [2025-04-26 16:55:35,288 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:35,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1801886255, now seen corresponding path program 1 times [2025-04-26 16:55:35,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:35,288 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669036409] [2025-04-26 16:55:35,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:35,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:35,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:35,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:35,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:35,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:35,292 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:35,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:35,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:35,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:35,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:35,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:35,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:35,296 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 4 times [2025-04-26 16:55:35,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:35,296 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638128169] [2025-04-26 16:55:35,296 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:55:35,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:35,299 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-04-26 16:55:35,300 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:35,300 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:55:35,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:35,300 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:35,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:35,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:35,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:35,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:35,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:35,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:35,302 INFO L85 PathProgramCache]: Analyzing trace with hash -740867661, now seen corresponding path program 1 times [2025-04-26 16:55:35,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:35,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163518899] [2025-04-26 16:55:35,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:35,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:35,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:35,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:35,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:35,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:35,310 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:35,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:35,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:35,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:35,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:35,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:35,467 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:35,467 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:35,467 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:35,467 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:35,467 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:35,467 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,467 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:35,467 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:35,467 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-series.wvr.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:55:35,467 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:35,467 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:35,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:35,653 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:35,653 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:35,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,657 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:35,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:55:35,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:35,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,673 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:55:35,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,682 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:35,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:55:35,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:35,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,700 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:35,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,708 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:35,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:55:35,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:35,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,726 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:35,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,734 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:35,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:55:35,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:35,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,748 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,750 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:35,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,758 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:35,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:55:35,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:35,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,774 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:55:35,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,783 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:35,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:55:35,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:35,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,799 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,804 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 16:55:35,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,806 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:35,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:55:35,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:35,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,821 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:35,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,829 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:35,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:55:35,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:35,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,845 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:35,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,853 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:35,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:55:35,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:35,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,868 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 16:55:35,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,876 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:35,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:55:35,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:35,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,890 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,894 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,901 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 16:55:35,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,903 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:35,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:55:35,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:35,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,920 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:35,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:35,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,929 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:35,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:55:35,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:35,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:35,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:35,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:35,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:35,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:35,944 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:35,948 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:35,958 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:55:35,958 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:55:35,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:35,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:35,960 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:35,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:55:35,963 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:35,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 16:55:35,978 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:35,978 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:35,978 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2025-04-26 16:55:35,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:35,986 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:55:35,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:36,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:36,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:36,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:36,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:36,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:36,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:36,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:36,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:36,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:36,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:36,020 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:36,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:36,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:36,022 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:36,022 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6158 states and 14767 transitions. cyclomatic complexity: 9397 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:36,127 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6158 states and 14767 transitions. cyclomatic complexity: 9397. 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 12824 states and 29849 transitions. Complement of second has 5 states. [2025-04-26 16:55:36,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:36,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:36,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-26 16:55:36,128 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:55:36,128 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:36,128 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:36,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:36,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:36,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:36,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:36,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:36,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:36,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:36,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:36,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:36,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:36,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:36,156 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:36,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:36,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:36,158 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:36,158 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6158 states and 14767 transitions. cyclomatic complexity: 9397 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:36,241 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6158 states and 14767 transitions. cyclomatic complexity: 9397. 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 12824 states and 29849 transitions. Complement of second has 5 states. [2025-04-26 16:55:36,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:36,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-26 16:55:36,242 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:55:36,242 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:36,242 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:36,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:36,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:36,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:36,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:36,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:36,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:36,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:36,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:36,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:36,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:36,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:36,273 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:36,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:36,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:36,275 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:36,275 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6158 states and 14767 transitions. cyclomatic complexity: 9397 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:36,375 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6158 states and 14767 transitions. cyclomatic complexity: 9397. 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 13847 states and 32675 transitions. Complement of second has 5 states. [2025-04-26 16:55:36,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:36,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:36,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-04-26 16:55:36,376 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:55:36,377 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:36,377 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:55:36,377 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:36,377 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:55:36,377 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:36,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13847 states and 32675 transitions. [2025-04-26 16:55:36,454 INFO L131 ngComponentsAnalysis]: Automaton has 56 accepting balls. 112 [2025-04-26 16:55:36,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13847 states to 6962 states and 16309 transitions. [2025-04-26 16:55:36,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1289 [2025-04-26 16:55:36,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1477 [2025-04-26 16:55:36,488 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6962 states and 16309 transitions. [2025-04-26 16:55:36,488 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:36,488 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6962 states and 16309 transitions. [2025-04-26 16:55:36,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6962 states and 16309 transitions. [2025-04-26 16:55:36,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6962 to 3260. [2025-04-26 16:55:36,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3260 states, 3260 states have (on average 2.3190184049079754) internal successors, (in total 7560), 3259 states have internal predecessors, (7560), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:36,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 3260 states and 7560 transitions. [2025-04-26 16:55:36,588 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3260 states and 7560 transitions. [2025-04-26 16:55:36,588 INFO L438 stractBuchiCegarLoop]: Abstraction has 3260 states and 7560 transitions. [2025-04-26 16:55:36,588 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:55:36,588 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3260 states and 7560 transitions. [2025-04-26 16:55:36,596 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 60 [2025-04-26 16:55:36,596 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:36,596 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:36,596 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:36,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:36,597 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L73: Formula: (and (= v_i_6 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (= v_j_6 0) (<= 0 v_N_5) (= v_total_1 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_6, i=v_i_6, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[]" "[106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[87] L24-->L25: 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] L73-1-->L36: 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] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[112] L74-->L49-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] L75-->L61-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] L49-1-->L49: Formula: (or (< v_i_7 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_7, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[]" "[94] L37-->L37-1: Formula: (and (= (+ v_q2_back_9 1) v_q2_back_8) (= (+ (select v_q2_3 v_q2_back_9) (select v_f_5 v_j_9)) 0)) InVars {q2=v_q2_3, f=v_f_5, q2_back=v_q2_back_9, j=v_j_9} OutVars{q2=v_q2_3, f=v_f_5, q2_back=v_q2_back_8, j=v_j_9} AuxVars[] AssignedVars[q2_back]" "[95] L37-1-->L36: Formula: (= v_j_4 (+ v_j_5 1)) InVars {j=v_j_5} OutVars{j=v_j_4} AuxVars[] AssignedVars[j]" "[92] L36-->L37: Formula: (< v_j_2 v_N_4) InVars {N=v_N_4, j=v_j_2} OutVars{N=v_N_4, j=v_j_2} AuxVars[] AssignedVars[]" "[94] L37-->L37-1: Formula: (and (= (+ v_q2_back_9 1) v_q2_back_8) (= (+ (select v_q2_3 v_q2_back_9) (select v_f_5 v_j_9)) 0)) InVars {q2=v_q2_3, f=v_f_5, q2_back=v_q2_back_9, j=v_j_9} OutVars{q2=v_q2_3, f=v_f_5, q2_back=v_q2_back_8, j=v_j_9} AuxVars[] AssignedVars[q2_back]" [2025-04-26 16:55:36,597 INFO L754 eck$LassoCheckResult]: Loop: "[101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_7 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_7, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_7, q2_back=v_q2_back_5} AuxVars[] AssignedVars[]" "[103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front]" [2025-04-26 16:55:36,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:36,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1844019541, now seen corresponding path program 1 times [2025-04-26 16:55:36,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:36,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136660182] [2025-04-26 16:55:36,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:36,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:36,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:36,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:36,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:36,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:36,602 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:36,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:36,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:36,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:36,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:36,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:36,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:36,607 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 3 times [2025-04-26 16:55:36,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:36,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534771679] [2025-04-26 16:55:36,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:55:36,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:36,611 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:36,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:36,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:55:36,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:36,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:36,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:36,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:36,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:36,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:36,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:36,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:36,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1718711113, now seen corresponding path program 1 times [2025-04-26 16:55:36,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:36,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85789086] [2025-04-26 16:55:36,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:36,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:36,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:55:36,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:55:36,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:36,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:36,623 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:36,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:55:36,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:55:36,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:36,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:36,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:36,810 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:36,810 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:36,810 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:36,810 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:36,810 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:36,810 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:36,810 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:36,810 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:36,810 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-series.wvr.bpl_petrified1_Iteration9_Lasso [2025-04-26 16:55:36,810 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:36,810 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:36,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:36,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:36,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:36,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:36,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:36,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:36,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:36,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:36,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:36,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:36,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:36,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:36,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:36,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:36,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:36,999 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:36,999 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:36,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:36,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:37,003 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:37,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:55:37,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 16:55:37,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:37,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:37,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:37,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:37,017 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:37,017 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:37,019 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:55:37,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-04-26 16:55:37,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:37,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:37,026 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:37,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:55:37,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:55:37,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:37,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:37,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:37,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:37,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:55:37,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:55:37,045 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:37,052 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:55:37,052 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:55:37,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:37,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:37,055 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:55:37,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 16:55:37,057 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:37,074 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 16:55:37,074 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:55:37,074 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:37,074 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2025-04-26 16:55:37,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-04-26 16:55:37,082 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:55:37,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:37,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:37,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:37,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:37,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:37,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:37,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:37,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:37,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:37,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:37,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:37,120 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:37,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:37,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:37,124 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:37,124 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3260 states and 7560 transitions. cyclomatic complexity: 4631 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:37,162 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3260 states and 7560 transitions. cyclomatic complexity: 4631. 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 5490 states and 12640 transitions. Complement of second has 5 states. [2025-04-26 16:55:37,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:37,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-26 16:55:37,163 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:55:37,163 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:37,163 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:37,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:37,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:37,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:37,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:37,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:37,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:37,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:37,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:37,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:37,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:37,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:37,203 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:37,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:37,208 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:37,208 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3260 states and 7560 transitions. cyclomatic complexity: 4631 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:37,240 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3260 states and 7560 transitions. cyclomatic complexity: 4631. 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 5490 states and 12640 transitions. Complement of second has 5 states. [2025-04-26 16:55:37,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-26 16:55:37,241 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:55:37,241 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:37,241 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:55:37,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:37,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:55:37,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:55:37,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:37,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:37,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:37,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:37,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:37,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:37,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:37,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:37,303 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:37,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:37,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:55:37,305 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 16:55:37,305 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3260 states and 7560 transitions. cyclomatic complexity: 4631 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:37,353 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3260 states and 7560 transitions. cyclomatic complexity: 4631. 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 7652 states and 17469 transitions. Complement of second has 5 states. [2025-04-26 16:55:37,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:55:37,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:55:37,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-04-26 16:55:37,355 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:55:37,355 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:37,355 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 16:55:37,356 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:37,356 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:55:37,356 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:37,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7652 states and 17469 transitions. [2025-04-26 16:55:37,388 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:37,388 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7652 states to 0 states and 0 transitions. [2025-04-26 16:55:37,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:55:37,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:55:37,388 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:55:37,388 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:55:37,388 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:37,388 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:37,388 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:55:37,388 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:55:37,388 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:55:37,389 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:55:37,389 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:55:37,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:55:37,403 INFO L201 PluginConnector]: Adding new model buffer-series.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:37 BoogieIcfgContainer [2025-04-26 16:55:37,403 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:37,403 INFO L158 Benchmark]: Toolchain (without parser) took 7066.78ms. Allocated memory was 159.4MB in the beginning and 289.4MB in the end (delta: 130.0MB). Free memory was 86.9MB in the beginning and 121.2MB in the end (delta: -34.3MB). Peak memory consumption was 93.7MB. Max. memory is 8.0GB. [2025-04-26 16:55:37,403 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.82ms. Allocated memory is still 159.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:37,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.82ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 85.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:37,404 INFO L158 Benchmark]: Boogie Preprocessor took 17.22ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 83.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:37,404 INFO L158 Benchmark]: RCFGBuilder took 177.41ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 73.2MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:55:37,404 INFO L158 Benchmark]: BuchiAutomizer took 6841.65ms. Allocated memory was 159.4MB in the beginning and 289.4MB in the end (delta: 130.0MB). Free memory was 73.1MB in the beginning and 121.2MB in the end (delta: -48.1MB). Peak memory consumption was 81.1MB. Max. memory is 8.0GB. [2025-04-26 16:55:37,405 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.82ms. Allocated memory is still 159.4MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.82ms. Allocated memory is still 159.4MB. Free memory was 86.9MB in the beginning and 85.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.22ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 83.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 177.41ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 73.2MB in the end (delta: 10.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 6841.65ms. Allocated memory was 159.4MB in the beginning and 289.4MB in the end (delta: 130.0MB). Free memory was 73.1MB in the beginning and 121.2MB in the end (delta: -48.1MB). Peak memory consumption was 81.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 3.8s. 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 8. Automata minimization 0.5s AutomataMinimizationTime, 8 MinimizatonAttempts, 7907 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 492 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 481 mSDsluCounter, 390 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 130 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 260 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso7 LassoPreprocessingBenchmarks: Lassos: inital69 mio100 ax100 hnf100 lsp58 ukn87 mio100 lsp56 div100 bol100 ite100 ukn100 eq174 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 2 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]: 388, Number of transitions in reduction automaton: 1288, Number of states in reduction automaton: 592, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (2 trivial, 5 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 N + -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 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 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:55:37,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...