/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-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:59,976 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:00,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:00,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:00,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:00,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:00,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:00,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:00,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:00,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:00,051 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:00,051 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:00,051 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:00,051 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:00,051 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:00,051 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:00,051 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:00,052 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:00,052 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:00,052 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:00,052 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:00,052 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:00,052 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:00,052 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:00,052 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:00,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:00,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:00,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:00,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:00,052 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:00,052 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:00,053 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:00,053 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:00,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:00,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:00,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:00,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:00,054 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:00,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:00,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:00,054 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:00,054 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:00,054 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:00,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:00,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:00,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:00,283 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:00,283 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:00,284 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-array.wvr.bpl [2025-04-26 18:41:00,284 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-series-array.wvr.bpl' [2025-04-26 18:41:00,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:00,307 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:00,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:00,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:00,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:00,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:00" (1/1) ... [2025-04-26 18:41:00,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:00" (1/1) ... [2025-04-26 18:41:00,345 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:00,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:00,348 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:00,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:00,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:00,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:00" (1/1) ... [2025-04-26 18:41:00,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:00" (1/1) ... [2025-04-26 18:41:00,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:00" (1/1) ... [2025-04-26 18:41:00,354 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:00" (1/1) ... [2025-04-26 18:41:00,357 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:00" (1/1) ... [2025-04-26 18:41:00,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:00" (1/1) ... [2025-04-26 18:41:00,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:00" (1/1) ... [2025-04-26 18:41:00,359 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:00" (1/1) ... [2025-04-26 18:41:00,360 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:00" (1/1) ... [2025-04-26 18:41:00,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:00,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:00,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:00,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:00,375 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:00" (1/1) ... [2025-04-26 18:41:00,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:00,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:00,399 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:00,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:41:00,421 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:00,421 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:00,421 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:00,421 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:00,421 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:00,422 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:00,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:00,422 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:00,422 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:00,422 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:41:00,422 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:41:00,422 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:41:00,422 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:41:00,457 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:00,459 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:00,569 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:00,569 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:00,598 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:00,599 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:00,599 INFO L201 PluginConnector]: Adding new model buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:00 BoogieIcfgContainer [2025-04-26 18:41:00,599 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:00,600 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:00,600 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:00,606 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:00,607 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:00,607 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:00" (1/2) ... [2025-04-26 18:41:00,609 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a60e478 and model type buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:00, skipping insertion in model container [2025-04-26 18:41:00,609 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:00,609 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:00" (2/2) ... [2025-04-26 18:41:00,611 INFO L376 chiAutomizerObserver]: Analyzing ICFG buffer-series-array.wvr.bpl [2025-04-26 18:41:00,664 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:41:00,697 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:00,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:00,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:00,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:00,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:41:00,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 106 flow [2025-04-26 18:41:00,771 INFO L116 PetriNetUnfolderBase]: 4/31 cut-off events. [2025-04-26 18:41:00,772 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:41:00,775 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 18:41:00,775 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 106 flow [2025-04-26 18:41:00,777 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2025-04-26 18:41:00,778 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 40 places, 31 transitions, 86 flow [2025-04-26 18:41:00,778 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 40 places, 31 transitions, 86 flow [2025-04-26 18:41:00,839 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 637 states, 635 states have (on average 3.8866141732283466) internal successors, (in total 2468), 636 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:00,841 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 637 states, 635 states have (on average 3.8866141732283466) internal successors, (in total 2468), 636 states have internal predecessors, (2468), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:00,843 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:01,018 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 229#[L25, L49-1, thread2EXIT, L75]true [2025-04-26 18:41:01,086 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 613#[L37, L76, L61-1, L49, L25-1]true [2025-04-26 18:41:01,087 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 673#[L25, L37-1, L76, L61-1, L49]true [2025-04-26 18:41:01,087 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 379#[L49-1, L37-1, L25-1, L75]true [2025-04-26 18:41:01,087 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 133#[L49-1, L25, L75, L37]true [2025-04-26 18:41:01,092 WARN L140 AmpleReduction]: Number of pruned transitions: 947 [2025-04-26 18:41:01,092 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 5 [2025-04-26 18:41:01,092 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 168 [2025-04-26 18:41:01,092 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:47 [2025-04-26 18:41:01,092 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:381 [2025-04-26 18:41:01,092 WARN L145 AmpleReduction]: Times succ was already a loop node:238 [2025-04-26 18:41:01,092 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:216 [2025-04-26 18:41:01,092 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:01,094 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 18:41:01,101 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:01,101 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:01,101 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:01,101 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:01,102 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:01,102 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:01,102 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:01,102 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:01,104 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 18:41:01,138 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 489 [2025-04-26 18:41:01,139 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:01,139 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:01,144 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:41:01,144 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:01,144 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:01,145 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 18:41:01,155 INFO L131 ngComponentsAnalysis]: Automaton has 101 accepting balls. 489 [2025-04-26 18:41:01,156 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:01,156 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:01,156 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:41:01,156 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:01,160 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 18:41:01,160 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 18:41:01,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:01,165 INFO L85 PathProgramCache]: Analyzing trace with hash 3578, now seen corresponding path program 1 times [2025-04-26 18:41:01,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:01,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354680471] [2025-04-26 18:41:01,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:01,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:01,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:01,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:01,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:01,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:01,215 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:01,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:01,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:01,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:01,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:01,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:01,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:01,232 INFO L85 PathProgramCache]: Analyzing trace with hash 116247, now seen corresponding path program 1 times [2025-04-26 18:41:01,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:01,232 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788512872] [2025-04-26 18:41:01,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:01,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:01,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:01,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:01,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:01,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:01,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:01,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:01,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:01,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:01,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:01,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:01,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:01,246 INFO L85 PathProgramCache]: Analyzing trace with hash 106678654, now seen corresponding path program 1 times [2025-04-26 18:41:01,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:01,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803255850] [2025-04-26 18:41:01,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:01,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:01,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:01,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:01,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:01,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:01,256 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:01,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:01,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:01,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:01,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:01,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:01,395 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:01,396 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:01,396 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:01,396 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:01,396 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:01,396 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:01,396 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:01,396 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:01,396 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-series-array.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:41:01,396 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:01,397 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:01,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:01,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:01,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:01,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:01,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:01,596 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:01,599 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:01,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:01,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:01,603 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:01,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:41:01,606 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:01,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:01,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:01,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:01,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:01,625 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:01,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:01,630 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:01,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:41:01,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:01,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:01,639 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:01,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:41:01,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:01,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:01,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:01,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:01,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:01,656 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:01,656 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:01,661 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:01,671 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:01,671 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:01,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:01,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:01,674 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:01,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:41:01,677 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:01,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:01,694 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:01,694 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:01,694 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 18:41:01,700 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 18:41:01,702 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:01,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:01,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:01,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:01,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:01,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:01,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:01,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:01,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:01,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:01,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:01,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:01,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:01,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:01,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:01,782 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:01,784 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 18:41:01,915 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 18:41:01,915 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2025-04-26 18:41:01,923 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 18:41:01,924 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:01,924 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:41:01,924 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:01,924 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 85 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 18:41:01,924 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:01,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1604 states and 3454 transitions. [2025-04-26 18:41:01,937 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 306 [2025-04-26 18:41:01,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1604 states to 789 states and 1710 transitions. [2025-04-26 18:41:01,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 373 [2025-04-26 18:41:01,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 497 [2025-04-26 18:41:01,949 INFO L74 IsDeterministic]: Start isDeterministic. Operand 789 states and 1710 transitions. [2025-04-26 18:41:01,949 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:01,950 INFO L218 hiAutomatonCegarLoop]: Abstraction has 789 states and 1710 transitions. [2025-04-26 18:41:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states and 1710 transitions. [2025-04-26 18:41:01,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 701. [2025-04-26 18:41:01,996 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 18:41:01,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1523 transitions. [2025-04-26 18:41:02,000 INFO L240 hiAutomatonCegarLoop]: Abstraction has 701 states and 1523 transitions. [2025-04-26 18:41:02,000 INFO L438 stractBuchiCegarLoop]: Abstraction has 701 states and 1523 transitions. [2025-04-26 18:41:02,000 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:02,000 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 701 states and 1523 transitions. [2025-04-26 18:41:02,004 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 306 [2025-04-26 18:41:02,004 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:02,004 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:02,004 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:41:02,004 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:02,004 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 18:41:02,004 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 18:41:02,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:02,005 INFO L85 PathProgramCache]: Analyzing trace with hash 3441264, now seen corresponding path program 1 times [2025-04-26 18:41:02,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:02,005 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416885107] [2025-04-26 18:41:02,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:02,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:02,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:02,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:02,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:02,012 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:02,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:02,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:02,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:02,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:02,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:02,022 INFO L85 PathProgramCache]: Analyzing trace with hash 121212, now seen corresponding path program 1 times [2025-04-26 18:41:02,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:02,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518028060] [2025-04-26 18:41:02,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:02,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:02,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:02,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:02,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:02,029 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:02,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:02,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:02,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:02,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:02,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:02,035 INFO L85 PathProgramCache]: Analyzing trace with hash -560427859, now seen corresponding path program 1 times [2025-04-26 18:41:02,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:02,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315573469] [2025-04-26 18:41:02,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:02,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:02,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:02,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:02,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:02,040 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:02,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:02,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:02,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:02,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:02,133 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:02,133 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:02,133 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:02,133 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:02,133 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:02,133 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:02,133 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:02,133 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:02,133 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-series-array.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:41:02,133 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:02,133 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:02,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:02,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:02,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:02,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:02,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:02,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:02,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:02,239 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:02,239 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:02,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:02,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:02,241 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:02,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:41:02,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:02,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:02,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:02,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:02,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:02,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:02,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:02,258 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:02,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:02,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:02,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:02,267 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:02,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:41:02,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:02,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:02,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:02,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:02,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:02,281 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:02,281 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:02,284 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:02,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:41:02,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:02,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:02,292 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:02,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:41:02,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:02,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:02,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:02,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:02,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:02,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:02,306 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:02,309 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:02,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:41:02,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:02,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:02,317 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:02,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:41:02,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:02,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:02,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:02,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:02,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:02,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:02,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:02,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:02,331 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:02,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:41:02,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:02,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:02,338 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:02,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:41:02,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:02,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:02,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:02,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:02,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:02,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:02,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:02,356 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:02,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:41:02,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:02,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:02,363 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:02,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:41:02,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:02,376 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:02,376 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:02,376 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:02,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:02,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:02,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:02,383 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:02,391 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:02,391 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:02,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:02,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:02,394 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:02,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:41:02,409 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:02,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:02,427 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:02,427 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:02,427 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(j, N) = -1*j + 1*N Supporting invariants [] [2025-04-26 18:41:02,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:41:02,435 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:02,449 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:02,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:02,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:02,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:02,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:02,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:02,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:02,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:02,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:02,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:02,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:02,487 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:02,487 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 18:41:02,571 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 18:41:02,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:02,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-04-26 18:41:02,572 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 18:41:02,572 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:02,572 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 18:41:02,572 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:02,572 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 80 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 18:41:02,572 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:02,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1845 states and 3949 transitions. [2025-04-26 18:41:02,585 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 180 [2025-04-26 18:41:02,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1845 states to 1027 states and 2213 transitions. [2025-04-26 18:41:02,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 358 [2025-04-26 18:41:02,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 444 [2025-04-26 18:41:02,594 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1027 states and 2213 transitions. [2025-04-26 18:41:02,594 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:02,594 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1027 states and 2213 transitions. [2025-04-26 18:41:02,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states and 2213 transitions. [2025-04-26 18:41:02,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 956. [2025-04-26 18:41:02,615 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 18:41:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2088 transitions. [2025-04-26 18:41:02,618 INFO L240 hiAutomatonCegarLoop]: Abstraction has 956 states and 2088 transitions. [2025-04-26 18:41:02,618 INFO L438 stractBuchiCegarLoop]: Abstraction has 956 states and 2088 transitions. [2025-04-26 18:41:02,618 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:02,618 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 956 states and 2088 transitions. [2025-04-26 18:41:02,622 INFO L131 ngComponentsAnalysis]: Automaton has 70 accepting balls. 180 [2025-04-26 18:41:02,622 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:02,622 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:02,622 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:41:02,622 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:02,622 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 18:41:02,622 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 18:41:02,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:02,623 INFO L85 PathProgramCache]: Analyzing trace with hash -987909628, now seen corresponding path program 1 times [2025-04-26 18:41:02,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:02,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654789848] [2025-04-26 18:41:02,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:02,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:02,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:02,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:02,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:02,628 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:02,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:02,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:02,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:02,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:02,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:02,635 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 18:41:02,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:02,635 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901509144] [2025-04-26 18:41:02,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:02,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:02,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:02,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:02,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:02,641 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:02,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:02,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:02,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:02,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:02,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:02,646 INFO L85 PathProgramCache]: Analyzing trace with hash -193376986, now seen corresponding path program 1 times [2025-04-26 18:41:02,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:02,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470051438] [2025-04-26 18:41:02,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:02,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:02,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:02,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:02,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:02,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:02,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:02,712 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470051438] [2025-04-26 18:41:02,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470051438] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:02,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:02,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 18:41:02,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827362660] [2025-04-26 18:41:02,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:02,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:02,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:41:02,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:41:02,738 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 18:41:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:02,780 INFO L93 Difference]: Finished difference Result 1136 states and 2450 transitions. [2025-04-26 18:41:02,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1136 states and 2450 transitions. [2025-04-26 18:41:02,786 INFO L131 ngComponentsAnalysis]: Automaton has 83 accepting balls. 206 [2025-04-26 18:41:02,792 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1136 states to 1118 states and 2423 transitions. [2025-04-26 18:41:02,792 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 443 [2025-04-26 18:41:02,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 443 [2025-04-26 18:41:02,793 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1118 states and 2423 transitions. [2025-04-26 18:41:02,793 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:02,793 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1118 states and 2423 transitions. [2025-04-26 18:41:02,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states and 2423 transitions. [2025-04-26 18:41:02,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1078. [2025-04-26 18:41:02,810 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 18:41:02,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 2364 transitions. [2025-04-26 18:41:02,813 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1078 states and 2364 transitions. [2025-04-26 18:41:02,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:41:02,814 INFO L438 stractBuchiCegarLoop]: Abstraction has 1078 states and 2364 transitions. [2025-04-26 18:41:02,814 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:02,815 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1078 states and 2364 transitions. [2025-04-26 18:41:02,818 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 192 [2025-04-26 18:41:02,818 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:02,818 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:02,819 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:02,819 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:02,819 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 18:41:02,819 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 18:41:02,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:02,820 INFO L85 PathProgramCache]: Analyzing trace with hash -561007387, now seen corresponding path program 1 times [2025-04-26 18:41:02,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:02,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736944157] [2025-04-26 18:41:02,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:02,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:02,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:02,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:02,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:02,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:02,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:02,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:02,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:02,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:02,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:02,836 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 2 times [2025-04-26 18:41:02,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:02,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470976209] [2025-04-26 18:41:02,836 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:02,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:02,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:02,843 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:02,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:02,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:02,843 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:02,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:02,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:02,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:02,845 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:02,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:02,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2037783495, now seen corresponding path program 1 times [2025-04-26 18:41:02,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:02,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804793294] [2025-04-26 18:41:02,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:02,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:02,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:02,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:02,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:02,854 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:02,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:02,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:02,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:02,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:02,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:03,020 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:03,021 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:03,021 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:03,021 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:03,021 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:03,021 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:03,021 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:03,021 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:03,021 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-series-array.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:41:03,021 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:03,021 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:03,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,030 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,044 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,160 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:03,160 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:03,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:03,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:03,162 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:03,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:41:03,164 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:03,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:03,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:03,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:03,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:03,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:03,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:03,177 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:03,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:41:03,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:03,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:03,184 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:03,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:41:03,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:03,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:03,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:03,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:03,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:03,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:03,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:03,201 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:03,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:41:03,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:03,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:03,209 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:03,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:41:03,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:03,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:03,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:03,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:03,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:03,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:03,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:03,228 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:03,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:03,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:03,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:03,236 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:03,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:41:03,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:03,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:03,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:03,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:03,249 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:03,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:03,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:03,256 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:03,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:03,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:03,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:03,263 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:03,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:41:03,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:03,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:03,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:03,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:03,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:03,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:03,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:03,281 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:03,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:03,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:03,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:03,289 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:03,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:41:03,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:03,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:03,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:03,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:03,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:03,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:03,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:03,305 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:03,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:03,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:03,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:03,313 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:03,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:41:03,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:03,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:03,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:03,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:03,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:03,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:03,325 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:03,328 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:03,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:41:03,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:03,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:03,336 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:03,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:41:03,338 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:03,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:03,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:03,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:03,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:03,350 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:03,350 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:03,352 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:03,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:41:03,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:03,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:03,359 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:03,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:41:03,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:03,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:03,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:03,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:03,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:03,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:03,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:03,379 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:03,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:41:03,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:03,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:03,388 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:03,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:41:03,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:03,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:03,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:03,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:03,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:03,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:03,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:03,409 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:03,417 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:41:03,418 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 18:41:03,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:03,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:03,420 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:03,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:41:03,422 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:03,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:03,439 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:03,439 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:03,439 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 18:41:03,445 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 18:41:03,446 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:03,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:03,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:03,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:03,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:03,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:03,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:03,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:03,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:03,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:03,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:03,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:03,479 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:03,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:03,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:03,483 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:41:03,483 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 18:41:03,533 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 18:41:03,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:03,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:03,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-04-26 18:41:03,534 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:41:03,534 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:03,534 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:41:03,534 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:03,534 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:41:03,534 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:03,534 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2974 states and 6628 transitions. [2025-04-26 18:41:03,552 INFO L131 ngComponentsAnalysis]: Automaton has 106 accepting balls. 252 [2025-04-26 18:41:03,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2974 states to 2344 states and 5244 transitions. [2025-04-26 18:41:03,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 710 [2025-04-26 18:41:03,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 810 [2025-04-26 18:41:03,568 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2344 states and 5244 transitions. [2025-04-26 18:41:03,568 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:03,568 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2344 states and 5244 transitions. [2025-04-26 18:41:03,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states and 5244 transitions. [2025-04-26 18:41:03,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 1970. [2025-04-26 18:41:03,616 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 18:41:03,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 4571 transitions. [2025-04-26 18:41:03,620 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1970 states and 4571 transitions. [2025-04-26 18:41:03,620 INFO L438 stractBuchiCegarLoop]: Abstraction has 1970 states and 4571 transitions. [2025-04-26 18:41:03,621 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:03,621 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1970 states and 4571 transitions. [2025-04-26 18:41:03,627 INFO L131 ngComponentsAnalysis]: Automaton has 83 accepting balls. 206 [2025-04-26 18:41:03,627 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:03,627 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:03,628 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:03,628 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:03,629 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 18:41:03,629 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 18:41:03,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:03,629 INFO L85 PathProgramCache]: Analyzing trace with hash -560427281, now seen corresponding path program 1 times [2025-04-26 18:41:03,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:03,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074048623] [2025-04-26 18:41:03,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:03,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:03,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:03,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:03,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:03,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:03,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:03,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:03,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:03,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:03,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:03,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:03,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:03,642 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 18:41:03,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:03,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923962887] [2025-04-26 18:41:03,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:03,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:03,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:03,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:03,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:03,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:03,646 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:03,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:03,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:03,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:03,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:03,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:03,649 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:03,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1699701807, now seen corresponding path program 1 times [2025-04-26 18:41:03,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:03,649 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015070033] [2025-04-26 18:41:03,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:03,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:03,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:03,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:03,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:03,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:03,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:03,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015070033] [2025-04-26 18:41:03,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015070033] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:03,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:03,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 18:41:03,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256533587] [2025-04-26 18:41:03,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:03,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:03,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:41:03,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:41:03,697 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 18:41:03,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:03,729 INFO L93 Difference]: Finished difference Result 2641 states and 6085 transitions. [2025-04-26 18:41:03,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2641 states and 6085 transitions. [2025-04-26 18:41:03,743 INFO L131 ngComponentsAnalysis]: Automaton has 117 accepting balls. 274 [2025-04-26 18:41:03,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2641 states to 2522 states and 5870 transitions. [2025-04-26 18:41:03,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 799 [2025-04-26 18:41:03,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 801 [2025-04-26 18:41:03,759 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2522 states and 5870 transitions. [2025-04-26 18:41:03,759 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:03,759 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2522 states and 5870 transitions. [2025-04-26 18:41:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states and 5870 transitions. [2025-04-26 18:41:03,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2466. [2025-04-26 18:41:03,791 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 18:41:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 5780 transitions. [2025-04-26 18:41:03,797 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2466 states and 5780 transitions. [2025-04-26 18:41:03,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:41:03,798 INFO L438 stractBuchiCegarLoop]: Abstraction has 2466 states and 5780 transitions. [2025-04-26 18:41:03,798 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:41:03,798 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2466 states and 5780 transitions. [2025-04-26 18:41:03,807 INFO L131 ngComponentsAnalysis]: Automaton has 107 accepting balls. 254 [2025-04-26 18:41:03,807 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:03,807 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:03,809 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:03,809 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:03,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 18:41:03,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 18:41:03,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:03,810 INFO L85 PathProgramCache]: Analyzing trace with hash -560427307, now seen corresponding path program 2 times [2025-04-26 18:41:03,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:03,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733727344] [2025-04-26 18:41:03,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:03,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:03,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:03,815 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:03,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:03,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:03,815 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:03,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:03,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:03,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:03,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:03,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:03,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:03,819 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 3 times [2025-04-26 18:41:03,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:03,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059464148] [2025-04-26 18:41:03,819 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:03,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:03,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:03,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:03,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:41:03,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:03,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:03,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:03,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:03,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:03,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:03,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:03,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:03,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1699726921, now seen corresponding path program 2 times [2025-04-26 18:41:03,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:03,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38881819] [2025-04-26 18:41:03,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:03,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:03,825 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:03,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:03,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:03,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:03,827 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:03,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:03,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:03,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:03,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:03,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:03,959 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:03,959 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:03,959 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:03,959 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:03,959 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:03,959 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:03,959 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:03,959 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:03,959 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-series-array.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:41:03,959 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:03,959 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:03,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:03,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:04,106 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:04,106 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:04,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:04,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:04,109 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:04,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:41:04,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:04,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:04,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:04,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:04,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:04,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:04,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:04,134 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:04,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:41:04,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:04,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:04,144 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:04,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:41:04,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:04,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:04,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:04,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:04,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:04,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:04,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:04,164 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:04,171 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:04,171 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:04,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:04,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:04,173 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:04,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:41:04,176 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:04,191 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 18:41:04,192 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:04,192 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:04,192 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2025-04-26 18:41:04,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:04,198 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:04,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:04,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:04,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:04,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:04,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:04,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:04,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:04,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:04,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:04,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:04,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:04,230 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:04,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:04,233 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:41:04,233 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 18:41:04,326 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 18:41:04,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:04,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:04,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-26 18:41:04,327 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:41:04,328 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:04,328 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:41:04,328 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:04,328 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:41:04,328 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:04,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7727 states and 18185 transitions. [2025-04-26 18:41:04,371 INFO L131 ngComponentsAnalysis]: Automaton has 163 accepting balls. 366 [2025-04-26 18:41:04,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7727 states to 5781 states and 13536 transitions. [2025-04-26 18:41:04,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2025-04-26 18:41:04,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1698 [2025-04-26 18:41:04,441 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5781 states and 13536 transitions. [2025-04-26 18:41:04,441 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:04,441 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5781 states and 13536 transitions. [2025-04-26 18:41:04,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5781 states and 13536 transitions. [2025-04-26 18:41:04,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5781 to 2854. [2025-04-26 18:41:04,497 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 18:41:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 6754 transitions. [2025-04-26 18:41:04,506 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2854 states and 6754 transitions. [2025-04-26 18:41:04,507 INFO L438 stractBuchiCegarLoop]: Abstraction has 2854 states and 6754 transitions. [2025-04-26 18:41:04,507 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:41:04,507 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2854 states and 6754 transitions. [2025-04-26 18:41:04,517 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 264 [2025-04-26 18:41:04,518 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:04,518 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:04,519 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:04,519 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:04,520 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 18:41:04,520 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 18:41:04,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:04,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1699701940, now seen corresponding path program 1 times [2025-04-26 18:41:04,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:04,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905129889] [2025-04-26 18:41:04,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:04,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:04,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:04,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:04,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:04,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:04,529 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:04,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:04,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:04,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:04,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:04,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:04,533 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:04,533 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 2 times [2025-04-26 18:41:04,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:04,533 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95966408] [2025-04-26 18:41:04,533 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:04,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:04,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:04,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:04,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:04,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:04,535 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:04,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:04,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:04,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:04,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:04,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:04,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1325988626, now seen corresponding path program 1 times [2025-04-26 18:41:04,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:04,541 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627336322] [2025-04-26 18:41:04,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:04,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:04,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:04,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:04,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:04,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:04,547 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:04,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:04,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:04,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:04,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:04,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:04,700 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:04,700 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:04,700 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:04,700 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:04,701 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:04,701 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:04,701 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:04,701 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:04,701 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-series-array.wvr.bpl_petrified1_Iteration7_Lasso [2025-04-26 18:41:04,701 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:04,701 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:04,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:04,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:04,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:04,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:04,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:04,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:04,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:04,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:04,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:04,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:04,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:04,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:04,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:04,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:04,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:04,888 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:04,889 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:04,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:04,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:04,891 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:04,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 18:41:04,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:04,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:04,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:04,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:04,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:04,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:04,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:04,909 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:04,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 18:41:04,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:04,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:04,917 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:04,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 18:41:04,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:04,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:04,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:04,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:04,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:04,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:04,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:04,936 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:04,943 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:41:04,943 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:04,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:04,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:04,945 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:04,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 18:41:04,947 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:04,963 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 18:41:04,964 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:04,964 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:04,964 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2025-04-26 18:41:04,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:04,970 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:04,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:04,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:04,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:04,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:04,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:04,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:04,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:04,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:04,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:04,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:04,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:05,000 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:05,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:05,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:05,002 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:41:05,002 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 18:41:05,065 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 18:41:05,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-04-26 18:41:05,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:41:05,066 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:05,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:41:05,066 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:05,066 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 65 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:41:05,066 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:05,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8142 states and 19179 transitions. [2025-04-26 18:41:05,106 INFO L131 ngComponentsAnalysis]: Automaton has 182 accepting balls. 404 [2025-04-26 18:41:05,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8142 states to 6807 states and 16075 transitions. [2025-04-26 18:41:05,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1615 [2025-04-26 18:41:05,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1695 [2025-04-26 18:41:05,193 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6807 states and 16075 transitions. [2025-04-26 18:41:05,193 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:05,193 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6807 states and 16075 transitions. [2025-04-26 18:41:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6807 states and 16075 transitions. [2025-04-26 18:41:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6807 to 6158. [2025-04-26 18:41:05,313 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 18:41:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6158 states to 6158 states and 14767 transitions. [2025-04-26 18:41:05,330 INFO L240 hiAutomatonCegarLoop]: Abstraction has 6158 states and 14767 transitions. [2025-04-26 18:41:05,330 INFO L438 stractBuchiCegarLoop]: Abstraction has 6158 states and 14767 transitions. [2025-04-26 18:41:05,330 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:41:05,330 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6158 states and 14767 transitions. [2025-04-26 18:41:05,356 INFO L131 ngComponentsAnalysis]: Automaton has 144 accepting balls. 328 [2025-04-26 18:41:05,356 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:05,356 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:05,356 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:05,356 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:05,357 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 18:41:05,357 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 18:41:05,357 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:05,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1801886255, now seen corresponding path program 1 times [2025-04-26 18:41:05,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:05,357 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899166314] [2025-04-26 18:41:05,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:05,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:05,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:05,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:05,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:05,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:05,368 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:05,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:05,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:05,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:05,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:05,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:05,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:05,372 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 4 times [2025-04-26 18:41:05,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:05,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680678078] [2025-04-26 18:41:05,372 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:41:05,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:05,375 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-04-26 18:41:05,376 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:05,376 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:41:05,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:05,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:05,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:05,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:05,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:05,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:05,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:05,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:05,378 INFO L85 PathProgramCache]: Analyzing trace with hash -740867661, now seen corresponding path program 1 times [2025-04-26 18:41:05,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:05,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723295121] [2025-04-26 18:41:05,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:05,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:05,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:05,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:05,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:05,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:05,384 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:05,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:05,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:05,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:05,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:05,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:05,549 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:05,549 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:05,549 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:05,549 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:05,549 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:05,549 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:05,549 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:05,549 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:05,549 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-series-array.wvr.bpl_petrified1_Iteration8_Lasso [2025-04-26 18:41:05,549 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:05,549 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:05,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:05,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:05,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:05,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:05,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:05,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:05,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:05,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:05,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:05,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:05,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:05,707 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:05,708 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:05,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:05,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:05,709 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:05,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 18:41:05,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:05,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:05,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:05,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:05,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:05,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:05,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:05,725 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:05,734 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 18:41:05,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:05,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:05,736 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:05,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 18:41:05,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:05,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:05,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:05,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:05,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:05,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:05,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:05,753 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:05,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 18:41:05,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:05,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:05,760 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:05,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 18:41:05,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 18:41:05,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:05,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:05,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:05,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:05,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:05,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:05,776 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:05,781 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 18:41:05,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:05,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:05,811 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:05,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 18:41:05,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:05,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:05,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:05,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:05,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:05,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:05,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:05,826 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:05,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 18:41:05,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:05,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:05,834 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:05,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 18:41:05,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:05,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:05,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:05,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:05,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:05,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:05,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:05,850 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:05,855 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 18:41:05,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:05,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:05,858 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:05,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 18:41:05,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:05,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:05,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:05,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:05,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:05,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:05,872 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:05,874 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:05,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 18:41:05,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:05,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:05,882 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:05,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 18:41:05,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:05,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:05,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:05,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:05,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:05,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:05,895 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:05,898 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:05,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 18:41:05,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:05,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:05,905 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:05,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 18:41:05,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:05,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:05,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:05,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:05,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:05,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:05,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:05,921 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:05,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 18:41:05,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:05,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:05,928 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:05,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 18:41:05,930 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:05,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:05,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:05,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:05,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:05,940 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:05,940 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:05,943 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:05,948 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 18:41:05,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:05,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:05,950 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:05,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 18:41:05,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:05,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:05,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:05,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:05,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:05,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:05,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:05,968 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:05,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 18:41:05,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:05,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:05,976 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:05,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 18:41:05,979 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:05,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:05,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:05,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:05,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:05,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:05,991 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:05,994 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:05,999 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 18:41:06,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:06,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:06,001 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:06,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 18:41:06,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:06,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:06,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:06,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:06,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:06,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:06,015 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:06,020 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:06,030 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 18:41:06,030 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 18:41:06,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:06,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:06,033 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:06,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 18:41:06,035 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:06,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:06,054 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:06,054 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:06,054 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2025-04-26 18:41:06,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 18:41:06,062 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:06,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:06,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:06,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:06,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:06,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:06,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:06,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:06,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:06,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:06,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:06,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:06,100 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:06,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:06,103 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:41:06,103 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 18:41:06,239 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 18:41:06,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-26 18:41:06,240 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:41:06,240 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:06,240 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:06,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:06,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:06,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:06,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:06,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:06,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:06,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:06,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:06,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:06,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:06,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:06,267 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:06,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:06,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:06,269 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:41:06,269 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 18:41:06,338 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 18:41:06,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-26 18:41:06,339 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 66 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:41:06,339 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:06,339 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:06,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:06,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:06,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:06,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:06,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:06,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:06,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:06,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:06,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:06,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:06,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:06,378 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:06,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:06,380 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:41:06,380 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 18:41:06,509 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 18:41:06,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-04-26 18:41:06,511 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:41:06,511 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:06,511 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:41:06,512 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:06,512 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 18:41:06,512 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:06,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13847 states and 32675 transitions. [2025-04-26 18:41:06,576 INFO L131 ngComponentsAnalysis]: Automaton has 56 accepting balls. 112 [2025-04-26 18:41:06,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13847 states to 6962 states and 16309 transitions. [2025-04-26 18:41:06,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1289 [2025-04-26 18:41:06,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1477 [2025-04-26 18:41:06,615 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6962 states and 16309 transitions. [2025-04-26 18:41:06,615 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:06,615 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6962 states and 16309 transitions. [2025-04-26 18:41:06,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6962 states and 16309 transitions. [2025-04-26 18:41:06,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6962 to 3260. [2025-04-26 18:41:06,678 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 18:41:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3260 states to 3260 states and 7560 transitions. [2025-04-26 18:41:06,731 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3260 states and 7560 transitions. [2025-04-26 18:41:06,732 INFO L438 stractBuchiCegarLoop]: Abstraction has 3260 states and 7560 transitions. [2025-04-26 18:41:06,732 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:41:06,732 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3260 states and 7560 transitions. [2025-04-26 18:41:06,739 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 60 [2025-04-26 18:41:06,739 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:06,739 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:06,739 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:06,739 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:06,740 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 18:41:06,740 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 18:41:06,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:06,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1844019541, now seen corresponding path program 1 times [2025-04-26 18:41:06,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:06,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891704575] [2025-04-26 18:41:06,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:06,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:06,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:06,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:06,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:06,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:06,744 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:06,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:06,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:06,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:06,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:06,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:06,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:06,749 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 3 times [2025-04-26 18:41:06,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:06,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687196609] [2025-04-26 18:41:06,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:06,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:06,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:06,751 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:06,751 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:41:06,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:06,751 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:06,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:06,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:06,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:06,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:06,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:06,757 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1718711113, now seen corresponding path program 1 times [2025-04-26 18:41:06,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:06,757 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326016017] [2025-04-26 18:41:06,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:06,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:06,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:06,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:06,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:06,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:06,763 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:06,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:41:06,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:41:06,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:06,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:06,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:06,953 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:06,953 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:06,953 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:06,953 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:06,953 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:06,953 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:06,954 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:06,954 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:06,954 INFO L132 ssoRankerPreferences]: Filename of dumped script: buffer-series-array.wvr.bpl_petrified1_Iteration9_Lasso [2025-04-26 18:41:06,954 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:06,954 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:06,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:06,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:06,980 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:06,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:06,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:06,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:06,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:06,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:06,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:06,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:06,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:06,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:06,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:07,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:07,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:07,119 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:07,119 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:07,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:07,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:07,121 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:07,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 18:41:07,124 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:07,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:07,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:07,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:07,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:07,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:07,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:07,137 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:07,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:07,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:07,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:07,143 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:07,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 18:41:07,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:07,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:07,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:07,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:07,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:07,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:07,157 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:07,161 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:07,167 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:41:07,167 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:07,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:07,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:07,169 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:07,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 18:41:07,170 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:07,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 18:41:07,185 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:07,185 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:07,185 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_back, q2_front) = 1*q2_back - 1*q2_front Supporting invariants [] [2025-04-26 18:41:07,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-04-26 18:41:07,195 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 18:41:07,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:07,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:07,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:07,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:07,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:07,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:07,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:07,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:07,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:07,232 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:07,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:07,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:07,234 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:41:07,234 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 18:41:07,310 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 18:41:07,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-26 18:41:07,312 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:41:07,312 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:07,312 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:07,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:07,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:07,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:07,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:07,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:07,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:07,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:07,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:07,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:07,393 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:07,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:07,399 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:41:07,399 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 18:41:07,501 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 18:41:07,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:07,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-04-26 18:41:07,502 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 47 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:41:07,502 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:07,502 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:41:07,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:07,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:41:07,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:41:07,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:07,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:07,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:07,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:07,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:07,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:07,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:07,540 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:07,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:07,542 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:41:07,542 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 18:41:07,602 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 18:41:07,602 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:07,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2025-04-26 18:41:07,607 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:41:07,608 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:07,608 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:41:07,608 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:07,608 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 64 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 18:41:07,608 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:07,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7652 states and 17469 transitions. [2025-04-26 18:41:07,653 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:07,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7652 states to 0 states and 0 transitions. [2025-04-26 18:41:07,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:07,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:07,653 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:07,653 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:07,653 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:07,653 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:07,653 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:07,653 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 18:41:07,653 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:07,653 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:07,654 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:07,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:41:07,666 INFO L201 PluginConnector]: Adding new model buffer-series-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:07 BoogieIcfgContainer [2025-04-26 18:41:07,666 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:07,666 INFO L158 Benchmark]: Toolchain (without parser) took 7359.51ms. Allocated memory was 159.4MB in the beginning and 478.2MB in the end (delta: 318.8MB). Free memory was 87.4MB in the beginning and 261.6MB in the end (delta: -174.2MB). Peak memory consumption was 148.0MB. Max. memory is 8.0GB. [2025-04-26 18:41:07,666 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:07,667 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.56ms. Allocated memory is still 159.4MB. Free memory was 87.4MB in the beginning and 85.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:07,667 INFO L158 Benchmark]: Boogie Preprocessor took 24.51ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 84.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:07,670 INFO L158 Benchmark]: RCFGBuilder took 226.44ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 73.6MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:41:07,671 INFO L158 Benchmark]: BuchiAutomizer took 7065.83ms. Allocated memory was 159.4MB in the beginning and 478.2MB in the end (delta: 318.8MB). Free memory was 73.6MB in the beginning and 261.6MB in the end (delta: -188.0MB). Peak memory consumption was 135.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:07,672 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.17ms. Allocated memory is still 159.4MB. Free memory is still 88.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.56ms. Allocated memory is still 159.4MB. Free memory was 87.4MB in the beginning and 85.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.51ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 84.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 226.44ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 73.6MB in the end (delta: 10.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 7065.83ms. Allocated memory was 159.4MB in the beginning and 478.2MB in the end (delta: 318.8MB). Free memory was 73.6MB in the beginning and 261.6MB in the end (delta: -188.0MB). Peak memory consumption was 135.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 10 iterations. TraceHistogramMax:2. Analysis of lassos took 3.7s. Construction of modules took 0.3s. Büchi inclusion checks took 1.3s. 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, 508 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 497 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: 30ms 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.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 399, 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 18:41:07,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...