/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/threaded-sum-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:52,292 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:52,337 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:52,341 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:52,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:52,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:40:52,341 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:52,359 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:52,360 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:52,360 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:52,360 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:52,360 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:52,360 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:52,360 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:52,360 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:52,360 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:52,360 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:52,360 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:52,361 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:52,361 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:52,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:52,361 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:52,361 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:52,361 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:52,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:52,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:52,361 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:52,361 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:52,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:52,361 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:52,361 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:52,361 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:52,361 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:52,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:52,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:52,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:52,362 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:52,362 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:52,362 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:52,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:52,362 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:52,362 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:52,362 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:52,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:52,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:52,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:52,586 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:52,586 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:52,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/threaded-sum-2.wvr.bpl [2025-04-26 18:40:52,588 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/threaded-sum-2.wvr.bpl' [2025-04-26 18:40:52,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:52,607 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:52,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:52,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:52,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:52,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threaded-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:52" (1/1) ... [2025-04-26 18:40:52,637 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threaded-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:52" (1/1) ... [2025-04-26 18:40:52,642 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:52,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:52,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:52,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:52,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:52,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threaded-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:52" (1/1) ... [2025-04-26 18:40:52,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threaded-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:52" (1/1) ... [2025-04-26 18:40:52,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threaded-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:52" (1/1) ... [2025-04-26 18:40:52,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threaded-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:52" (1/1) ... [2025-04-26 18:40:52,653 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "threaded-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:52" (1/1) ... [2025-04-26 18:40:52,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threaded-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:52" (1/1) ... [2025-04-26 18:40:52,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threaded-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:52" (1/1) ... [2025-04-26 18:40:52,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "threaded-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:52" (1/1) ... [2025-04-26 18:40:52,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threaded-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:52" (1/1) ... [2025-04-26 18:40:52,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:52,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:52,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:52,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:52,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threaded-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:52" (1/1) ... [2025-04-26 18:40:52,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:52,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:52,699 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:52,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:40:52,723 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:52,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:52,723 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:52,723 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:52,723 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:52,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:52,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:52,724 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:40:52,759 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:52,760 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:52,844 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:52,845 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:52,865 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:52,865 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:40:52,866 INFO L201 PluginConnector]: Adding new model threaded-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:52 BoogieIcfgContainer [2025-04-26 18:40:52,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:52,867 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:52,867 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:52,871 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:52,871 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:52,871 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "threaded-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:52" (1/2) ... [2025-04-26 18:40:52,873 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24483ec9 and model type threaded-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:52, skipping insertion in model container [2025-04-26 18:40:52,873 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:52,873 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "threaded-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:52" (2/2) ... [2025-04-26 18:40:52,874 INFO L376 chiAutomizerObserver]: Analyzing ICFG threaded-sum-2.wvr.bpl [2025-04-26 18:40:52,920 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:40:52,958 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:52,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:52,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:52,961 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:52,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:40:53,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 27 transitions, 68 flow [2025-04-26 18:40:53,028 INFO L116 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-04-26 18:40:53,032 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:40:53,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 3/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 21 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2025-04-26 18:40:53,035 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 27 transitions, 68 flow [2025-04-26 18:40:53,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 23 transitions, 58 flow [2025-04-26 18:40:53,039 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 27 places, 23 transitions, 58 flow [2025-04-26 18:40:53,040 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 23 transitions, 58 flow [2025-04-26 18:40:53,053 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 40 states, 38 states have (on average 1.9736842105263157) internal successors, (in total 75), 39 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:53,054 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 40 states, 38 states have (on average 1.9736842105263157) internal successors, (in total 75), 39 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:53,055 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:53,131 WARN L140 AmpleReduction]: Number of pruned transitions: 12 [2025-04-26 18:40:53,131 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:40:53,131 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3 [2025-04-26 18:40:53,131 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:26 [2025-04-26 18:40:53,131 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:10 [2025-04-26 18:40:53,131 WARN L145 AmpleReduction]: Times succ was already a loop node:12 [2025-04-26 18:40:53,131 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:4 [2025-04-26 18:40:53,131 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:53,132 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 40 states, 38 states have (on average 1.6578947368421053) internal successors, (in total 63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:53,139 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:53,139 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:53,139 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:53,139 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:53,139 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:53,139 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:53,139 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:53,140 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:53,141 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 40 states, 38 states have (on average 1.6578947368421053) internal successors, (in total 63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:53,153 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:40:53,154 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:53,154 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:53,157 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:40:53,157 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:53,157 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:53,158 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 40 states, 38 states have (on average 1.6578947368421053) internal successors, (in total 63), 39 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:53,161 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 21 [2025-04-26 18:40:53,161 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:53,161 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:53,162 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:40:53,162 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:53,166 INFO L752 eck$LassoCheckResult]: Stem: "[53] $Ultimate##0-->L46: Formula: (= v_m_3 0) InVars {m=v_m_3} OutVars{m=v_m_3} AuxVars[] AssignedVars[]" "[54] L46-->L47: Formula: (< 0 v_t_7) InVars {t=v_t_7} OutVars{t=v_t_7} AuxVars[] AssignedVars[]" "[39] L47-->L48: Formula: (< 0 v_s_9) InVars {s=v_s_9} OutVars{s=v_s_9} AuxVars[] AssignedVars[]" "[57] L48-->L49: Formula: (= v_T_1 v_t_8) InVars {t=v_t_8, T=v_T_1} OutVars{t=v_t_8, T=v_T_1} AuxVars[] AssignedVars[]" "[52] L49-->L50: Formula: (= v_s_10 v_S_1) InVars {s=v_s_10, S=v_S_1} OutVars{s=v_s_10, S=v_S_1} AuxVars[] AssignedVars[]" "[72] L50-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:40:53,168 INFO L754 eck$LassoCheckResult]: Loop: "[61] L20-1-->L20: Formula: (or (< 0 v_s_1) (< 0 v_t_1)) InVars {t=v_t_1, s=v_s_1} OutVars{t=v_t_1, s=v_s_1} AuxVars[] AssignedVars[]" "[64] L20-->L20-1: Formula: (and (= v_s_16 (+ v_s_15 1)) (< 0 v_s_16) (= (+ v_m_10 1) v_m_9)) InVars {m=v_m_10, s=v_s_16} OutVars{m=v_m_9, s=v_s_15} AuxVars[] AssignedVars[m, s]" [2025-04-26 18:40:53,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:53,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1839030168, now seen corresponding path program 1 times [2025-04-26 18:40:53,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:53,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241333474] [2025-04-26 18:40:53,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:53,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:53,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:53,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:53,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,233 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:53,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:53,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:53,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:53,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:53,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2916, now seen corresponding path program 1 times [2025-04-26 18:40:53,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:53,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975060755] [2025-04-26 18:40:53,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:53,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:53,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:53,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:53,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,261 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:53,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:53,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:53,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,264 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:53,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:53,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2076430837, now seen corresponding path program 1 times [2025-04-26 18:40:53,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:53,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386318148] [2025-04-26 18:40:53,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:53,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:53,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:53,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:53,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,273 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:53,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:40:53,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:40:53,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:53,340 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:53,341 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:53,341 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:53,341 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:53,341 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:53,341 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,341 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:53,341 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:53,342 INFO L132 ssoRankerPreferences]: Filename of dumped script: threaded-sum-2.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:40:53,342 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:53,342 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:53,368 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,417 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:53,418 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:53,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,420 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:53,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:40:53,422 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:53,422 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:53,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:40:53,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,441 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:53,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:40:53,444 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:53,444 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:53,474 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:40:53,475 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {m=0} Honda state: {m=0} Generalized eigenvectors: [{m=7}, {m=1}, {m=-7}] Lambdas: [1, 8, 1] Nus: [0, 1] [2025-04-26 18:40:53,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:40:53,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,482 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:53,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:40:53,483 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:53,484 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:53,501 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:40:53,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,503 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:53,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:40:53,504 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:53,504 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:53,527 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:53,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:40:53,531 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:53,531 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:53,531 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:53,531 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:53,531 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:53,531 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,531 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:53,531 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:53,532 INFO L132 ssoRankerPreferences]: Filename of dumped script: threaded-sum-2.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:40:53,532 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:53,532 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:53,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:53,595 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:53,598 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:53,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,602 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:53,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:40:53,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:40:53,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:40:53,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:40:53,624 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:53,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:40:53,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,632 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:53,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:40:53,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:53,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:53,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:40:53,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:53,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:53,644 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:53,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:40:53,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:40:53,647 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:53,650 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:40:53,650 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:40:53,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:53,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:53,668 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:53,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:40:53,670 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:53,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:40:53,673 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:40:53,673 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:53,673 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(s) = 1*s Supporting invariants [] [2025-04-26 18:40:53,679 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:40:53,681 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:53,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:53,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:53,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:53,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:53,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:53,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:53,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:53,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:53,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:53,739 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:53,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:53,784 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:40:53,786 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 40 states, 38 states have (on average 1.6578947368421053) internal successors, (in total 63), 39 states have internal predecessors, (63), 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.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 18:40:53,833 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 40 states, 38 states have (on average 1.6578947368421053) internal successors, (in total 63), 39 states have internal predecessors, (63), 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.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 102 states and 171 transitions. Complement of second has 6 states. [2025-04-26 18:40:53,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:53,837 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 18:40:53,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2025-04-26 18:40:53,840 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:40:53,840 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:53,840 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:40:53,840 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:53,840 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:40:53,840 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:53,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 102 states and 171 transitions. [2025-04-26 18:40:53,844 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 27 [2025-04-26 18:40:53,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 102 states to 64 states and 117 transitions. [2025-04-26 18:40:53,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-04-26 18:40:53,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-04-26 18:40:53,847 INFO L74 IsDeterministic]: Start isDeterministic. Operand 64 states and 117 transitions. [2025-04-26 18:40:53,847 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:53,847 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 117 transitions. [2025-04-26 18:40:53,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 117 transitions. [2025-04-26 18:40:53,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2025-04-26 18:40:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.9230769230769231) internal successors, (in total 100), 51 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 100 transitions. [2025-04-26 18:40:53,863 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 100 transitions. [2025-04-26 18:40:53,863 INFO L438 stractBuchiCegarLoop]: Abstraction has 52 states and 100 transitions. [2025-04-26 18:40:53,863 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:53,863 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 100 transitions. [2025-04-26 18:40:53,864 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 27 [2025-04-26 18:40:53,864 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:53,864 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:53,865 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:53,865 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:53,865 INFO L752 eck$LassoCheckResult]: Stem: "[53] $Ultimate##0-->L46: Formula: (= v_m_3 0) InVars {m=v_m_3} OutVars{m=v_m_3} AuxVars[] AssignedVars[]" "[54] L46-->L47: Formula: (< 0 v_t_7) InVars {t=v_t_7} OutVars{t=v_t_7} AuxVars[] AssignedVars[]" "[39] L47-->L48: Formula: (< 0 v_s_9) InVars {s=v_s_9} OutVars{s=v_s_9} AuxVars[] AssignedVars[]" "[57] L48-->L49: Formula: (= v_T_1 v_t_8) InVars {t=v_t_8, T=v_T_1} OutVars{t=v_t_8, T=v_T_1} AuxVars[] AssignedVars[]" "[52] L49-->L50: Formula: (= v_s_10 v_S_1) InVars {s=v_s_10, S=v_S_1} OutVars{s=v_s_10, S=v_S_1} AuxVars[] AssignedVars[]" "[72] L50-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[61] L20-1-->L20: Formula: (or (< 0 v_s_1) (< 0 v_t_1)) InVars {t=v_t_1, s=v_s_1} OutVars{t=v_t_1, s=v_s_1} AuxVars[] AssignedVars[]" [2025-04-26 18:40:53,865 INFO L754 eck$LassoCheckResult]: Loop: "[63] L20-->L20-1: Formula: (<= v_s_5 0) InVars {s=v_s_5} OutVars{s=v_s_5} AuxVars[] AssignedVars[]" "[61] L20-1-->L20: Formula: (or (< 0 v_s_1) (< 0 v_t_1)) InVars {t=v_t_1, s=v_s_1} OutVars{t=v_t_1, s=v_s_1} AuxVars[] AssignedVars[]" [2025-04-26 18:40:53,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:53,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1175360299, now seen corresponding path program 1 times [2025-04-26 18:40:53,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:53,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223207619] [2025-04-26 18:40:53,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:53,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:53,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:53,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:53,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,872 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:53,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:53,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:53,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:53,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:53,881 INFO L85 PathProgramCache]: Analyzing trace with hash 2975, now seen corresponding path program 1 times [2025-04-26 18:40:53,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:53,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575855605] [2025-04-26 18:40:53,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:53,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:53,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:53,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:53,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,887 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:53,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:53,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:53,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:53,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:53,889 INFO L85 PathProgramCache]: Analyzing trace with hash 55153523, now seen corresponding path program 1 times [2025-04-26 18:40:53,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:53,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140575718] [2025-04-26 18:40:53,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:53,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:53,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:53,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:53,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:53,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:53,924 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140575718] [2025-04-26 18:40:53,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140575718] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:53,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:53,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:40:53,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422032686] [2025-04-26 18:40:53,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:53,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:53,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:40:53,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:40:53,945 INFO L87 Difference]: Start difference. First operand 52 states and 100 transitions. cyclomatic complexity: 62 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:53,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:53,965 INFO L93 Difference]: Finished difference Result 80 states and 140 transitions. [2025-04-26 18:40:53,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 140 transitions. [2025-04-26 18:40:53,967 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 33 [2025-04-26 18:40:53,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 76 states and 135 transitions. [2025-04-26 18:40:53,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2025-04-26 18:40:53,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2025-04-26 18:40:53,968 INFO L74 IsDeterministic]: Start isDeterministic. Operand 76 states and 135 transitions. [2025-04-26 18:40:53,968 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:53,968 INFO L218 hiAutomatonCegarLoop]: Abstraction has 76 states and 135 transitions. [2025-04-26 18:40:53,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 135 transitions. [2025-04-26 18:40:53,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-04-26 18:40:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.7763157894736843) internal successors, (in total 135), 75 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 135 transitions. [2025-04-26 18:40:53,973 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 135 transitions. [2025-04-26 18:40:53,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:40:53,975 INFO L438 stractBuchiCegarLoop]: Abstraction has 76 states and 135 transitions. [2025-04-26 18:40:53,975 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:53,975 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 135 transitions. [2025-04-26 18:40:53,976 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 33 [2025-04-26 18:40:53,976 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:53,976 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:53,976 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:53,976 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:40:53,976 INFO L752 eck$LassoCheckResult]: Stem: "[53] $Ultimate##0-->L46: Formula: (= v_m_3 0) InVars {m=v_m_3} OutVars{m=v_m_3} AuxVars[] AssignedVars[]" "[54] L46-->L47: Formula: (< 0 v_t_7) InVars {t=v_t_7} OutVars{t=v_t_7} AuxVars[] AssignedVars[]" "[39] L47-->L48: Formula: (< 0 v_s_9) InVars {s=v_s_9} OutVars{s=v_s_9} AuxVars[] AssignedVars[]" "[57] L48-->L49: Formula: (= v_T_1 v_t_8) InVars {t=v_t_8, T=v_T_1} OutVars{t=v_t_8, T=v_T_1} AuxVars[] AssignedVars[]" "[52] L49-->L50: Formula: (= v_s_10 v_S_1) InVars {s=v_s_10, S=v_S_1} OutVars{s=v_s_10, S=v_S_1} AuxVars[] AssignedVars[]" "[72] L50-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[75] L50-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[66] L36-->L37: Formula: (< 0 v_t_3) InVars {t=v_t_3} OutVars{t=v_t_3} AuxVars[] AssignedVars[]" "[68] L37-->L38: Formula: (= (+ v_s_8 1) v_s_7) InVars {s=v_s_8} OutVars{s=v_s_7} AuxVars[] AssignedVars[s]" [2025-04-26 18:40:53,977 INFO L754 eck$LassoCheckResult]: Loop: "[69] L38-->L36: Formula: (= v_t_5 (+ v_t_4 1)) InVars {t=v_t_5} OutVars{t=v_t_4} AuxVars[] AssignedVars[t]" "[66] L36-->L37: Formula: (< 0 v_t_3) InVars {t=v_t_3} OutVars{t=v_t_3} AuxVars[] AssignedVars[]" "[68] L37-->L38: Formula: (= (+ v_s_8 1) v_s_7) InVars {s=v_s_8} OutVars{s=v_s_7} AuxVars[] AssignedVars[s]" [2025-04-26 18:40:53,977 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:53,977 INFO L85 PathProgramCache]: Analyzing trace with hash 55167077, now seen corresponding path program 1 times [2025-04-26 18:40:53,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:53,977 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280678459] [2025-04-26 18:40:53,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:53,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:53,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:53,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:53,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,982 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:53,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:53,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:53,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:53,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:53,985 INFO L85 PathProgramCache]: Analyzing trace with hash 98214, now seen corresponding path program 1 times [2025-04-26 18:40:53,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:53,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429591183] [2025-04-26 18:40:53,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:53,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:53,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:53,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:53,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,988 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:53,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:53,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:53,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:53,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:53,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1490015038, now seen corresponding path program 1 times [2025-04-26 18:40:53,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:53,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008160164] [2025-04-26 18:40:53,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:53,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:53,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:40:53,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:40:53,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,995 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:53,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:40:53,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:40:53,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:53,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:53,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:54,017 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:54,017 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:54,017 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:54,017 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:54,017 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:40:54,017 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:54,017 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:54,017 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:54,017 INFO L132 ssoRankerPreferences]: Filename of dumped script: threaded-sum-2.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:40:54,017 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:54,017 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:54,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:54,023 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:54,042 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:54,042 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:40:54,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:54,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:54,044 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:54,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:40:54,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:40:54,047 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:54,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:40:54,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:54,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:54,065 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:54,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:40:54,066 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:40:54,066 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:40:54,100 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:40:54,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:40:54,104 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:54,104 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:54,104 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:54,104 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:54,104 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:54,104 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:54,105 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:54,105 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:54,105 INFO L132 ssoRankerPreferences]: Filename of dumped script: threaded-sum-2.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:40:54,105 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:54,105 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:54,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:54,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:54,132 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:54,132 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:54,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:54,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:54,134 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:54,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:40:54,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:40:54,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:54,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:40:54,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:54,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:54,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:54,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:40:54,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:40:54,150 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:54,152 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 18:40:54,152 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:40:54,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:54,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:54,154 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:54,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:40:54,155 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:54,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:40:54,159 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:40:54,159 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:54,159 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(t) = 1*t Supporting invariants [] [2025-04-26 18:40:54,164 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:40:54,165 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:54,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:54,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:54,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:54,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:54,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:54,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:54,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:54,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:54,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:54,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:54,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:54,205 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:54,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:40:54,249 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:40:54,250 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 135 transitions. cyclomatic complexity: 75 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:54,282 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 135 transitions. cyclomatic complexity: 75. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 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 129 states and 248 transitions. Complement of second has 6 states. [2025-04-26 18:40:54,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 18:40:54,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:54,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2025-04-26 18:40:54,283 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 9 letters. Loop has 3 letters. [2025-04-26 18:40:54,283 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:54,283 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 12 letters. Loop has 3 letters. [2025-04-26 18:40:54,283 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:54,283 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 9 letters. Loop has 6 letters. [2025-04-26 18:40:54,283 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:54,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 248 transitions. [2025-04-26 18:40:54,285 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2025-04-26 18:40:54,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 92 states and 182 transitions. [2025-04-26 18:40:54,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2025-04-26 18:40:54,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-04-26 18:40:54,286 INFO L74 IsDeterministic]: Start isDeterministic. Operand 92 states and 182 transitions. [2025-04-26 18:40:54,287 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:54,287 INFO L218 hiAutomatonCegarLoop]: Abstraction has 92 states and 182 transitions. [2025-04-26 18:40:54,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 182 transitions. [2025-04-26 18:40:54,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2025-04-26 18:40:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 2.0) internal successors, (in total 166), 82 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 166 transitions. [2025-04-26 18:40:54,290 INFO L240 hiAutomatonCegarLoop]: Abstraction has 83 states and 166 transitions. [2025-04-26 18:40:54,290 INFO L438 stractBuchiCegarLoop]: Abstraction has 83 states and 166 transitions. [2025-04-26 18:40:54,290 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:40:54,290 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 166 transitions. [2025-04-26 18:40:54,291 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2025-04-26 18:40:54,291 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:54,291 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:54,292 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:40:54,292 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:40:54,292 INFO L752 eck$LassoCheckResult]: Stem: "[53] $Ultimate##0-->L46: Formula: (= v_m_3 0) InVars {m=v_m_3} OutVars{m=v_m_3} AuxVars[] AssignedVars[]" "[54] L46-->L47: Formula: (< 0 v_t_7) InVars {t=v_t_7} OutVars{t=v_t_7} AuxVars[] AssignedVars[]" "[39] L47-->L48: Formula: (< 0 v_s_9) InVars {s=v_s_9} OutVars{s=v_s_9} AuxVars[] AssignedVars[]" "[57] L48-->L49: Formula: (= v_T_1 v_t_8) InVars {t=v_t_8, T=v_T_1} OutVars{t=v_t_8, T=v_T_1} AuxVars[] AssignedVars[]" "[52] L49-->L50: Formula: (= v_s_10 v_S_1) InVars {s=v_s_10, S=v_S_1} OutVars{s=v_s_10, S=v_S_1} AuxVars[] AssignedVars[]" "[72] L50-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[61] L20-1-->L20: Formula: (or (< 0 v_s_1) (< 0 v_t_1)) InVars {t=v_t_1, s=v_s_1} OutVars{t=v_t_1, s=v_s_1} AuxVars[] AssignedVars[]" "[64] L20-->L20-1: Formula: (and (= v_s_16 (+ v_s_15 1)) (< 0 v_s_16) (= (+ v_m_10 1) v_m_9)) InVars {m=v_m_10, s=v_s_16} OutVars{m=v_m_9, s=v_s_15} AuxVars[] AssignedVars[m, s]" "[61] L20-1-->L20: Formula: (or (< 0 v_s_1) (< 0 v_t_1)) InVars {t=v_t_1, s=v_s_1} OutVars{t=v_t_1, s=v_s_1} AuxVars[] AssignedVars[]" [2025-04-26 18:40:54,292 INFO L754 eck$LassoCheckResult]: Loop: "[63] L20-->L20-1: Formula: (<= v_s_5 0) InVars {s=v_s_5} OutVars{s=v_s_5} AuxVars[] AssignedVars[]" "[61] L20-1-->L20: Formula: (or (< 0 v_s_1) (< 0 v_t_1)) InVars {t=v_t_1, s=v_s_1} OutVars{t=v_t_1, s=v_s_1} AuxVars[] AssignedVars[]" [2025-04-26 18:40:54,292 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:54,292 INFO L85 PathProgramCache]: Analyzing trace with hash 55153554, now seen corresponding path program 2 times [2025-04-26 18:40:54,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:54,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849422541] [2025-04-26 18:40:54,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:54,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:54,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-26 18:40:54,298 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:54,298 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:40:54,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:54,298 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:54,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:54,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:54,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:54,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:54,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:54,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:54,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2975, now seen corresponding path program 2 times [2025-04-26 18:40:54,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:54,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925258931] [2025-04-26 18:40:54,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:54,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:54,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:54,305 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:54,305 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:54,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:54,305 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:54,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:54,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:54,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:54,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:54,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:54,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:54,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1462959856, now seen corresponding path program 1 times [2025-04-26 18:40:54,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:54,307 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250728104] [2025-04-26 18:40:54,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:54,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:54,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:54,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:54,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:54,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:54,310 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:54,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:40:54,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:40:54,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:54,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:54,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:54,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:54,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:54,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:54,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:54,410 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:54,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:40:54,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:40:54,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:54,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:54,440 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:40:54,447 INFO L201 PluginConnector]: Adding new model threaded-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:54 BoogieIcfgContainer [2025-04-26 18:40:54,447 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:54,448 INFO L158 Benchmark]: Toolchain (without parser) took 1840.66ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 85.5MB in the beginning and 51.8MB in the end (delta: 33.7MB). Peak memory consumption was 20.5MB. Max. memory is 8.0GB. [2025-04-26 18:40:54,448 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.78ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:54,448 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.47ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 83.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:54,449 INFO L158 Benchmark]: Boogie Preprocessor took 21.94ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 82.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:54,449 INFO L158 Benchmark]: RCFGBuilder took 199.31ms. Allocated memory is still 159.4MB. Free memory was 82.5MB in the beginning and 73.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:40:54,449 INFO L158 Benchmark]: BuchiAutomizer took 1580.90ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.2MB in the beginning and 51.8MB in the end (delta: 21.4MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2025-04-26 18:40:54,450 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.78ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.47ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 83.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 21.94ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 82.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 199.31ms. Allocated memory is still 159.4MB. Free memory was 82.5MB in the beginning and 73.2MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1580.90ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.2MB in the beginning and 51.8MB in the end (delta: 21.4MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 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, 51 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 40 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT2 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp66 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 177, Number of transitions in reduction automaton: 63, Number of states in reduction automaton: 40, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function s and consists of 4 locations. One deterministic module has affine ranking function t and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 83 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 20]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L45] 0 assume m == 0; VAL [m=0] [L46] 0 assume 0 < t; VAL [m=0, t=1] [L47] 0 assume 0 < s; VAL [m=0, s=1, t=1] [L48] 0 assume t == T; VAL [T=1, m=0, s=1, t=1] [L49] 0 assume s == S; VAL [S=1, T=1, m=0, s=1, t=1] [L50] FORK 0 fork 1 thread1(); VAL [S=1, T=1, m=0, s=1, t=1] [L19] COND TRUE 1 0 < s || 0 < t VAL [S=1, T=1, m=0, s=1, t=1] [L22] 1 assume 0 < s; [L23] 1 s := s - 1; [L24] 1 m := m + 1; VAL [S=1, T=1, m=1, s=0, t=1] [L19] COND TRUE 1 0 < s || 0 < t VAL [S=1, T=1, m=1, s=0, t=1] Loop: [L28] assume !(0 < s); [L19] COND TRUE 0 < s || 0 < t End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 20]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L45] 0 assume m == 0; VAL [m=0] [L46] 0 assume 0 < t; VAL [m=0, t=1] [L47] 0 assume 0 < s; VAL [m=0, s=1, t=1] [L48] 0 assume t == T; VAL [T=1, m=0, s=1, t=1] [L49] 0 assume s == S; VAL [S=1, T=1, m=0, s=1, t=1] [L50] FORK 0 fork 1 thread1(); VAL [S=1, T=1, m=0, s=1, t=1] [L19] COND TRUE 1 0 < s || 0 < t VAL [S=1, T=1, m=0, s=1, t=1] [L22] 1 assume 0 < s; [L23] 1 s := s - 1; [L24] 1 m := m + 1; VAL [S=1, T=1, m=1, s=0, t=1] [L19] COND TRUE 1 0 < s || 0 < t VAL [S=1, T=1, m=1, s=0, t=1] Loop: [L28] assume !(0 < s); [L19] COND TRUE 0 < s || 0 < t End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:40:54,462 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...