/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/regression/loop-lockstep-example.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:38:43,006 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:38:43,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:38:43,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:38:43,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:38:43,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:38:43,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:38:43,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:38:43,083 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:38:43,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:38:43,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:38:43,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:38:43,085 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:38:43,085 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:38:43,085 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:38:43,085 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:38:43,085 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:38:43,085 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:38:43,085 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:38:43,085 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:38:43,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:38:43,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:38:43,086 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:38:43,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:38:43,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:38:43,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:38:43,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:38:43,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:38:43,086 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:38:43,086 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:38:43,086 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:38:43,086 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:38:43,086 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:38:43,086 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:38:43,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:38:43,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:43,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:38:43,087 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:38:43,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:38:43,087 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:38:43,087 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:38:43,087 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:38:43,087 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:38:43,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:38:43,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:38:43,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:38:43,275 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:38:43,275 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:38:43,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/loop-lockstep-example.bpl [2025-04-26 18:38:43,277 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/loop-lockstep-example.bpl' [2025-04-26 18:38:43,289 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:38:43,290 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:38:43,291 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:43,291 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:38:43,291 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:38:43,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "loop-lockstep-example.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:43" (1/1) ... [2025-04-26 18:38:43,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "loop-lockstep-example.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:43" (1/1) ... [2025-04-26 18:38:43,324 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:38:43,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:43,327 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:38:43,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:38:43,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:38:43,331 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "loop-lockstep-example.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:43" (1/1) ... [2025-04-26 18:38:43,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "loop-lockstep-example.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:43" (1/1) ... [2025-04-26 18:38:43,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "loop-lockstep-example.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:43" (1/1) ... [2025-04-26 18:38:43,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "loop-lockstep-example.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:43" (1/1) ... [2025-04-26 18:38:43,335 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "loop-lockstep-example.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:43" (1/1) ... [2025-04-26 18:38:43,335 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "loop-lockstep-example.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:43" (1/1) ... [2025-04-26 18:38:43,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "loop-lockstep-example.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:43" (1/1) ... [2025-04-26 18:38:43,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "loop-lockstep-example.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:43" (1/1) ... [2025-04-26 18:38:43,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "loop-lockstep-example.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:43" (1/1) ... [2025-04-26 18:38:43,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:38:43,351 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:38:43,351 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:38:43,351 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:38:43,352 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "loop-lockstep-example.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:43" (1/1) ... [2025-04-26 18:38:43,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:43,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:43,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:43,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:38:43,405 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:38:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:38:43,405 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:38:43,405 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:38:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:38:43,405 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:38:43,405 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:38:43,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:38:43,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:38:43,406 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:38:43,440 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:38:43,441 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:38:43,514 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:38:43,515 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:38:43,523 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:38:43,523 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:38:43,524 INFO L201 PluginConnector]: Adding new model loop-lockstep-example.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:43 BoogieIcfgContainer [2025-04-26 18:38:43,524 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:38:43,525 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:38:43,525 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:38:43,529 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:38:43,530 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:43,530 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "loop-lockstep-example.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:43" (1/2) ... [2025-04-26 18:38:43,531 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fd1a08d and model type loop-lockstep-example.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:38:43, skipping insertion in model container [2025-04-26 18:38:43,531 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:43,531 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "loop-lockstep-example.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:43" (2/2) ... [2025-04-26 18:38:43,532 INFO L376 chiAutomizerObserver]: Analyzing ICFG loop-lockstep-example.bpl [2025-04-26 18:38:43,575 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:38:43,610 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:43,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:43,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:43,613 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:43,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:38:43,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 68 flow [2025-04-26 18:38:43,683 INFO L116 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-04-26 18:38:43,684 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:38:43,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 2/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 18:38:43,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 68 flow [2025-04-26 18:38:43,692 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 58 flow [2025-04-26 18:38:43,692 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 28 places, 23 transitions, 58 flow [2025-04-26 18:38:43,693 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 23 transitions, 58 flow [2025-04-26 18:38:43,709 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 75 states, 73 states have (on average 1.9726027397260273) internal successors, (in total 144), 74 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:43,711 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 75 states, 73 states have (on average 1.9726027397260273) internal successors, (in total 144), 74 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:43,713 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:38:43,780 WARN L140 AmpleReduction]: Number of pruned transitions: 40 [2025-04-26 18:38:43,780 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:38:43,780 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 7 [2025-04-26 18:38:43,780 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:19 [2025-04-26 18:38:43,780 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:35 [2025-04-26 18:38:43,781 WARN L145 AmpleReduction]: Times succ was already a loop node:3 [2025-04-26 18:38:43,781 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:13 [2025-04-26 18:38:43,781 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:38:43,781 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 62 states, 60 states have (on average 1.3) internal successors, (in total 78), 61 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:43,786 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:38:43,786 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:38:43,786 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:38:43,786 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:38:43,786 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:38:43,786 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:38:43,786 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:38:43,786 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:38:43,787 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 62 states, 60 states have (on average 1.3) internal successors, (in total 78), 61 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:43,795 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 45 [2025-04-26 18:38:43,795 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:43,795 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:43,798 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:38:43,798 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:38:43,798 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:38:43,798 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 62 states, 60 states have (on average 1.3) internal successors, (in total 78), 61 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:43,799 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 45 [2025-04-26 18:38:43,800 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:43,800 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:43,800 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:38:43,800 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:38:43,803 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L43: Formula: (= v_x_11 0) InVars {} OutVars{x=v_x_11} AuxVars[] AssignedVars[x]" "[71] L43-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[54] $Ultimate##0-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" [2025-04-26 18:38:43,803 INFO L754 eck$LassoCheckResult]: Loop: "[56] L19-1-->L20: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_N_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, N=v_N_1} AuxVars[] AssignedVars[]" "[58] L20-->L21: Formula: (= v_x_1 (+ v_x_2 1)) InVars {x=v_x_2} OutVars{x=v_x_1} AuxVars[] AssignedVars[x]" "[59] L21-->L22: Formula: (= (+ v_x_4 1) v_x_3) InVars {x=v_x_4} OutVars{x=v_x_3} AuxVars[] AssignedVars[x]" "[60] L22-->L23: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[61] L23-->L24: Formula: (= v_x_7 (+ v_x_8 1)) InVars {x=v_x_8} OutVars{x=v_x_7} AuxVars[] AssignedVars[x]" "[62] L24-->L19-1: Formula: (= (+ v_thread1Thread1of1ForFork0_i_7 1) v_thread1Thread1of1ForFork0_i_8) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_8} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" [2025-04-26 18:38:43,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:43,807 INFO L85 PathProgramCache]: Analyzing trace with hash 76252, now seen corresponding path program 1 times [2025-04-26 18:38:43,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:43,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484228731] [2025-04-26 18:38:43,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:43,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:43,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:38:43,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:38:43,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:43,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:43,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:43,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:38:43,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:38:43,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:43,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:43,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:43,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:43,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1748849659, now seen corresponding path program 1 times [2025-04-26 18:38:43,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:43,872 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209477346] [2025-04-26 18:38:43,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:43,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:43,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:38:43,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:38:43,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:43,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:43,885 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:43,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:38:43,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:38:43,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:43,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:43,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:43,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:43,895 INFO L85 PathProgramCache]: Analyzing trace with hash -210385504, now seen corresponding path program 1 times [2025-04-26 18:38:43,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:43,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344672111] [2025-04-26 18:38:43,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:43,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:43,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:43,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:43,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:43,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:43,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:43,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:38:43,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:38:43,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:43,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:43,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:43,996 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:43,997 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:43,997 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:43,997 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:43,997 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:38:43,997 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:43,997 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:43,997 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:43,997 INFO L132 ssoRankerPreferences]: Filename of dumped script: loop-lockstep-example.bpl_petrified1_Iteration1_Loop [2025-04-26 18:38:43,997 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:43,997 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:44,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:44,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:44,092 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:44,092 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:38:44,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:44,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:44,096 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:44,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:38:44,098 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:38:44,098 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:44,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:38:44,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:44,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:44,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:44,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:38:44,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:38:44,122 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:44,148 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:38:44,148 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x=0} Honda state: {x=0} Generalized eigenvectors: [{x=5}, {x=-1}, {x=0}] Lambdas: [1, 1, 0] Nus: [0, 0] [2025-04-26 18:38:44,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:38:44,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:44,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:44,157 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:44,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:38:44,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:38:44,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:44,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:38:44,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:44,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:44,179 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:44,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:38:44,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:38:44,181 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:44,243 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:38:44,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:38:44,247 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:44,247 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:44,247 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:44,247 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:44,247 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:44,247 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:44,248 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:44,248 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:44,248 INFO L132 ssoRankerPreferences]: Filename of dumped script: loop-lockstep-example.bpl_petrified1_Iteration1_Loop [2025-04-26 18:38:44,248 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:44,248 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:44,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:44,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:44,285 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:44,288 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:44,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:44,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:44,311 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:44,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:38:44,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:38:44,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:44,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:44,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:44,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:44,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:44,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:44,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:44,331 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:38:44,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:38:44,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:44,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:44,339 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:44,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:38:44,340 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:38:44,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:44,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:44,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:44,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:44,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:44,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:44,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:44,354 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:44,357 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:38:44,357 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:38:44,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:44,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:44,360 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:44,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:38:44,362 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:44,365 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:38:44,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:44,366 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:38:44,366 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:44,367 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, N) = -1*thread1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2025-04-26 18:38:44,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:38:44,375 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:38:44,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:44,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:38:44,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:38:44,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:44,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:44,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:44,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:44,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:38:44,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:38:44,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:44,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:44,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:44,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:44,503 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:38:44,504 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 62 states, 60 states have (on average 1.3) internal successors, (in total 78), 61 states have internal predecessors, (78), 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 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:44,566 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 62 states, 60 states have (on average 1.3) internal successors, (in total 78), 61 states have internal predecessors, (78), 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 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 120 states and 157 transitions. Complement of second has 6 states. [2025-04-26 18:38:44,567 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 18:38:44,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2025-04-26 18:38:44,576 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:38:44,578 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:44,578 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 9 letters. Loop has 6 letters. [2025-04-26 18:38:44,578 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:44,578 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 3 letters. Loop has 12 letters. [2025-04-26 18:38:44,578 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:44,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 157 transitions. [2025-04-26 18:38:44,583 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 18:38:44,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 44 states and 56 transitions. [2025-04-26 18:38:44,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-04-26 18:38:44,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2025-04-26 18:38:44,586 INFO L74 IsDeterministic]: Start isDeterministic. Operand 44 states and 56 transitions. [2025-04-26 18:38:44,586 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:44,586 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 56 transitions. [2025-04-26 18:38:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 56 transitions. [2025-04-26 18:38:44,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2025-04-26 18:38:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.2682926829268293) internal successors, (in total 52), 40 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2025-04-26 18:38:44,602 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 52 transitions. [2025-04-26 18:38:44,602 INFO L438 stractBuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2025-04-26 18:38:44,602 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:38:44,602 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 52 transitions. [2025-04-26 18:38:44,606 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 18:38:44,606 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:38:44,606 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:38:44,606 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:38:44,606 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:38:44,607 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L43: Formula: (= v_x_11 0) InVars {} OutVars{x=v_x_11} AuxVars[] AssignedVars[x]" "[71] L43-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[54] $Ultimate##0-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[55] L19-1-->thread1FINAL: Formula: (<= v_N_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, N=v_N_2} AuxVars[] AssignedVars[]" "[57] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[74] L43-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_12, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[63] $Ultimate##0-->L33-1: Formula: (= v_thread2Thread1of1ForFork1_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j]" [2025-04-26 18:38:44,607 INFO L754 eck$LassoCheckResult]: Loop: "[65] L33-1-->L34: Formula: (< v_thread2Thread1of1ForFork1_j_5 v_N_3) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, N=v_N_3} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, N=v_N_3} AuxVars[] AssignedVars[]" "[67] L34-->L35: Formula: (= v_x_10 (+ v_x_9 4)) InVars {x=v_x_10} OutVars{x=v_x_9} AuxVars[] AssignedVars[x]" "[68] L35-->L33-1: Formula: (= (+ v_thread2Thread1of1ForFork1_j_7 1) v_thread2Thread1of1ForFork1_j_8) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_8} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j]" [2025-04-26 18:38:44,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:44,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1702542195, now seen corresponding path program 1 times [2025-04-26 18:38:44,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:44,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046446191] [2025-04-26 18:38:44,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:44,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:44,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:44,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:44,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:44,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:44,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:44,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:44,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:44,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:44,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:44,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:44,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:44,615 INFO L85 PathProgramCache]: Analyzing trace with hash 94401, now seen corresponding path program 1 times [2025-04-26 18:38:44,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:44,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232248374] [2025-04-26 18:38:44,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:44,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:44,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:38:44,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:38:44,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:44,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:44,617 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:38:44,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:38:44,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:38:44,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:44,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:38:44,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:38:44,619 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:44,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1165797391, now seen corresponding path program 1 times [2025-04-26 18:38:44,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:38:44,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016886585] [2025-04-26 18:38:44,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:38:44,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:38:44,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:38:44,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:38:44,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:44,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:44,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:44,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:38:44,672 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016886585] [2025-04-26 18:38:44,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016886585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:38:44,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:38:44,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:38:44,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45217008] [2025-04-26 18:38:44,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:38:44,691 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:44,691 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:44,691 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:44,691 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:44,691 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:38:44,691 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:44,691 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:44,691 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:44,691 INFO L132 ssoRankerPreferences]: Filename of dumped script: loop-lockstep-example.bpl_petrified1_Iteration2_Loop [2025-04-26 18:38:44,691 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:44,691 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:44,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:44,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:44,715 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:44,716 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:38:44,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:44,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:44,718 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:44,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:38:44,720 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:38:44,720 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:44,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:44,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:44,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:44,738 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:44,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:38:44,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:38:44,739 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:38:44,803 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:38:44,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:38:44,808 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:38:44,808 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:38:44,808 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:38:44,808 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:38:44,808 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:38:44,808 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:44,808 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:38:44,808 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:38:44,808 INFO L132 ssoRankerPreferences]: Filename of dumped script: loop-lockstep-example.bpl_petrified1_Iteration2_Loop [2025-04-26 18:38:44,808 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:38:44,808 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:38:44,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:44,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:38:44,840 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:38:44,840 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:38:44,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:44,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:44,843 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:44,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:38:44,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:38:44,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:38:44,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:38:44,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:38:44,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:38:44,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:38:44,859 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:38:44,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:38:44,861 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:38:44,863 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:38:44,863 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:38:44,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:38:44,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:44,865 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:38:44,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:38:44,866 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:38:44,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:38:44,869 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:38:44,869 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:38:44,870 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, N) = -1*thread2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2025-04-26 18:38:44,875 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 18:38:44,876 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:38:44,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:38:44,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:38:44,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:38:44,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:44,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:44,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:38:44,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:44,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:38:44,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:38:44,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:38:44,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:38:44,911 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:38:44,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:38:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:38:44,930 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:38:44,930 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 52 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:44,954 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 52 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 73 states and 95 transitions. Complement of second has 6 states. [2025-04-26 18:38:44,954 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 18:38:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2025-04-26 18:38:44,955 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 18:38:44,955 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:44,955 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 18:38:44,955 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:44,955 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 7 letters. Loop has 6 letters. [2025-04-26 18:38:44,955 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:38:44,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 95 transitions. [2025-04-26 18:38:44,956 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:38:44,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 0 states and 0 transitions. [2025-04-26 18:38:44,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:38:44,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:38:44,957 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:38:44,957 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:44,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:38:44,957 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:38:44,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:38:44,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:38:44,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:38:44,958 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (in total 10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:38:44,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:38:44,960 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 18:38:44,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 18:38:44,960 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:38:44,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 18:38:44,960 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:38:44,960 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:38:44,960 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:38:44,960 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:38:44,960 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:38:44,960 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:38:44,960 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:38:44,960 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:38:44,961 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:38:44,961 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:38:44,961 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:38:44,961 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:38:44,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:38:44,973 INFO L201 PluginConnector]: Adding new model loop-lockstep-example.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:38:44 BoogieIcfgContainer [2025-04-26 18:38:44,973 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:38:44,974 INFO L158 Benchmark]: Toolchain (without parser) took 1683.15ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 76.6MB in the end (delta: 5.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2025-04-26 18:38:44,974 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:44,974 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.85ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 80.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:44,974 INFO L158 Benchmark]: Boogie Preprocessor took 23.49ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 79.6MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:38:44,974 INFO L158 Benchmark]: RCFGBuilder took 173.38ms. Allocated memory is still 155.2MB. Free memory was 79.6MB in the beginning and 70.6MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:38:44,974 INFO L158 Benchmark]: BuchiAutomizer took 1448.02ms. Allocated memory is still 155.2MB. Free memory was 70.5MB in the beginning and 76.6MB in the end (delta: -6.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:38:44,975 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.19ms. Allocated memory is still 155.2MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.85ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 80.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.49ms. Allocated memory is still 155.2MB. Free memory was 80.6MB in the beginning and 79.6MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 173.38ms. Allocated memory is still 155.2MB. Free memory was 79.6MB in the beginning and 70.6MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1448.02ms. Allocated memory is still 155.2MB. Free memory was 70.5MB in the beginning and 76.6MB in the end (delta: -6.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 41 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp70 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 43ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 174, Number of transitions in reduction automaton: 78, Number of states in reduction automaton: 62, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:38:44,988 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...