/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/termination/concurrent_ThreeThreadsAlternating_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:53:13,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:53:13,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:53:13,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:53:13,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:53:13,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:53:13,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:53:13,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:53:13,366 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:53:13,367 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:53:13,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:53:13,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:53:13,368 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:53:13,368 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:53:13,369 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:53:13,369 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:53:13,369 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:53:13,369 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:53:13,369 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:53:13,369 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:53:13,369 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:53:13,369 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:53:13,369 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:53:13,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:53:13,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:53:13,369 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:53:13,369 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:53:13,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:53:13,369 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:53:13,369 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:53:13,370 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:53:13,370 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:53:13,370 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:53:13,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:53:13,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:53:13,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:13,370 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:53:13,370 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:53:13,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:53:13,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:53:13,370 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:53:13,370 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:53:13,370 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:53:13,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:53:13,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:53:13,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:53:13,627 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:53:13,628 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:53:13,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_ThreeThreadsAlternating_nonterminating.bpl [2025-04-26 16:53:13,631 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_ThreeThreadsAlternating_nonterminating.bpl' [2025-04-26 16:53:13,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:53:13,645 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:53:13,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:13,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:53:13,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:53:13,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:13" (1/1) ... [2025-04-26 16:53:13,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:13" (1/1) ... [2025-04-26 16:53:13,681 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:53:13,682 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:13,683 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:53:13,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:53:13,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:53:13,688 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:13" (1/1) ... [2025-04-26 16:53:13,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:13" (1/1) ... [2025-04-26 16:53:13,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:13" (1/1) ... [2025-04-26 16:53:13,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:13" (1/1) ... [2025-04-26 16:53:13,691 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:13" (1/1) ... [2025-04-26 16:53:13,691 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:13" (1/1) ... [2025-04-26 16:53:13,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:13" (1/1) ... [2025-04-26 16:53:13,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:13" (1/1) ... [2025-04-26 16:53:13,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:13" (1/1) ... [2025-04-26 16:53:13,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:53:13,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:53:13,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:53:13,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:53:13,708 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:13" (1/1) ... [2025-04-26 16:53:13,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:13,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:13,737 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:53:13,740 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:53:13,760 INFO L124 BoogieDeclarations]: Specification and implementation of procedure one given in one single declaration [2025-04-26 16:53:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure one [2025-04-26 16:53:13,761 INFO L138 BoogieDeclarations]: Found implementation of procedure one [2025-04-26 16:53:13,761 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:53:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:53:13,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:53:13,761 INFO L124 BoogieDeclarations]: Specification and implementation of procedure three given in one single declaration [2025-04-26 16:53:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure three [2025-04-26 16:53:13,761 INFO L138 BoogieDeclarations]: Found implementation of procedure three [2025-04-26 16:53:13,761 INFO L124 BoogieDeclarations]: Specification and implementation of procedure two given in one single declaration [2025-04-26 16:53:13,761 INFO L130 BoogieDeclarations]: Found specification of procedure two [2025-04-26 16:53:13,761 INFO L138 BoogieDeclarations]: Found implementation of procedure two [2025-04-26 16:53:13,762 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:53:13,794 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:53:13,796 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:53:13,853 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:53:13,853 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:53:13,861 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:53:13,862 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:53:13,864 INFO L201 PluginConnector]: Adding new model concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:13 BoogieIcfgContainer [2025-04-26 16:53:13,864 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:53:13,864 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:53:13,864 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:53:13,869 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:53:13,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:13,869 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:13" (1/2) ... [2025-04-26 16:53:13,870 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16566dac and model type concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:53:13, skipping insertion in model container [2025-04-26 16:53:13,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:13,871 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:13" (2/2) ... [2025-04-26 16:53:13,871 INFO L376 chiAutomizerObserver]: Analyzing ICFG concurrent_ThreeThreadsAlternating_nonterminating.bpl [2025-04-26 16:53:13,915 INFO L143 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2025-04-26 16:53:13,952 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:13,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:13,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:13,954 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:53:13,957 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:53:13,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 32 transitions, 103 flow [2025-04-26 16:53:14,019 INFO L116 PetriNetUnfolderBase]: 8/29 cut-off events. [2025-04-26 16:53:14,020 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-26 16:53:14,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 29 events. 8/29 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 26. Up to 6 conditions per place. [2025-04-26 16:53:14,023 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 32 transitions, 103 flow [2025-04-26 16:53:14,028 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 26 transitions, 88 flow [2025-04-26 16:53:14,028 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 27 places, 26 transitions, 88 flow [2025-04-26 16:53:14,034 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:14,206 WARN L140 AmpleReduction]: Number of pruned transitions: 113 [2025-04-26 16:53:14,207 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:53:14,207 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 13 [2025-04-26 16:53:14,207 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:47 [2025-04-26 16:53:14,207 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:57 [2025-04-26 16:53:14,207 WARN L145 AmpleReduction]: Times succ was already a loop node:47 [2025-04-26 16:53:14,207 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:53:14,207 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:14,209 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 118 states, 117 states have (on average 1.8803418803418803) internal successors, (in total 220), 117 states have internal predecessors, (220), 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:53:14,215 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:14,215 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:14,215 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:14,215 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:14,215 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:14,215 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:14,215 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:14,215 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:14,217 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 118 states, 117 states have (on average 1.8803418803418803) internal successors, (in total 220), 117 states have internal predecessors, (220), 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:53:14,232 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 62 [2025-04-26 16:53:14,232 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:14,232 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:14,236 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:53:14,236 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:14,236 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:14,236 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 118 states, 117 states have (on average 1.8803418803418803) internal successors, (in total 220), 117 states have internal predecessors, (220), 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:53:14,240 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 62 [2025-04-26 16:53:14,240 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:14,240 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:14,241 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:53:14,241 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:14,244 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" [2025-04-26 16:53:14,245 INFO L754 eck$LassoCheckResult]: Loop: "[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:53:14,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:14,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2295, now seen corresponding path program 1 times [2025-04-26 16:53:14,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:14,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693529442] [2025-04-26 16:53:14,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:14,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:14,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:14,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:14,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:14,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:14,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:14,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:14,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:14,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:14,327 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:14,328 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2025-04-26 16:53:14,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:14,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644094614] [2025-04-26 16:53:14,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:14,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:14,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:14,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:14,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:14,331 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:14,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:14,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:14,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:14,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:14,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:14,339 INFO L85 PathProgramCache]: Analyzing trace with hash 2207097, now seen corresponding path program 1 times [2025-04-26 16:53:14,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:14,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584439936] [2025-04-26 16:53:14,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:14,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:14,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:14,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:14,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:14,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:14,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:14,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:14,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:14,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:14,392 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:14,392 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:14,393 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:14,393 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:14,393 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:53:14,393 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,393 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:14,393 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:14,393 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 16:53:14,393 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:14,393 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:14,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:14,439 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:14,440 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:53:14,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:14,474 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:53:14,479 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:53:14,480 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:53:14,480 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:14,500 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:53:14,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:14,504 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:53:14,505 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:53:14,506 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:53:14,506 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:14,527 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:53:14,533 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:53:14,533 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:14,534 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:14,534 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:14,534 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:14,534 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:14,534 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,534 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:14,534 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:14,534 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 16:53:14,534 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:14,534 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:14,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:14,553 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:14,556 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:14,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:14,558 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:53:14,560 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:53:14,562 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:53:14,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:14,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:14,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:14,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:14,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:14,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:14,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:14,587 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:14,591 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:53:14,591 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:53:14,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:14,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:14,595 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:53:14,596 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:53:14,597 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:14,600 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:53:14,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:53:14,601 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:53:14,601 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:14,602 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 3 Supporting invariants [] [2025-04-26 16:53:14,608 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:53:14,628 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:14,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:14,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:14,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:14,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:14,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:14,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:14,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:14,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:14,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:14,673 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:14,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:14,726 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:53:14,778 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:53:14,780 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 118 states, 117 states have (on average 1.8803418803418803) internal successors, (in total 220), 117 states have internal predecessors, (220), 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 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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:53:14,922 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 118 states, 117 states have (on average 1.8803418803418803) internal successors, (in total 220), 117 states have internal predecessors, (220), 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 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 473 states and 953 transitions. Complement of second has 7 states. [2025-04-26 16:53:14,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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:53:14,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-04-26 16:53:14,933 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:53:14,933 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:14,933 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:53:14,933 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:14,934 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:53:14,934 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:14,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 473 states and 953 transitions. [2025-04-26 16:53:14,943 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 60 [2025-04-26 16:53:14,949 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 473 states to 286 states and 625 transitions. [2025-04-26 16:53:14,949 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 170 [2025-04-26 16:53:14,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 233 [2025-04-26 16:53:14,951 INFO L74 IsDeterministic]: Start isDeterministic. Operand 286 states and 625 transitions. [2025-04-26 16:53:14,951 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:14,951 INFO L218 hiAutomatonCegarLoop]: Abstraction has 286 states and 625 transitions. [2025-04-26 16:53:14,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 625 transitions. [2025-04-26 16:53:14,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 169. [2025-04-26 16:53:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 169 states have (on average 2.171597633136095) internal successors, (in total 367), 168 states have internal predecessors, (367), 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:53:14,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 367 transitions. [2025-04-26 16:53:14,977 INFO L240 hiAutomatonCegarLoop]: Abstraction has 169 states and 367 transitions. [2025-04-26 16:53:14,977 INFO L438 stractBuchiCegarLoop]: Abstraction has 169 states and 367 transitions. [2025-04-26 16:53:14,978 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:53:14,978 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 367 transitions. [2025-04-26 16:53:14,979 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 60 [2025-04-26 16:53:14,979 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:14,979 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:14,979 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:53:14,980 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:14,980 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[49] L19-->oneFINAL: Formula: (not (= v_x_3 1)) InVars {x=v_x_3} OutVars{x=v_x_3} AuxVars[] AssignedVars[]" "[51] oneFINAL-->oneEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" [2025-04-26 16:53:14,980 INFO L754 eck$LassoCheckResult]: Loop: "[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x]" [2025-04-26 16:53:14,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash 68419081, now seen corresponding path program 1 times [2025-04-26 16:53:14,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:14,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852393685] [2025-04-26 16:53:14,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:14,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:14,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:14,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:14,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:14,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,006 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:53:15,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:15,007 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852393685] [2025-04-26 16:53:15,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852393685] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:15,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:15,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:53:15,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652451663] [2025-04-26 16:53:15,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:15,010 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:15,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,011 INFO L85 PathProgramCache]: Analyzing trace with hash 2819, now seen corresponding path program 1 times [2025-04-26 16:53:15,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332819227] [2025-04-26 16:53:15,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:15,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:15,025 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:15,026 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:15,026 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:15,026 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:15,026 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:53:15,026 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,026 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:15,026 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:15,026 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 16:53:15,026 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:15,026 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:15,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,047 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:15,047 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:53:15,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,049 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:53:15,051 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:53:15,051 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:15,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:53:15,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,074 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:53:15,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:53:15,076 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:15,088 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:53:15,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:53:15,094 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:15,094 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:15,094 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:15,094 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:15,094 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:15,094 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,094 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:15,095 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:15,095 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 16:53:15,095 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:15,095 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:15,095 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,114 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:15,114 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:15,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,116 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:53:15,117 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:53:15,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:15,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:15,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:15,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:15,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:15,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:15,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:15,130 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:15,131 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:53:15,131 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:53:15,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,133 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:53:15,134 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:15,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:53:15,138 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:53:15,138 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:15,138 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 5 Supporting invariants [] [2025-04-26 16:53:15,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:53:15,144 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:15,157 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:15,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:15,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:15,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:15,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,170 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:15,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:15,178 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:53:15,178 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:53:15,178 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 169 states and 367 transitions. cyclomatic complexity: 230 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:15,291 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 169 states and 367 transitions. cyclomatic complexity: 230. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 916 states and 1936 transitions. Complement of second has 9 states. [2025-04-26 16:53:15,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2025-04-26 16:53:15,292 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:53:15,293 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,293 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:53:15,293 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,293 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 67 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:53:15,293 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 916 states and 1936 transitions. [2025-04-26 16:53:15,303 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 92 [2025-04-26 16:53:15,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 916 states to 714 states and 1541 transitions. [2025-04-26 16:53:15,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 296 [2025-04-26 16:53:15,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 394 [2025-04-26 16:53:15,311 INFO L74 IsDeterministic]: Start isDeterministic. Operand 714 states and 1541 transitions. [2025-04-26 16:53:15,311 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:15,311 INFO L218 hiAutomatonCegarLoop]: Abstraction has 714 states and 1541 transitions. [2025-04-26 16:53:15,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states and 1541 transitions. [2025-04-26 16:53:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 473. [2025-04-26 16:53:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 473 states have (on average 2.3636363636363638) internal successors, (in total 1118), 472 states have internal predecessors, (1118), 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:53:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 1118 transitions. [2025-04-26 16:53:15,334 INFO L240 hiAutomatonCegarLoop]: Abstraction has 473 states and 1118 transitions. [2025-04-26 16:53:15,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:15,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:53:15,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:53:15,336 INFO L87 Difference]: Start difference. First operand 473 states and 1118 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 2 states have internal predecessors, (5), 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:53:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:15,374 INFO L93 Difference]: Finished difference Result 578 states and 1221 transitions. [2025-04-26 16:53:15,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 578 states and 1221 transitions. [2025-04-26 16:53:15,378 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 82 [2025-04-26 16:53:15,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 578 states to 515 states and 1093 transitions. [2025-04-26 16:53:15,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2025-04-26 16:53:15,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2025-04-26 16:53:15,383 INFO L74 IsDeterministic]: Start isDeterministic. Operand 515 states and 1093 transitions. [2025-04-26 16:53:15,383 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:15,383 INFO L218 hiAutomatonCegarLoop]: Abstraction has 515 states and 1093 transitions. [2025-04-26 16:53:15,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states and 1093 transitions. [2025-04-26 16:53:15,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 465. [2025-04-26 16:53:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 465 states have (on average 2.193548387096774) internal successors, (in total 1020), 464 states have internal predecessors, (1020), 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:53:15,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 1020 transitions. [2025-04-26 16:53:15,393 INFO L240 hiAutomatonCegarLoop]: Abstraction has 465 states and 1020 transitions. [2025-04-26 16:53:15,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:53:15,394 INFO L438 stractBuchiCegarLoop]: Abstraction has 465 states and 1020 transitions. [2025-04-26 16:53:15,394 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:53:15,394 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 465 states and 1020 transitions. [2025-04-26 16:53:15,396 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 80 [2025-04-26 16:53:15,396 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:15,396 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:15,397 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:15,397 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:15,397 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[49] L19-->oneFINAL: Formula: (not (= v_x_3 1)) InVars {x=v_x_3} OutVars{x=v_x_3} AuxVars[] AssignedVars[]" "[51] oneFINAL-->oneEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:53:15,397 INFO L754 eck$LassoCheckResult]: Loop: "[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x]" [2025-04-26 16:53:15,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1327585903, now seen corresponding path program 1 times [2025-04-26 16:53:15,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33092684] [2025-04-26 16:53:15,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:15,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:15,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:15,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,401 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:15,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:15,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:15,404 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,404 INFO L85 PathProgramCache]: Analyzing trace with hash 2819, now seen corresponding path program 2 times [2025-04-26 16:53:15,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,404 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528894363] [2025-04-26 16:53:15,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:15,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,408 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,408 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:15,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,408 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:15,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,409 INFO L85 PathProgramCache]: Analyzing trace with hash 204767729, now seen corresponding path program 1 times [2025-04-26 16:53:15,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382352490] [2025-04-26 16:53:15,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:15,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:15,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:15,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,414 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:15,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:15,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:15,426 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:15,426 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:15,426 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:15,426 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:15,426 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:53:15,426 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,426 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:15,426 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:15,426 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 16:53:15,426 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:15,426 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:15,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,441 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:15,441 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:53:15,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,444 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:53:15,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:53:15,446 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:15,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:15,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,469 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:53:15,471 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:53:15,471 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:15,482 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:53:15,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:53:15,488 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:15,488 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:15,488 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:15,488 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:15,488 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:15,488 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,488 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:15,488 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:15,488 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 16:53:15,488 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:15,489 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:15,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,508 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:15,509 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:15,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,511 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:53:15,513 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:53:15,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:15,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:15,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:15,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:15,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:15,524 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:15,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:15,526 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:15,528 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:53:15,528 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:53:15,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,530 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:53:15,532 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:15,535 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:53:15,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:53:15,536 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:53:15,536 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:15,536 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 5 Supporting invariants [] [2025-04-26 16:53:15,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:15,543 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:15,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:15,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:15,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:15,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:15,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,573 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:15,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:15,580 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:53:15,580 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:53:15,580 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 465 states and 1020 transitions. cyclomatic complexity: 610 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:15,635 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 465 states and 1020 transitions. cyclomatic complexity: 610. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 575 states and 1202 transitions. Complement of second has 9 states. [2025-04-26 16:53:15,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:15,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2025-04-26 16:53:15,636 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:53:15,637 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,637 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:53:15,637 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,637 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 43 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:53:15,637 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 575 states and 1202 transitions. [2025-04-26 16:53:15,640 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 78 [2025-04-26 16:53:15,654 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 575 states to 517 states and 1103 transitions. [2025-04-26 16:53:15,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 223 [2025-04-26 16:53:15,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2025-04-26 16:53:15,655 INFO L74 IsDeterministic]: Start isDeterministic. Operand 517 states and 1103 transitions. [2025-04-26 16:53:15,655 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:15,655 INFO L218 hiAutomatonCegarLoop]: Abstraction has 517 states and 1103 transitions. [2025-04-26 16:53:15,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states and 1103 transitions. [2025-04-26 16:53:15,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 464. [2025-04-26 16:53:15,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 464 states have (on average 2.1918103448275863) internal successors, (in total 1017), 463 states have internal predecessors, (1017), 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:53:15,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 1017 transitions. [2025-04-26 16:53:15,663 INFO L240 hiAutomatonCegarLoop]: Abstraction has 464 states and 1017 transitions. [2025-04-26 16:53:15,663 INFO L438 stractBuchiCegarLoop]: Abstraction has 464 states and 1017 transitions. [2025-04-26 16:53:15,663 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:53:15,663 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 464 states and 1017 transitions. [2025-04-26 16:53:15,666 INFO L131 ngComponentsAnalysis]: Automaton has 27 accepting balls. 78 [2025-04-26 16:53:15,666 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:15,666 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:15,666 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:15,666 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:15,666 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x]" [2025-04-26 16:53:15,666 INFO L754 eck$LassoCheckResult]: Loop: "[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:53:15,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1327586191, now seen corresponding path program 1 times [2025-04-26 16:53:15,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589195310] [2025-04-26 16:53:15,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:15,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:15,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:15,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,670 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:15,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:15,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:15,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,672 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2025-04-26 16:53:15,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281833874] [2025-04-26 16:53:15,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:15,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,674 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,674 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:15,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:15,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash 205044241, now seen corresponding path program 2 times [2025-04-26 16:53:15,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560840444] [2025-04-26 16:53:15,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 2 equivalence classes. [2025-04-26 16:53:15,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:15,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:53:15,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:15,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:15,708 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560840444] [2025-04-26 16:53:15,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560840444] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:15,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:15,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:53:15,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489571769] [2025-04-26 16:53:15,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:15,720 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:15,720 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:15,720 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:15,720 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:15,720 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:53:15,720 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,720 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:15,720 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:15,720 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_petrified1_Iteration4_Loop [2025-04-26 16:53:15,720 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:15,720 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:15,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,734 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:15,734 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:53:15,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,736 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:53:15,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:53:15,739 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:15,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:15,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,757 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:53:15,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:53:15,758 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:15,771 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:53:15,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:53:15,776 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:15,776 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:15,776 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:15,776 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:15,777 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:15,777 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,777 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:15,777 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:15,777 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_ThreeThreadsAlternating_nonterminating.bpl_petrified1_Iteration4_Loop [2025-04-26 16:53:15,777 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:15,777 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:15,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,795 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:15,796 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:15,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,797 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:53:15,800 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:53:15,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:15,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:15,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:15,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:15,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:15,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:15,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:15,813 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:15,815 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:53:15,815 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:53:15,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,817 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:15,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:53:15,820 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:15,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:15,823 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:53:15,823 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:15,823 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 3 Supporting invariants [] [2025-04-26 16:53:15,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:15,830 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:15,841 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:15,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:15,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:15,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:15,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:15,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,856 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:15,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:15,864 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:53:15,864 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:53:15,864 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 464 states and 1017 transitions. cyclomatic complexity: 607 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:15,939 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 464 states and 1017 transitions. cyclomatic complexity: 607. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1431 states and 3142 transitions. Complement of second has 7 states. [2025-04-26 16:53:15,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:15,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-04-26 16:53:15,940 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:53:15,940 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,940 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:53:15,940 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,940 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 55 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:53:15,940 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:15,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1431 states and 3142 transitions. [2025-04-26 16:53:15,949 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 123 [2025-04-26 16:53:15,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1431 states to 1108 states and 2403 transitions. [2025-04-26 16:53:15,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 432 [2025-04-26 16:53:15,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 513 [2025-04-26 16:53:15,956 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1108 states and 2403 transitions. [2025-04-26 16:53:15,956 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:15,956 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1108 states and 2403 transitions. [2025-04-26 16:53:15,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1108 states and 2403 transitions. [2025-04-26 16:53:15,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1108 to 693. [2025-04-26 16:53:15,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 693 states have (on average 2.3823953823953823) internal successors, (in total 1651), 692 states have internal predecessors, (1651), 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:53:15,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1651 transitions. [2025-04-26 16:53:15,969 INFO L240 hiAutomatonCegarLoop]: Abstraction has 693 states and 1651 transitions. [2025-04-26 16:53:15,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:15,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:53:15,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:53:15,970 INFO L87 Difference]: Start difference. First operand 693 states and 1651 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:15,997 INFO L93 Difference]: Finished difference Result 424 states and 782 transitions. [2025-04-26 16:53:15,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 424 states and 782 transitions. [2025-04-26 16:53:15,999 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 55 [2025-04-26 16:53:16,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 424 states to 261 states and 487 transitions. [2025-04-26 16:53:16,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2025-04-26 16:53:16,001 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 168 [2025-04-26 16:53:16,001 INFO L74 IsDeterministic]: Start isDeterministic. Operand 261 states and 487 transitions. [2025-04-26 16:53:16,001 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:16,001 INFO L218 hiAutomatonCegarLoop]: Abstraction has 261 states and 487 transitions. [2025-04-26 16:53:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states and 487 transitions. [2025-04-26 16:53:16,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 128. [2025-04-26 16:53:16,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 128 states have (on average 1.921875) internal successors, (in total 246), 127 states have internal predecessors, (246), 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:53:16,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 246 transitions. [2025-04-26 16:53:16,004 INFO L240 hiAutomatonCegarLoop]: Abstraction has 128 states and 246 transitions. [2025-04-26 16:53:16,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:53:16,005 INFO L438 stractBuchiCegarLoop]: Abstraction has 128 states and 246 transitions. [2025-04-26 16:53:16,005 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:53:16,005 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 246 transitions. [2025-04-26 16:53:16,005 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 41 [2025-04-26 16:53:16,005 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:16,005 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:16,005 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:53:16,006 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:53:16,006 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0]" [2025-04-26 16:53:16,006 INFO L754 eck$LassoCheckResult]: Loop: "[54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[]" "[56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x]" [2025-04-26 16:53:16,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2121022332, now seen corresponding path program 1 times [2025-04-26 16:53:16,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854130293] [2025-04-26 16:53:16,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:16,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:16,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:16,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,009 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:16,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:16,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:16,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1808230905, now seen corresponding path program 1 times [2025-04-26 16:53:16,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112209314] [2025-04-26 16:53:16,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:16,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:16,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:16,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:16,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:16,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,015 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:16,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,016 INFO L85 PathProgramCache]: Analyzing trace with hash 199952706, now seen corresponding path program 1 times [2025-04-26 16:53:16,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296828591] [2025-04-26 16:53:16,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:16,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:53:16,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:53:16,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:53:16,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:16,030 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296828591] [2025-04-26 16:53:16,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296828591] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:16,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:16,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:53:16,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688280792] [2025-04-26 16:53:16,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:16,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:16,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:53:16,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:53:16,042 INFO L87 Difference]: Start difference. First operand 128 states and 246 transitions. cyclomatic complexity: 138 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:16,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:16,066 INFO L93 Difference]: Finished difference Result 144 states and 258 transitions. [2025-04-26 16:53:16,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 258 transitions. [2025-04-26 16:53:16,067 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 40 [2025-04-26 16:53:16,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 126 states and 224 transitions. [2025-04-26 16:53:16,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2025-04-26 16:53:16,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2025-04-26 16:53:16,068 INFO L74 IsDeterministic]: Start isDeterministic. Operand 126 states and 224 transitions. [2025-04-26 16:53:16,068 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:16,068 INFO L218 hiAutomatonCegarLoop]: Abstraction has 126 states and 224 transitions. [2025-04-26 16:53:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 224 transitions. [2025-04-26 16:53:16,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2025-04-26 16:53:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.809090909090909) internal successors, (in total 199), 109 states have internal predecessors, (199), 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:53:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 199 transitions. [2025-04-26 16:53:16,070 INFO L240 hiAutomatonCegarLoop]: Abstraction has 110 states and 199 transitions. [2025-04-26 16:53:16,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:53:16,070 INFO L438 stractBuchiCegarLoop]: Abstraction has 110 states and 199 transitions. [2025-04-26 16:53:16,070 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:53:16,071 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 199 transitions. [2025-04-26 16:53:16,071 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 37 [2025-04-26 16:53:16,071 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:16,071 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:16,071 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:16,071 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:53:16,072 INFO L752 eck$LassoCheckResult]: Stem: "[41] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[63] L8-->L19: Formula: (= v_oneThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{oneThread1of1ForFork0_thidvar0=v_oneThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[oneThread1of1ForFork0_thidvar0]" "[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[66] L8-1-->L27: Formula: (= v_twoThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{twoThread1of1ForFork1_thidvar0=v_twoThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[twoThread1of1ForFork1_thidvar0]" "[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[69] L9-->L35: Formula: (= v_threeThread1of1ForFork2_thidvar0_2 3) InVars {} OutVars{threeThread1of1ForFork2_thidvar0=v_threeThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[threeThread1of1ForFork2_thidvar0]" "[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x]" [2025-04-26 16:53:16,072 INFO L754 eck$LassoCheckResult]: Loop: "[54] L35-->L36: Formula: (= 3 v_x_5) InVars {x=v_x_5} OutVars{x=v_x_5} AuxVars[] AssignedVars[]" "[56] L36-->L35: Formula: (= v_x_6 1) InVars {} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[50] L19-->L20: Formula: (= v_x_1 1) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[52] L20-->L19: Formula: (= 2 v_x_2) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[58] L27-->L28: Formula: (= 2 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[60] L28-->L27: Formula: (= 3 v_x_9) InVars {} OutVars{x=v_x_9} AuxVars[] AssignedVars[x]" [2025-04-26 16:53:16,072 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1794490470, now seen corresponding path program 1 times [2025-04-26 16:53:16,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680980739] [2025-04-26 16:53:16,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:16,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:53:16,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:53:16,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,075 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:53:16,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:53:16,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:16,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1808230905, now seen corresponding path program 2 times [2025-04-26 16:53:16,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312481910] [2025-04-26 16:53:16,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:16,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-04-26 16:53:16,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:16,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:53:16,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,080 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:16,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:16,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:16,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash -983328, now seen corresponding path program 2 times [2025-04-26 16:53:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075061245] [2025-04-26 16:53:16,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:16,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-26 16:53:16,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:53:16,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:53:16,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:53:16,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:53:16,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:16,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:53:16,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:53:16,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:53:16,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:53:16,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:16,152 INFO L201 PluginConnector]: Adding new model concurrent_ThreeThreadsAlternating_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:53:16 BoogieIcfgContainer [2025-04-26 16:53:16,152 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:53:16,153 INFO L158 Benchmark]: Toolchain (without parser) took 2508.35ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 84.6MB in the beginning and 38.6MB in the end (delta: 46.0MB). Peak memory consumption was 35.5MB. Max. memory is 8.0GB. [2025-04-26 16:53:16,153 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.68ms. Allocated memory is still 155.2MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:16,153 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.68ms. Allocated memory is still 155.2MB. Free memory was 84.6MB in the beginning and 82.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:16,153 INFO L158 Benchmark]: Boogie Preprocessor took 23.54ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 81.8MB in the end (delta: 970.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:16,153 INFO L158 Benchmark]: RCFGBuilder took 156.22ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 73.2MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:53:16,154 INFO L158 Benchmark]: BuchiAutomizer took 2287.80ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 73.1MB in the beginning and 38.6MB in the end (delta: 34.5MB). Peak memory consumption was 27.2MB. Max. memory is 8.0GB. [2025-04-26 16:53:16,154 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.68ms. Allocated memory is still 155.2MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.68ms. Allocated memory is still 155.2MB. Free memory was 84.6MB in the beginning and 82.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.54ms. Allocated memory is still 155.2MB. Free memory was 82.7MB in the beginning and 81.8MB in the end (delta: 970.6kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 156.22ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 73.2MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2287.80ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 73.1MB in the beginning and 38.6MB in the end (delta: 34.5MB). Peak memory consumption was 27.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 1025 StatesRemovedByMinimization, 7 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 196 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 192 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 325 IncrementalHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 106 mSDtfsCounter, 325 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT2 conc1 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq200 hnf87 smp100 dnf100 smp100 tf114 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 44ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 259, Number of transitions in reduction automaton: 220, Number of states in reduction automaton: 118, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 3 + -2 * x and consists of 4 locations. One deterministic module has affine ranking function 5 + -2 * x and consists of 5 locations. One deterministic module has affine ranking function 5 + -2 * x and consists of 5 locations. One deterministic module has affine ranking function 3 + -2 * x and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 110 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 35]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 one(); VAL [x=1] [L19] COND TRUE 1 x == 1 VAL [x=1] [L9] FORK 0 fork 2 two(); VAL [x=1] [L20] 1 x := 2; VAL [x=2] [L10] FORK 0 fork 3 three(); VAL [x=2] [L27] COND TRUE 2 x == 2 VAL [x=2] [L28] 2 x := 3; VAL [x=3] Loop: [L35] COND TRUE x == 3 [L36] x := 1; [L19] COND TRUE x == 1 [L20] x := 2; [L27] COND TRUE x == 2 [L28] x := 3; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 35]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 one(); VAL [x=1] [L19] COND TRUE 1 x == 1 VAL [x=1] [L9] FORK 0 fork 2 two(); VAL [x=1] [L20] 1 x := 2; VAL [x=2] [L10] FORK 0 fork 3 three(); VAL [x=2] [L27] COND TRUE 2 x == 2 VAL [x=2] [L28] 2 x := 3; VAL [x=3] Loop: [L35] COND TRUE x == 3 [L36] x := 1; [L19] COND TRUE x == 1 [L20] x := 2; [L27] COND TRUE x == 2 [L28] x := 3; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:53:16,167 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...