/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/nonblocking-counter-alt2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:55:46,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:55:46,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:55:46,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:55:46,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:55:46,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:55:46,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:55:46,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:55:46,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:55:46,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:55:46,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:55:46,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:55:46,747 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:55:46,747 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:55:46,747 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:55:46,747 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:55:46,747 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:55:46,748 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:55:46,748 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:55:46,748 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:55:46,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:55:46,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:55:46,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:55:46,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:55:46,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:55:46,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:55:46,748 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:55:46,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:55:46,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:55:46,748 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:55:46,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:55:46,748 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:55:46,748 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:55:46,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:55:46,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:55:46,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:46,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:55:46,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:55:46,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:55:46,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:55:46,749 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:55:46,749 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:55:46,749 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:55:46,948 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:55:46,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:55:46,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:55:46,956 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:55:46,956 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:55:46,957 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/nonblocking-counter-alt2.wvr.bpl [2025-04-26 16:55:46,957 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/nonblocking-counter-alt2.wvr.bpl' [2025-04-26 16:55:46,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:55:46,979 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:55:46,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:46,980 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:55:46,980 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:55:46,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:46" (1/1) ... [2025-04-26 16:55:47,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:46" (1/1) ... [2025-04-26 16:55:47,016 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:55:47,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:55:47,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:55:47,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:55:47,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:55:47,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:46" (1/1) ... [2025-04-26 16:55:47,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:46" (1/1) ... [2025-04-26 16:55:47,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:46" (1/1) ... [2025-04-26 16:55:47,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:46" (1/1) ... [2025-04-26 16:55:47,024 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:46" (1/1) ... [2025-04-26 16:55:47,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:46" (1/1) ... [2025-04-26 16:55:47,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:46" (1/1) ... [2025-04-26 16:55:47,026 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:46" (1/1) ... [2025-04-26 16:55:47,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:46" (1/1) ... [2025-04-26 16:55:47,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:55:47,035 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:55:47,035 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:55:47,035 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:55:47,037 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:46" (1/1) ... [2025-04-26 16:55:47,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:55:47,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:47,062 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:55:47,066 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:55:47,087 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:55:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:55:47,087 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:55:47,087 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:55:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:55:47,087 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:55:47,087 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:55:47,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:55:47,087 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:55:47,088 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:55:47,122 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:55:47,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:55:47,193 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:55:47,193 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:55:47,213 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:55:47,213 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:55:47,214 INFO L201 PluginConnector]: Adding new model nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:47 BoogieIcfgContainer [2025-04-26 16:55:47,214 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:55:47,215 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:55:47,215 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:55:47,219 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:55:47,220 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:47,220 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:55:46" (1/2) ... [2025-04-26 16:55:47,221 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dce2b24 and model type nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:55:47, skipping insertion in model container [2025-04-26 16:55:47,221 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:55:47,221 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:55:47" (2/2) ... [2025-04-26 16:55:47,222 INFO L376 chiAutomizerObserver]: Analyzing ICFG nonblocking-counter-alt2.wvr.bpl [2025-04-26 16:55:47,265 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:55:47,304 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:55:47,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:55:47,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:47,307 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:55:47,309 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:55:47,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 64 flow [2025-04-26 16:55:47,376 INFO L116 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-04-26 16:55:47,377 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:55:47,380 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 4. Compared 17 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:55:47,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 64 flow [2025-04-26 16:55:47,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2025-04-26 16:55:47,385 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 26 places, 21 transitions, 54 flow [2025-04-26 16:55:47,391 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:55:47,446 WARN L140 AmpleReduction]: Number of pruned transitions: 9 [2025-04-26 16:55:47,447 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:55:47,447 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 5 [2025-04-26 16:55:47,447 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:19 [2025-04-26 16:55:47,447 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:9 [2025-04-26 16:55:47,447 WARN L145 AmpleReduction]: Times succ was already a loop node:8 [2025-04-26 16:55:47,447 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:55:47,447 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:55:47,449 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:55:47,455 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:55:47,455 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:55:47,455 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:55:47,455 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:55:47,455 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:55:47,455 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:55:47,455 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:55:47,456 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:55:47,457 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:55:47,466 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 15 [2025-04-26 16:55:47,466 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:47,466 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:47,469 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:55:47,469 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:47,469 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:55:47,469 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:55:47,470 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 15 [2025-04-26 16:55:47,470 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:47,470 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:47,471 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:55:47,471 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:47,476 INFO L752 eck$LassoCheckResult]: Stem: "[45] $Ultimate##0-->L42: Formula: (= v_j1_5 0) InVars {j1=v_j1_5} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[]" "[41] L42-->L43: Formula: (= v_j2_5 0) InVars {j2=v_j2_5} OutVars{j2=v_j2_5} AuxVars[] AssignedVars[]" "[39] L43-->L44: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[34] L44-->L45: 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[]" "[47] L45-->L46: Formula: (< 0 v_M2_4) InVars {M2=v_M2_4} OutVars{M2=v_M2_4} AuxVars[] AssignedVars[]" "[62] L46-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:55:47,476 INFO L754 eck$LassoCheckResult]: Loop: "[53] L20-1-->L20: 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] L20-->L20-1: Formula: (and (= v_j1_6 (+ v_j1_7 1)) (= v_counter_8 (+ v_counter_9 v_C_3))) InVars {counter=v_counter_9, C=v_C_3, j1=v_j1_7} OutVars{counter=v_counter_8, C=v_C_3, j1=v_j1_6} AuxVars[] AssignedVars[counter, j1]" [2025-04-26 16:55:47,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:47,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2080091417, now seen corresponding path program 1 times [2025-04-26 16:55:47,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:47,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179749485] [2025-04-26 16:55:47,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:47,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:47,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:47,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:47,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:47,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:47,540 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:47,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:47,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:47,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:47,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:47,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:47,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:47,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2659, now seen corresponding path program 1 times [2025-04-26 16:55:47,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:47,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110815713] [2025-04-26 16:55:47,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:47,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:47,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:47,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:47,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:47,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:47,563 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:47,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:47,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:47,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:47,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:47,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:47,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:47,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1808057399, now seen corresponding path program 1 times [2025-04-26 16:55:47,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:47,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250656264] [2025-04-26 16:55:47,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:47,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:47,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:47,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:47,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:47,578 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:47,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:47,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:47,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:47,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:47,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:47,628 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:47,629 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:47,629 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:47,629 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:47,629 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:55:47,629 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:47,629 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:47,629 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:47,630 INFO L132 ssoRankerPreferences]: Filename of dumped script: nonblocking-counter-alt2.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:55:47,630 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:47,630 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:47,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:47,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:47,713 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:47,713 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:55:47,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:47,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:47,717 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:55:47,719 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:55:47,721 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:55:47,721 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:47,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:55:47,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:47,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:47,744 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:55:47,745 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:55:47,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:55:47,748 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:55:47,818 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:55:47,822 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:55:47,822 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:55:47,822 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:55:47,822 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:55:47,822 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:55:47,822 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:55:47,822 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:47,823 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:55:47,823 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:55:47,823 INFO L132 ssoRankerPreferences]: Filename of dumped script: nonblocking-counter-alt2.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:55:47,823 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:55:47,823 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:55:47,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:47,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:55:47,859 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:55:47,862 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:55:47,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:47,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:47,866 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:55:47,868 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:55:47,869 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:55:47,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:55:47,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:55:47,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:55:47,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:55:47,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:55:47,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:55:47,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:55:47,908 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:55:47,913 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:55:47,914 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:55:47,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:55:47,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:55:47,939 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:55:47,941 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:55:47,942 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:55:47,945 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:55:47,945 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:55:47,946 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:55:47,946 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M1, j1) = 1*M1 - 1*j1 Supporting invariants [] [2025-04-26 16:55:47,952 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 16:55:47,954 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:55:47,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:47,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:55:47,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:55:47,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:47,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:47,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:55:47,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:48,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:48,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:48,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:48,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:55:48,044 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:55:48,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:55:48,067 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:55:48,080 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:55:48,082 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:55:48,130 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:55:48,131 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:55:48,134 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:55:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2025-04-26 16:55:48,137 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:55:48,138 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:48,138 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:55:48,138 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:48,138 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:55:48,138 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:55:48,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 92 transitions. [2025-04-26 16:55:48,140 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 16:55:48,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 25 states and 35 transitions. [2025-04-26 16:55:48,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-04-26 16:55:48,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-04-26 16:55:48,143 INFO L74 IsDeterministic]: Start isDeterministic. Operand 25 states and 35 transitions. [2025-04-26 16:55:48,143 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:55:48,143 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 35 transitions. [2025-04-26 16:55:48,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 35 transitions. [2025-04-26 16:55:48,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-04-26 16:55:48,159 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:55:48,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2025-04-26 16:55:48,160 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 33 transitions. [2025-04-26 16:55:48,160 INFO L438 stractBuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2025-04-26 16:55:48,160 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:55:48,160 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2025-04-26 16:55:48,161 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-04-26 16:55:48,161 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:55:48,161 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:55:48,161 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:55:48,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:55:48,162 INFO L752 eck$LassoCheckResult]: Stem: "[45] $Ultimate##0-->L42: Formula: (= v_j1_5 0) InVars {j1=v_j1_5} OutVars{j1=v_j1_5} AuxVars[] AssignedVars[]" "[41] L42-->L43: Formula: (= v_j2_5 0) InVars {j2=v_j2_5} OutVars{j2=v_j2_5} AuxVars[] AssignedVars[]" "[39] L43-->L44: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[34] L44-->L45: 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[]" "[47] L45-->L46: Formula: (< 0 v_M2_4) InVars {M2=v_M2_4} OutVars{M2=v_M2_4} AuxVars[] AssignedVars[]" "[62] L46-->L20-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[53] L20-1-->L20: 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] L46-1-->L31-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:55:48,162 INFO L754 eck$LassoCheckResult]: Loop: "[57] L31-1-->L31: 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] L31-->L31-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_C_5)) v_counter_13)))) InVars {j2=v_j2_7, counter=v_counter_13, C=v_C_5} OutVars{j2=v_j2_6, counter=v_counter_12, C=v_C_5} AuxVars[] AssignedVars[counter, j2]" [2025-04-26 16:55:48,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1808057389, now seen corresponding path program 1 times [2025-04-26 16:55:48,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:48,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264373430] [2025-04-26 16:55:48,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:48,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:48,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:48,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:48,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:48,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:48,167 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:48,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:48,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:48,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:48,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:48,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:48,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:48,170 INFO L85 PathProgramCache]: Analyzing trace with hash 2787, now seen corresponding path program 1 times [2025-04-26 16:55:48,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:48,171 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524354981] [2025-04-26 16:55:48,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:48,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:48,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:48,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:48,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:48,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:48,175 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:48,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:55:48,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:55:48,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:48,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:48,180 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:48,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:55:48,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1918605877, now seen corresponding path program 1 times [2025-04-26 16:55:48,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:55:48,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218692662] [2025-04-26 16:55:48,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:55:48,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:55:48,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:48,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:48,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:48,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:48,194 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:48,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:55:48,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:55:48,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:48,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:48,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:55:48,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:48,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:48,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:48,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:48,363 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:55:48,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:55:48,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:55:48,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:55:48,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:55:48,381 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:55:48,388 INFO L201 PluginConnector]: Adding new model nonblocking-counter-alt2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:55:48 BoogieIcfgContainer [2025-04-26 16:55:48,389 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:55:48,389 INFO L158 Benchmark]: Toolchain (without parser) took 1410.46ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 86.0MB in the beginning and 77.8MB in the end (delta: 8.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:48,390 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:48,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.79ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:48,390 INFO L158 Benchmark]: Boogie Preprocessor took 17.32ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:55:48,390 INFO L158 Benchmark]: RCFGBuilder took 179.02ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 73.7MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:55:48,391 INFO L158 Benchmark]: BuchiAutomizer took 1174.13ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.6MB in the beginning and 77.8MB in the end (delta: -4.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:55:48,394 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.20ms. Allocated memory is still 159.4MB. Free memory is still 86.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.79ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.32ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 179.02ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 73.7MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1174.13ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.6MB in the beginning and 77.8MB in the end (delta: -4.3MB). 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.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. 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: 82ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 148, 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: 30]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L41] 0 assume j1 == 0; VAL [j1=0] [L42] 0 assume j2 == 0; VAL [j1=0, j2=0] [L43] 0 assume counter == 0; VAL [counter=0, j1=0, j2=0] [L44] 0 assume M2 == M1; VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L45] 0 assume 0 < M2; VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L46] FORK 0 fork 1 thread1(); VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L19] COND TRUE 1 j1 < M1 VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L47] FORK 0 fork 2, 2 thread2(); VAL [M1=1, M2=1, counter=0, j1=0, j2=0] Loop: [L30] COND TRUE j2 < M2 [L32] j2 := (if 0 < counter then j2 + 1 else j2); [L33] counter := (if 0 < counter then counter - C else counter); End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 30]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L41] 0 assume j1 == 0; VAL [j1=0] [L42] 0 assume j2 == 0; VAL [j1=0, j2=0] [L43] 0 assume counter == 0; VAL [counter=0, j1=0, j2=0] [L44] 0 assume M2 == M1; VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L45] 0 assume 0 < M2; VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L46] FORK 0 fork 1 thread1(); VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L19] COND TRUE 1 j1 < M1 VAL [M1=1, M2=1, counter=0, j1=0, j2=0] [L47] FORK 0 fork 2, 2 thread2(); VAL [M1=1, M2=1, counter=0, j1=0, j2=0] Loop: [L30] COND TRUE j2 < M2 [L32] j2 := (if 0 < counter then j2 + 1 else j2); [L33] counter := (if 0 < counter then counter - C else counter); End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:55:48,409 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...