/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/nonblocking-cntr.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:05,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:05,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:05,360 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:05,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:05,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:05,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:05,382 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:05,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:05,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:05,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:05,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:05,385 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:05,385 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:05,385 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:05,385 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:05,385 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:05,385 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:05,385 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:05,385 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:05,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:05,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:05,385 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:05,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:05,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:05,385 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:05,385 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:05,385 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:05,386 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:05,386 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:05,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:05,386 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:05,386 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:05,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:05,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:05,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:05,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:05,386 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:05,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:05,386 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:05,386 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:05,386 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:05,386 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:05,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:05,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:05,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:05,631 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:05,631 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:05,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/nonblocking-cntr.wvr.bpl [2025-04-26 16:56:05,635 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/nonblocking-cntr.wvr.bpl' [2025-04-26 16:56:05,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:05,653 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:05,654 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:05,654 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:05,654 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:05,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nonblocking-cntr.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nonblocking-cntr.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,689 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:05,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:05,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:05,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:05,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:05,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nonblocking-cntr.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nonblocking-cntr.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nonblocking-cntr.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nonblocking-cntr.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,704 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "nonblocking-cntr.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,705 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nonblocking-cntr.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nonblocking-cntr.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "nonblocking-cntr.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nonblocking-cntr.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:05,720 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:05,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:05,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:05,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nonblocking-cntr.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/1) ... [2025-04-26 16:56:05,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:05,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:05,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:05,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:56:05,770 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:05,770 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:05,770 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:05,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:05,771 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:56:05,806 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:05,809 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:05,877 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:05,877 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:05,896 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:05,898 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:05,898 INFO L201 PluginConnector]: Adding new model nonblocking-cntr.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:05 BoogieIcfgContainer [2025-04-26 16:56:05,898 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:05,899 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:05,899 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:05,904 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:05,904 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:05,905 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nonblocking-cntr.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:05" (1/2) ... [2025-04-26 16:56:05,906 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77c811d8 and model type nonblocking-cntr.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:05, skipping insertion in model container [2025-04-26 16:56:05,906 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:05,906 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nonblocking-cntr.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:05" (2/2) ... [2025-04-26 16:56:05,907 INFO L376 chiAutomizerObserver]: Analyzing ICFG nonblocking-cntr.wvr.bpl [2025-04-26 16:56:05,949 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:56:05,982 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:05,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:05,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:05,985 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:05,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:56:06,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 64 flow [2025-04-26 16:56:06,040 INFO L116 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-04-26 16:56:06,041 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:56:06,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 15 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 12. Up to 2 conditions per place. [2025-04-26 16:56:06,043 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 64 flow [2025-04-26 16:56:06,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2025-04-26 16:56:06,046 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 26 places, 21 transitions, 54 flow [2025-04-26 16:56:06,051 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:06,115 WARN L140 AmpleReduction]: Number of pruned transitions: 9 [2025-04-26 16:56:06,115 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:06,115 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 5 [2025-04-26 16:56:06,116 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:19 [2025-04-26 16:56:06,116 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:9 [2025-04-26 16:56:06,116 WARN L145 AmpleReduction]: Times succ was already a loop node:8 [2025-04-26 16:56:06,116 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:56:06,116 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:06,118 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 34 states, 32 states have (on average 1.4375) internal successors, (in total 46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:06,124 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:06,124 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:06,124 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:06,124 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:06,124 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:06,124 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:06,124 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:06,124 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:06,126 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 32 states have (on average 1.4375) internal successors, (in total 46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:06,137 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 15 [2025-04-26 16:56:06,137 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:06,137 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:06,140 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:56:06,141 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:06,141 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:06,141 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 34 states, 32 states have (on average 1.4375) internal successors, (in total 46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:06,143 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 15 [2025-04-26 16:56:06,144 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:06,144 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:06,144 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:56:06,144 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:06,149 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L41: Formula: (= v_j1_5 0) InVars {j1=v_j1_5} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[]" "[44] L41-->L42: Formula: (= v_j2_5 0) InVars {j2=v_j2_5} OutVars{j2=v_j2_5} AuxVars[] AssignedVars[]" "[40] L42-->L43: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[35] L43-->L44: Formula: (= v_M2_3 v_M1_3) InVars {M1=v_M1_3, M2=v_M2_3} OutVars{M1=v_M1_3, M2=v_M2_3} AuxVars[] AssignedVars[]" "[32] L44-->L45: Formula: (< 0 v_M2_4) InVars {M2=v_M2_4} OutVars{M2=v_M2_4} AuxVars[] AssignedVars[]" "[62] L45-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:56:06,150 INFO L754 eck$LassoCheckResult]: Loop: "[53] L19-1-->L19: Formula: (< v_j1_1 v_M1_1) InVars {M1=v_M1_1, j1=v_j1_1} OutVars{M1=v_M1_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[55] L19-->L19-1: Formula: (and (= v_j1_6 (+ v_j1_7 1)) (= v_counter_8 (+ v_counter_9 1))) InVars {counter=v_counter_9, j1=v_j1_7} OutVars{counter=v_counter_8, j1=v_j1_6} AuxVars[] AssignedVars[counter, j1]" [2025-04-26 16:56:06,156 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2048661416, now seen corresponding path program 1 times [2025-04-26 16:56:06,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98038133] [2025-04-26 16:56:06,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:06,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:06,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,217 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:06,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:06,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:06,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:06,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2659, now seen corresponding path program 1 times [2025-04-26 16:56:06,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816447525] [2025-04-26 16:56:06,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,252 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:06,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:06,259 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1668597510, now seen corresponding path program 1 times [2025-04-26 16:56:06,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947018945] [2025-04-26 16:56:06,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:06,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:06,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,270 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:06,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:06,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:06,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:06,343 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:06,344 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:06,344 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:06,344 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:06,344 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:06,344 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,344 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:06,344 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:06,344 INFO L132 ssoRankerPreferences]: Filename of dumped script: nonblocking-cntr.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:06,345 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:06,345 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:06,354 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,403 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:06,404 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:06,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,407 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:56:06,410 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:06,410 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:06,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:56:06,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:56:06,434 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:06,434 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:06,502 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:06,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:06,507 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:06,507 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:06,507 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:06,507 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:06,507 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:06,507 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,507 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:06,507 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:06,507 INFO L132 ssoRankerPreferences]: Filename of dumped script: nonblocking-cntr.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:06,507 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:06,507 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:06,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:06,553 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:06,556 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:06,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,577 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:56:06,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:06,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:06,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:06,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:06,591 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:06,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:06,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:06,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:06,599 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:06,604 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:56:06,604 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:06,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:06,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:06,607 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:06,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:56:06,610 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:06,612 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:56:06,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:06,613 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:06,614 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:06,614 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M1, j1) = 1*M1 - 1*j1 Supporting invariants [] [2025-04-26 16:56:06,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:06,622 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:06,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:06,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:06,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:06,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:06,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:06,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:06,702 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:06,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:06,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:06,746 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:06,748 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 34 states, 32 states have (on average 1.4375) internal successors, (in total 46), 33 states have internal predecessors, (46), 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 16:56:06,848 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 34 states, 32 states have (on average 1.4375) internal successors, (in total 46), 33 states have internal predecessors, (46), 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 65 states and 92 transitions. Complement of second has 7 states. [2025-04-26 16:56:06,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2025-04-26 16:56:06,856 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:56:06,857 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:06,857 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:56:06,857 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:06,857 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:56:06,857 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:06,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 92 transitions. [2025-04-26 16:56:06,861 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 16:56:06,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 25 states and 35 transitions. [2025-04-26 16:56:06,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-04-26 16:56:06,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-04-26 16:56:06,863 INFO L74 IsDeterministic]: Start isDeterministic. Operand 25 states and 35 transitions. [2025-04-26 16:56:06,863 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:06,863 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 35 transitions. [2025-04-26 16:56:06,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 35 transitions. [2025-04-26 16:56:06,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-04-26 16:56:06,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.434782608695652) internal successors, (in total 33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:06,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2025-04-26 16:56:06,878 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 33 transitions. [2025-04-26 16:56:06,878 INFO L438 stractBuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2025-04-26 16:56:06,878 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:06,878 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2025-04-26 16:56:06,879 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 16:56:06,879 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:06,879 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:06,879 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:06,879 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:06,879 INFO L752 eck$LassoCheckResult]: Stem: "[46] $Ultimate##0-->L41: Formula: (= v_j1_5 0) InVars {j1=v_j1_5} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[]" "[44] L41-->L42: Formula: (= v_j2_5 0) InVars {j2=v_j2_5} OutVars{j2=v_j2_5} AuxVars[] AssignedVars[]" "[40] L42-->L43: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[35] L43-->L44: Formula: (= v_M2_3 v_M1_3) InVars {M1=v_M1_3, M2=v_M2_3} OutVars{M1=v_M1_3, M2=v_M2_3} AuxVars[] AssignedVars[]" "[32] L44-->L45: Formula: (< 0 v_M2_4) InVars {M2=v_M2_4} OutVars{M2=v_M2_4} AuxVars[] AssignedVars[]" "[62] L45-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[53] L19-1-->L19: Formula: (< v_j1_1 v_M1_1) InVars {M1=v_M1_1, j1=v_j1_1} OutVars{M1=v_M1_1, j1=v_j1_1} AuxVars[] AssignedVars[]" "[65] L45-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:56:06,880 INFO L754 eck$LassoCheckResult]: Loop: "[57] L30-1-->L30: Formula: (< v_j2_1 v_M2_1) InVars {j2=v_j2_1, M2=v_M2_1} OutVars{j2=v_j2_1, M2=v_M2_1} AuxVars[] AssignedVars[]" "[59] L30-->L30-1: Formula: (let ((.cse0 (< 0 v_counter_13))) (and (= v_j2_6 (ite .cse0 (+ v_j2_7 1) v_j2_7)) (= v_counter_12 (ite .cse0 (+ v_counter_13 (- 1)) v_counter_13)))) InVars {j2=v_j2_7, counter=v_counter_13} OutVars{j2=v_j2_6, counter=v_counter_12} AuxVars[] AssignedVars[counter, j2]" [2025-04-26 16:56:06,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1668597500, now seen corresponding path program 1 times [2025-04-26 16:56:06,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704248668] [2025-04-26 16:56:06,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:06,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:06,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:06,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:06,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:06,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:06,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2787, now seen corresponding path program 1 times [2025-04-26 16:56:06,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866558902] [2025-04-26 16:56:06,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,894 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:06,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:06,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:06,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:06,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:06,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1499394266, now seen corresponding path program 1 times [2025-04-26 16:56:06,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:06,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168983797] [2025-04-26 16:56:06,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:06,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:06,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:56:06,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:56:06,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,916 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:06,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:56:06,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:56:06,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:06,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:06,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:07,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:07,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:07,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,107 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:07,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:07,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:07,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:07,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:07,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:56:07,141 INFO L201 PluginConnector]: Adding new model nonblocking-cntr.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:07 BoogieIcfgContainer [2025-04-26 16:56:07,142 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:07,142 INFO L158 Benchmark]: Toolchain (without parser) took 1489.29ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 92.5MB in the beginning and 89.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:07,143 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.79ms. Allocated memory is still 167.8MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:07,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.15ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 90.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:07,145 INFO L158 Benchmark]: Boogie Preprocessor took 26.13ms. Allocated memory is still 167.8MB. Free memory was 90.5MB in the beginning and 89.5MB in the end (delta: 977.0kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:07,145 INFO L158 Benchmark]: RCFGBuilder took 178.66ms. Allocated memory is still 167.8MB. Free memory was 89.5MB in the beginning and 80.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:07,145 INFO L158 Benchmark]: BuchiAutomizer took 1242.63ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 80.1MB in the beginning and 89.7MB in the end (delta: -9.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:07,148 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.79ms. Allocated memory is still 167.8MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.15ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 90.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.13ms. Allocated memory is still 167.8MB. Free memory was 90.5MB in the beginning and 89.5MB in the end (delta: 977.0kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 178.66ms. Allocated memory is still 167.8MB. Free memory was 89.5MB in the beginning and 80.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1242.63ms. Allocated memory was 167.8MB in the beginning and 155.2MB in the end (delta: -12.6MB). Free memory was 80.1MB in the beginning and 89.7MB in the end (delta: -9.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 11 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax100 hnf100 lsp70 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 57ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 141, Number of transitions in reduction automaton: 46, Number of states in reduction automaton: 34, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * j1 + M1 and consists of 5 locations. The remainder module has 23 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 29]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L40] 0 assume j1 == 0; VAL [j1=0] [L41] 0 assume j2 == 0; VAL [j1=0, j2=0] [L42] 0 assume counter == 0; VAL [counter=0, j1=0, j2=0] [L43] 0 assume M2 == M1; VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L44] 0 assume 0 < M2; VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L45] FORK 0 fork 1 thread1(); VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L18] COND TRUE 1 j1 < M1 VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L46] FORK 0 fork 2, 2 thread2(); VAL [M1=1, M2=1, counter=0, j1=0, j2=0] Loop: [L29] COND TRUE j2 < M2 [L31] j2 := (if 0 < counter then j2 + 1 else j2); [L32] counter := (if 0 < counter then counter - 1 else counter); End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L40] 0 assume j1 == 0; VAL [j1=0] [L41] 0 assume j2 == 0; VAL [j1=0, j2=0] [L42] 0 assume counter == 0; VAL [counter=0, j1=0, j2=0] [L43] 0 assume M2 == M1; VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L44] 0 assume 0 < M2; VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L45] FORK 0 fork 1 thread1(); VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L18] COND TRUE 1 j1 < M1 VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L46] FORK 0 fork 2, 2 thread2(); VAL [M1=1, M2=1, counter=0, j1=0, j2=0] Loop: [L29] COND TRUE j2 < M2 [L31] j2 := (if 0 < counter then j2 + 1 else j2); [L32] counter := (if 0 < counter then counter - 1 else counter); End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:56:07,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...