/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/min-max-inc-dec.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:03,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:03,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:03,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:03,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:03,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:03,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:03,429 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:03,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:03,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:03,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:03,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:03,432 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:03,432 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:03,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:03,433 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:03,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:03,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:03,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:03,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:03,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:03,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:03,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:03,434 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:03,434 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:03,434 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:03,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:03,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:03,680 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:03,681 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:03,681 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:03,683 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-inc-dec.wvr.bpl [2025-04-26 16:56:03,683 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/min-max-inc-dec.wvr.bpl' [2025-04-26 16:56:03,701 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:03,702 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:03,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:03,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:03,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:03,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:03" (1/1) ... [2025-04-26 16:56:03,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:03" (1/1) ... [2025-04-26 16:56:03,730 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:03,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:03,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:03,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:03,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:03,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:03" (1/1) ... [2025-04-26 16:56:03,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:03" (1/1) ... [2025-04-26 16:56:03,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:03" (1/1) ... [2025-04-26 16:56:03,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:03" (1/1) ... [2025-04-26 16:56:03,740 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:03" (1/1) ... [2025-04-26 16:56:03,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:03" (1/1) ... [2025-04-26 16:56:03,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:03" (1/1) ... [2025-04-26 16:56:03,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:03" (1/1) ... [2025-04-26 16:56:03,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:03" (1/1) ... [2025-04-26 16:56:03,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:03,751 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:03,751 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:03,751 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:03,752 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:03" (1/1) ... [2025-04-26 16:56:03,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:03,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:03,781 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:03,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:56:03,803 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:03,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:03,804 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:03,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:03,804 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:03,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:03,804 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:56:03,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:56:03,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:56:03,805 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:56:03,805 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:56:03,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:56:03,805 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:56:03,805 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:56:03,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:56:03,806 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:56:03,845 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:03,847 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:03,963 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:03,963 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:03,982 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:03,982 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:03,983 INFO L201 PluginConnector]: Adding new model min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:03 BoogieIcfgContainer [2025-04-26 16:56:03,983 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:03,983 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:03,985 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:03,989 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:03,990 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:03,990 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:03" (1/2) ... [2025-04-26 16:56:03,992 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b61e2f5 and model type min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:03, skipping insertion in model container [2025-04-26 16:56:03,992 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:03,992 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:03" (2/2) ... [2025-04-26 16:56:03,994 INFO L376 chiAutomizerObserver]: Analyzing ICFG min-max-inc-dec.wvr.bpl [2025-04-26 16:56:04,046 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 16:56:04,085 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:04,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:04,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:04,087 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:04,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:56:04,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 47 transitions, 129 flow [2025-04-26 16:56:04,169 INFO L116 PetriNetUnfolderBase]: 4/37 cut-off events. [2025-04-26 16:56:04,170 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 16:56:04,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 37 events. 4/37 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 76 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-04-26 16:56:04,174 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 47 transitions, 129 flow [2025-04-26 16:56:04,177 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 37 transitions, 104 flow [2025-04-26 16:56:04,178 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 49 places, 37 transitions, 104 flow [2025-04-26 16:56:04,184 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:04,653 WARN L140 AmpleReduction]: Number of pruned transitions: 2287 [2025-04-26 16:56:04,653 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:04,653 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 185 [2025-04-26 16:56:04,653 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:161 [2025-04-26 16:56:04,654 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:881 [2025-04-26 16:56:04,654 WARN L145 AmpleReduction]: Times succ was already a loop node:443 [2025-04-26 16:56:04,654 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:17 [2025-04-26 16:56:04,654 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:04,663 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 1228 states, 1226 states have (on average 1.9567699836867862) internal successors, (in total 2399), 1227 states have internal predecessors, (2399), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:04,670 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:04,670 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:04,670 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:04,670 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:04,670 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:04,670 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:04,670 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:04,670 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:04,674 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1228 states, 1226 states have (on average 1.9567699836867862) internal successors, (in total 2399), 1227 states have internal predecessors, (2399), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:04,729 INFO L131 ngComponentsAnalysis]: Automaton has 267 accepting balls. 689 [2025-04-26 16:56:04,730 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:04,730 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:04,737 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:56:04,737 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:04,737 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:04,740 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1228 states, 1226 states have (on average 1.9567699836867862) internal successors, (in total 2399), 1227 states have internal predecessors, (2399), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:04,774 INFO L131 ngComponentsAnalysis]: Automaton has 267 accepting balls. 689 [2025-04-26 16:56:04,775 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:04,775 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:04,775 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:56:04,775 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:04,780 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L79: Formula: (let ((.cse0 (not v_v_assert_2))) (and (or (and v_b1_2 v_v_assert_2) (and (not v_b1_2) .cse0)) (= v_i_6 v_k_1) (= v_i_6 0) (or (and v_b2_2 v_v_assert_2) (and .cse0 (not v_b2_2))) (= v_j_6 v_i_6) (= v_i_6 v_l_1) .cse0)) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_2} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_2} AuxVars[] AssignedVars[]" "[120] L79-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[96] $Ultimate##0-->L25: Formula: (= (select v_A_1 0) v_min_1) InVars {A=v_A_1} OutVars{A=v_A_1, min=v_min_1} AuxVars[] AssignedVars[min]" "[97] L25-->L27-1: Formula: v_b1_1 InVars {} OutVars{b1=v_b1_1} AuxVars[] AssignedVars[b1]" [2025-04-26 16:56:04,781 INFO L754 eck$LassoCheckResult]: Loop: "[99] L27-1-->L27: 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[]" "[101] L27-->L27-1: Formula: (and (= (+ v_i_8 1) v_i_7) (= (let ((.cse0 (select v_A_9 v_i_8))) (ite (< v_min_6 .cse0) v_min_6 .cse0)) v_min_5)) InVars {A=v_A_9, i=v_i_8, min=v_min_6} OutVars{A=v_A_9, i=v_i_7, min=v_min_5} AuxVars[] AssignedVars[i, min]" [2025-04-26 16:56:04,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:04,788 INFO L85 PathProgramCache]: Analyzing trace with hash 3812477, now seen corresponding path program 1 times [2025-04-26 16:56:04,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:04,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189501918] [2025-04-26 16:56:04,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:04,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:04,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:04,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:04,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:04,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:04,844 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:04,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:04,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:04,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:04,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:04,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:04,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:04,868 INFO L85 PathProgramCache]: Analyzing trace with hash 4131, now seen corresponding path program 1 times [2025-04-26 16:56:04,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:04,868 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783055607] [2025-04-26 16:56:04,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:04,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:04,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:04,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:04,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:04,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:04,879 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:04,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:04,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:04,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:04,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:04,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:04,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:04,890 INFO L85 PathProgramCache]: Analyzing trace with hash -631173729, now seen corresponding path program 1 times [2025-04-26 16:56:04,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:04,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567707411] [2025-04-26 16:56:04,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:04,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:04,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:04,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:04,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:04,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:04,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:04,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:04,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:04,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:04,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:04,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:05,123 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:05,123 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:05,124 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:05,124 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:05,124 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:05,124 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:05,124 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:05,124 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:05,124 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-inc-dec.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:56:05,124 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:05,124 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:05,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:05,330 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:05,333 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:05,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:05,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:05,338 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:05,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:56:05,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:05,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:05,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:05,353 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:56:05,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:05,372 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:56:05,372 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:56:05,392 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:05,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:56:05,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:05,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:05,402 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:05,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:56:05,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:05,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:05,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:05,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:05,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:05,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:05,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:05,428 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:05,442 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:56:05,443 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:56:05,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:05,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:05,463 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:05,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:56:05,465 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:05,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:05,482 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:05,483 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:05,483 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:56:05,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:05,492 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:05,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:05,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:05,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:05,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:05,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:05,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:05,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:05,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:05,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:05,534 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:05,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:05,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:05,562 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:05,566 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 1228 states, 1226 states have (on average 1.9567699836867862) internal successors, (in total 2399), 1227 states have internal predecessors, (2399), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:05,714 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 1228 states, 1226 states have (on average 1.9567699836867862) internal successors, (in total 2399), 1227 states have internal predecessors, (2399), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 2207 states and 4554 transitions. Complement of second has 7 states. [2025-04-26 16:56:05,714 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:05,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2025-04-26 16:56:05,726 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 87 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:56:05,726 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:05,726 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 87 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:56:05,726 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:05,726 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 87 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:56:05,727 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:05,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2207 states and 4554 transitions. [2025-04-26 16:56:05,749 INFO L131 ngComponentsAnalysis]: Automaton has 238 accepting balls. 582 [2025-04-26 16:56:05,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2207 states to 1439 states and 2906 transitions. [2025-04-26 16:56:05,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1025 [2025-04-26 16:56:05,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1170 [2025-04-26 16:56:05,772 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1439 states and 2906 transitions. [2025-04-26 16:56:05,773 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:05,773 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1439 states and 2906 transitions. [2025-04-26 16:56:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states and 2906 transitions. [2025-04-26 16:56:05,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1353. [2025-04-26 16:56:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1353 states have (on average 2.0177383592017737) internal successors, (in total 2730), 1352 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:05,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2730 transitions. [2025-04-26 16:56:05,835 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1353 states and 2730 transitions. [2025-04-26 16:56:05,835 INFO L438 stractBuchiCegarLoop]: Abstraction has 1353 states and 2730 transitions. [2025-04-26 16:56:05,835 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:05,835 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1353 states and 2730 transitions. [2025-04-26 16:56:05,841 INFO L131 ngComponentsAnalysis]: Automaton has 238 accepting balls. 582 [2025-04-26 16:56:05,841 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:05,841 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:05,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:56:05,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:05,841 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L79: Formula: (let ((.cse0 (not v_v_assert_2))) (and (or (and v_b1_2 v_v_assert_2) (and (not v_b1_2) .cse0)) (= v_i_6 v_k_1) (= v_i_6 0) (or (and v_b2_2 v_v_assert_2) (and .cse0 (not v_b2_2))) (= v_j_6 v_i_6) (= v_i_6 v_l_1) .cse0)) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_2} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_2} AuxVars[] AssignedVars[]" "[120] L79-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L79-1-->$Ultimate##0: 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]" "[126] L80-->L51-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:56:05,842 INFO L754 eck$LassoCheckResult]: Loop: "[109] L51-1-->L51: Formula: (< v_k_2 v_N_5) InVars {k=v_k_2, N=v_N_5} OutVars{k=v_k_2, N=v_N_5} AuxVars[] AssignedVars[]" "[111] L51-->L51-1: Formula: (and (= (+ v_k_8 1) v_k_7) (= v_A_13 (store v_A_14 v_k_8 (+ (select v_A_14 v_k_8) 1)))) InVars {A=v_A_14, k=v_k_8} OutVars{A=v_A_13, k=v_k_7} AuxVars[] AssignedVars[A, k]" [2025-04-26 16:56:05,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:05,842 INFO L85 PathProgramCache]: Analyzing trace with hash 3813343, now seen corresponding path program 1 times [2025-04-26 16:56:05,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:05,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613988227] [2025-04-26 16:56:05,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:05,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:05,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:05,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:05,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:05,846 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:05,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:05,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:05,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:05,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:05,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:05,851 INFO L85 PathProgramCache]: Analyzing trace with hash 4451, now seen corresponding path program 1 times [2025-04-26 16:56:05,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:05,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029753597] [2025-04-26 16:56:05,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:05,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:05,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:05,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:05,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:05,856 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:05,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:05,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:05,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:05,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:05,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:05,859 INFO L85 PathProgramCache]: Analyzing trace with hash -630341183, now seen corresponding path program 1 times [2025-04-26 16:56:05,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:05,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237777885] [2025-04-26 16:56:05,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:05,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:05,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:05,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:05,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:05,865 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:05,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:05,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:05,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:05,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:05,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:06,012 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:06,012 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:06,012 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:06,012 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:06,012 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:06,012 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,012 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:06,012 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:06,012 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-inc-dec.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:56:06,012 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:06,012 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:06,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,033 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,035 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,040 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,133 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:06,133 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:06,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,136 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:56:06,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:06,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:06,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:06,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:06,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:06,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:06,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:06,154 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:06,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:56:06,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,162 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:56:06,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:06,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:06,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:06,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:06,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:06,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:06,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:06,183 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:06,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:06,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,191 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:56:06,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:06,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:06,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:06,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:06,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:06,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:06,211 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:06,216 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:06,225 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:06,225 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:56:06,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,227 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:56:06,229 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:06,246 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 16:56:06,246 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:06,246 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:06,246 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 16:56:06,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:06,255 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:06,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:06,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:06,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:06,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:06,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:06,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:06,290 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:06,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:06,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:06,301 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:06,301 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1353 states and 2730 transitions. cyclomatic complexity: 1675 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:06,392 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1353 states and 2730 transitions. cyclomatic complexity: 1675. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 3184 states and 6681 transitions. Complement of second has 6 states. [2025-04-26 16:56:06,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-26 16:56:06,393 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:56:06,393 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:06,393 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:56:06,394 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:06,394 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:56:06,394 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:06,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3184 states and 6681 transitions. [2025-04-26 16:56:06,414 INFO L131 ngComponentsAnalysis]: Automaton has 149 accepting balls. 320 [2025-04-26 16:56:06,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3184 states to 1983 states and 4168 transitions. [2025-04-26 16:56:06,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 796 [2025-04-26 16:56:06,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1008 [2025-04-26 16:56:06,426 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1983 states and 4168 transitions. [2025-04-26 16:56:06,426 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:06,427 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1983 states and 4168 transitions. [2025-04-26 16:56:06,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1983 states and 4168 transitions. [2025-04-26 16:56:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1983 to 1798. [2025-04-26 16:56:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1798 states have (on average 2.0684093437152393) internal successors, (in total 3719), 1797 states have internal predecessors, (3719), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:06,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 3719 transitions. [2025-04-26 16:56:06,475 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1798 states and 3719 transitions. [2025-04-26 16:56:06,475 INFO L438 stractBuchiCegarLoop]: Abstraction has 1798 states and 3719 transitions. [2025-04-26 16:56:06,476 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:06,476 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1798 states and 3719 transitions. [2025-04-26 16:56:06,482 INFO L131 ngComponentsAnalysis]: Automaton has 149 accepting balls. 320 [2025-04-26 16:56:06,482 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:06,482 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:06,482 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:56:06,482 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:06,483 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L79: Formula: (let ((.cse0 (not v_v_assert_2))) (and (or (and v_b1_2 v_v_assert_2) (and (not v_b1_2) .cse0)) (= v_i_6 v_k_1) (= v_i_6 0) (or (and v_b2_2 v_v_assert_2) (and .cse0 (not v_b2_2))) (= v_j_6 v_i_6) (= v_i_6 v_l_1) .cse0)) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_2} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_2} AuxVars[] AssignedVars[]" "[120] L79-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L79-1-->$Ultimate##0: 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]" "[102] $Ultimate##0-->L38: Formula: (= (select v_A_4 0) v_max_3) InVars {A=v_A_4} OutVars{A=v_A_4, max=v_max_3} AuxVars[] AssignedVars[max]" "[103] L38-->L40-1: Formula: v_b2_1 InVars {} OutVars{b2=v_b2_1} AuxVars[] AssignedVars[b2]" [2025-04-26 16:56:06,483 INFO L754 eck$LassoCheckResult]: Loop: "[105] L40-1-->L40: Formula: (< v_j_1 v_N_3) InVars {N=v_N_3, j=v_j_1} OutVars{N=v_N_3, j=v_j_1} AuxVars[] AssignedVars[]" "[107] L40-->L40-1: Formula: (and (= (let ((.cse0 (select v_A_11 v_j_8))) (ite (< .cse0 v_max_6) v_max_6 .cse0)) v_max_5) (= (+ v_j_8 1) v_j_7)) InVars {A=v_A_11, max=v_max_6, j=v_j_8} OutVars{A=v_A_11, max=v_max_5, j=v_j_7} AuxVars[] AssignedVars[j, max]" [2025-04-26 16:56:06,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,483 INFO L85 PathProgramCache]: Analyzing trace with hash 118212992, now seen corresponding path program 1 times [2025-04-26 16:56:06,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,484 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442565107] [2025-04-26 16:56:06,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:06,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:06,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,492 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:06,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:06,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:06,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:06,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash 4323, now seen corresponding path program 1 times [2025-04-26 16:56:06,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728622908] [2025-04-26 16:56:06,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,499 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:06,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:06,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1933538978, now seen corresponding path program 1 times [2025-04-26 16:56:06,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25517387] [2025-04-26 16:56:06,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:06,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:06,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,514 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:06,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:06,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:06,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:06,676 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:06,676 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:06,676 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:06,676 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:06,676 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:06,676 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,676 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:06,676 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:06,676 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-inc-dec.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:56:06,676 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:06,676 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:06,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,857 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:06,857 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:06,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,862 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:56:06,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:06,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:06,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:06,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:06,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:06,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:06,874 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:06,876 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:06,882 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 16:56:06,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,884 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:56:06,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:06,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:06,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:06,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:06,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:06,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:06,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:06,899 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:06,906 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 16:56:06,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,908 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:56:06,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:06,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:06,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:06,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:06,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:06,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:06,921 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:06,923 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:06,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:56:06,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,932 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:56:06,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:06,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:06,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:06,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:06,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:06,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:06,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:06,948 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:06,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:06,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,957 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:56:06,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:06,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:06,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:06,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:06,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:06,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:06,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:06,973 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:06,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:06,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,981 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:56:06,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:06,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:06,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:06,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:06,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:06,994 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:06,994 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:06,997 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:07,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:56:07,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,005 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:07,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:56:07,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:07,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:07,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:07,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:07,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:07,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:07,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:07,020 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:07,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:56:07,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,027 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:07,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:56:07,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:07,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:07,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:07,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:07,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:07,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:07,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:07,043 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:07,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:07,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,051 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:07,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:56:07,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:07,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:07,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:07,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:07,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:07,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:07,064 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:07,067 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:07,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:56:07,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,075 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:07,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:56:07,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:07,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:07,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:07,088 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:56:07,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:07,096 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:56:07,097 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:56:07,106 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:07,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:07,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,115 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:07,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:56:07,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:07,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:07,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:07,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:07,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:07,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:07,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:07,134 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:07,141 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:07,141 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:56:07,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,144 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:07,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:56:07,145 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:07,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:56:07,162 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:07,162 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:07,162 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(j, N) = -1*j + 1*N Supporting invariants [] [2025-04-26 16:56:07,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:56:07,168 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:07,177 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:07,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:07,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:07,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:07,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:07,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:07,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:07,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:07,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:07,197 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:07,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:07,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:07,208 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:07,208 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1798 states and 3719 transitions. cyclomatic complexity: 2271 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:07,281 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1798 states and 3719 transitions. cyclomatic complexity: 2271. 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 3627 states and 7774 transitions. Complement of second has 6 states. [2025-04-26 16:56:07,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:07,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-04-26 16:56:07,285 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:56:07,285 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:07,285 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:56:07,285 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:07,285 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:56:07,285 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:07,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3627 states and 7774 transitions. [2025-04-26 16:56:07,306 INFO L131 ngComponentsAnalysis]: Automaton has 106 accepting balls. 212 [2025-04-26 16:56:07,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3627 states to 1784 states and 3835 transitions. [2025-04-26 16:56:07,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 624 [2025-04-26 16:56:07,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 702 [2025-04-26 16:56:07,317 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1784 states and 3835 transitions. [2025-04-26 16:56:07,317 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:07,317 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1784 states and 3835 transitions. [2025-04-26 16:56:07,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states and 3835 transitions. [2025-04-26 16:56:07,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1654. [2025-04-26 16:56:07,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1654 states, 1654 states have (on average 2.1596130592503022) internal successors, (in total 3572), 1653 states have internal predecessors, (3572), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:07,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3572 transitions. [2025-04-26 16:56:07,345 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1654 states and 3572 transitions. [2025-04-26 16:56:07,345 INFO L438 stractBuchiCegarLoop]: Abstraction has 1654 states and 3572 transitions. [2025-04-26 16:56:07,345 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:07,345 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1654 states and 3572 transitions. [2025-04-26 16:56:07,351 INFO L131 ngComponentsAnalysis]: Automaton has 106 accepting balls. 212 [2025-04-26 16:56:07,351 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:07,351 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:07,352 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:56:07,352 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:07,352 INFO L752 eck$LassoCheckResult]: Stem: "[93] $Ultimate##0-->L79: Formula: (let ((.cse0 (not v_v_assert_2))) (and (or (and v_b1_2 v_v_assert_2) (and (not v_b1_2) .cse0)) (= v_i_6 v_k_1) (= v_i_6 0) (or (and v_b2_2 v_v_assert_2) (and .cse0 (not v_b2_2))) (= v_j_6 v_i_6) (= v_i_6 v_l_1) .cse0)) InVars {b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_2} OutVars{b2=v_b2_2, b1=v_b1_2, l=v_l_1, k=v_k_1, j=v_j_6, i=v_i_6, v_assert=v_v_assert_2} AuxVars[] AssignedVars[]" "[120] L79-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[123] L79-1-->$Ultimate##0: 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]" "[126] L80-->L51-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]" "[109] L51-1-->L51: Formula: (< v_k_2 v_N_5) InVars {k=v_k_2, N=v_N_5} OutVars{k=v_k_2, N=v_N_5} AuxVars[] AssignedVars[]" "[129] L81-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 16:56:07,352 INFO L754 eck$LassoCheckResult]: Loop: "[113] L62-1-->L62: Formula: (< v_l_6 v_N_8) InVars {l=v_l_6, N=v_N_8} OutVars{l=v_l_6, N=v_N_8} AuxVars[] AssignedVars[]" "[115] L62-->L62-1: Formula: (and (= v_l_7 (+ v_l_8 1)) (= (store v_A_18 v_l_8 (+ (- 1) (select v_A_18 v_l_8))) v_A_17)) InVars {A=v_A_18, l=v_l_8} OutVars{A=v_A_17, l=v_l_7} AuxVars[] AssignedVars[A, l]" [2025-04-26 16:56:07,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:07,352 INFO L85 PathProgramCache]: Analyzing trace with hash -630341165, now seen corresponding path program 1 times [2025-04-26 16:56:07,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:07,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456862460] [2025-04-26 16:56:07,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:07,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:07,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:07,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:07,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:07,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:07,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:07,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:07,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash 4579, now seen corresponding path program 1 times [2025-04-26 16:56:07,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:07,361 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839331990] [2025-04-26 16:56:07,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:07,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:07,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:07,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:07,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,364 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:07,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:07,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:07,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:07,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash -167467211, now seen corresponding path program 1 times [2025-04-26 16:56:07,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:07,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324880964] [2025-04-26 16:56:07,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:07,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:07,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:07,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:07,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,372 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:07,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:07,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:07,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:07,535 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:07,535 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:07,535 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:07,535 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:07,535 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:07,535 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,535 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:07,535 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:07,535 INFO L132 ssoRankerPreferences]: Filename of dumped script: min-max-inc-dec.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:56:07,535 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:07,536 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:07,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:07,676 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:07,676 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:07,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,678 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:07,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:56:07,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:07,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:07,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:07,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:07,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:07,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:07,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:07,693 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:07,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:56:07,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,701 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:07,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:56:07,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:07,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:07,712 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:07,712 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:07,712 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:07,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:07,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:07,716 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:07,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:56:07,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,724 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:07,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:56:07,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:07,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:07,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:07,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:07,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:07,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:07,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:07,739 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:07,745 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 16:56:07,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,747 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:07,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:56:07,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:07,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:07,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:07,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:07,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:07,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:07,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:07,762 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:07,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:56:07,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,770 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:07,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:56:07,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:07,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:07,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:07,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:07,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:07,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:07,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:07,786 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:07,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:56:07,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,794 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:07,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:56:07,795 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:07,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:07,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:07,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:07,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:07,807 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:07,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:07,810 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:07,822 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:56:07,822 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:56:07,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:07,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:07,824 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:07,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:56:07,825 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:07,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:56:07,840 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:07,840 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:07,841 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(l, N) = -1*l + 1*N Supporting invariants [] [2025-04-26 16:56:07,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:07,847 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:07,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:07,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:07,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:07,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:07,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:07,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:07,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:07,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:07,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:07,882 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:07,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:07,892 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:07,892 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1654 states and 3572 transitions. cyclomatic complexity: 2257 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:07,962 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1654 states and 3572 transitions. cyclomatic complexity: 2257. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 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) Result 3690 states and 8189 transitions. Complement of second has 6 states. [2025-04-26 16:56:07,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:07,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-04-26 16:56:07,964 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:56:07,964 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:07,964 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:56:07,965 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:07,965 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 69 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:56:07,965 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:07,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3690 states and 8189 transitions. [2025-04-26 16:56:07,985 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:07,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3690 states to 0 states and 0 transitions. [2025-04-26 16:56:07,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:07,985 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:07,985 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:07,985 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:07,985 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:07,985 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:07,985 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:07,986 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:07,986 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:07,986 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:07,986 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:07,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:07,999 INFO L201 PluginConnector]: Adding new model min-max-inc-dec.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:07 BoogieIcfgContainer [2025-04-26 16:56:07,999 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:08,000 INFO L158 Benchmark]: Toolchain (without parser) took 4297.14ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 45.6MB in the end (delta: 37.3MB). Peak memory consumption was 40.3MB. Max. memory is 8.0GB. [2025-04-26 16:56:08,000 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:08,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.93ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 80.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:08,002 INFO L158 Benchmark]: Boogie Preprocessor took 18.15ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 79.9MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:08,003 INFO L158 Benchmark]: RCFGBuilder took 231.99ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 69.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:08,003 INFO L158 Benchmark]: BuchiAutomizer took 4015.52ms. Allocated memory is still 155.2MB. Free memory was 69.1MB in the beginning and 45.6MB in the end (delta: 23.5MB). Peak memory consumption was 27.7MB. Max. memory is 8.0GB. [2025-04-26 16:56:08,004 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.27ms. Allocated memory is still 155.2MB. Free memory is still 83.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.93ms. Allocated memory is still 155.2MB. Free memory was 82.9MB in the beginning and 80.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 18.15ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 79.9MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 231.99ms. Allocated memory is still 155.2MB. Free memory was 79.8MB in the beginning and 69.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 4015.52ms. Allocated memory is still 155.2MB. Free memory was 69.1MB in the beginning and 45.6MB in the end (delta: 23.5MB). Peak memory consumption was 27.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 401 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 302 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 298 mSDsluCounter, 164 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 229 IncrementalHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 94 mSDtfsCounter, 229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf100 lsp69 ukn59 mio100 lsp82 div100 bol100 ite100 ukn100 eq165 hnf94 smp100 dnf126 smp81 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 58ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 574, Number of transitions in reduction automaton: 2399, Number of states in reduction automaton: 1228, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * l + N and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:56:08,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...