/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_increment_nonterminating2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:53:14,752 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:53:14,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:53:14,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:53:14,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:53:14,807 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:14,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:53:14,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:53:14,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:53:14,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:53:14,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:53:14,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:53:14,828 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:53:14,828 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:53:14,828 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:53:14,828 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:53:14,828 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:53:14,828 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:53:14,828 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:53:14,828 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:53:14,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:53:14,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:53:14,828 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:53:14,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:53:14,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:53:14,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:53:14,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:53:14,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:53:14,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:53:14,829 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:53:14,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:53:14,829 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:53:14,829 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:53:14,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:53:14,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:53:14,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:14,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:53:14,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:53:14,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:53:14,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:53:14,829 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:53:14,829 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:53:14,830 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:53:15,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:53:15,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:53:15,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:53:15,052 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:53:15,052 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:53:15,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_increment_nonterminating2.bpl [2025-04-26 16:53:15,054 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_increment_nonterminating2.bpl' [2025-04-26 16:53:15,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:53:15,068 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:53:15,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:15,069 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:53:15,069 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:53:15,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:15" (1/1) ... [2025-04-26 16:53:15,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:15" (1/1) ... [2025-04-26 16:53:15,099 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:53:15,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:15,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:53:15,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:53:15,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:53:15,104 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:15" (1/1) ... [2025-04-26 16:53:15,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:15" (1/1) ... [2025-04-26 16:53:15,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:15" (1/1) ... [2025-04-26 16:53:15,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:15" (1/1) ... [2025-04-26 16:53:15,106 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:15" (1/1) ... [2025-04-26 16:53:15,107 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:15" (1/1) ... [2025-04-26 16:53:15,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:15" (1/1) ... [2025-04-26 16:53:15,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:15" (1/1) ... [2025-04-26 16:53:15,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:15" (1/1) ... [2025-04-26 16:53:15,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:53:15,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:53:15,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:53:15,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:53:15,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:15" (1/1) ... [2025-04-26 16:53:15,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [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,142 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:15,145 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:15,164 INFO L124 BoogieDeclarations]: Specification and implementation of procedure dec given in one single declaration [2025-04-26 16:53:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure dec [2025-04-26 16:53:15,165 INFO L138 BoogieDeclarations]: Found implementation of procedure dec [2025-04-26 16:53:15,165 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:53:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:53:15,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:53:15,165 INFO L124 BoogieDeclarations]: Specification and implementation of procedure inc given in one single declaration [2025-04-26 16:53:15,165 INFO L130 BoogieDeclarations]: Found specification of procedure inc [2025-04-26 16:53:15,165 INFO L138 BoogieDeclarations]: Found implementation of procedure inc [2025-04-26 16:53:15,165 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:15,195 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:53:15,197 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:53:15,248 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:53:15,248 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:53:15,255 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:53:15,255 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:53:15,255 INFO L201 PluginConnector]: Adding new model concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:15 BoogieIcfgContainer [2025-04-26 16:53:15,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:53:15,256 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:53:15,256 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:53:15,260 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:53:15,260 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:15,260 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:15" (1/2) ... [2025-04-26 16:53:15,261 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b27d7dd and model type concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:53:15, skipping insertion in model container [2025-04-26 16:53:15,261 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:15,261 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:15" (2/2) ... [2025-04-26 16:53:15,262 INFO L376 chiAutomizerObserver]: Analyzing ICFG concurrent_increment_nonterminating2.bpl [2025-04-26 16:53:15,300 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:53:15,341 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:15,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:15,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,344 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:15,346 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:15,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 18 transitions, 50 flow [2025-04-26 16:53:15,397 INFO L116 PetriNetUnfolderBase]: 2/14 cut-off events. [2025-04-26 16:53:15,400 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:53:15,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 14 events. 2/14 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 13 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-26 16:53:15,403 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 18 transitions, 50 flow [2025-04-26 16:53:15,405 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 14 transitions, 40 flow [2025-04-26 16:53:15,405 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 19 places, 14 transitions, 40 flow [2025-04-26 16:53:15,409 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:15,460 WARN L140 AmpleReduction]: Number of pruned transitions: 6 [2025-04-26 16:53:15,461 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:53:15,461 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3 [2025-04-26 16:53:15,461 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:18 [2025-04-26 16:53:15,461 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:6 [2025-04-26 16:53:15,461 WARN L145 AmpleReduction]: Times succ was already a loop node:10 [2025-04-26 16:53:15,461 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:53:15,461 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:15,463 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (in total 46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:15,467 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:15,467 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:15,467 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:15,467 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:15,467 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:15,468 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:15,468 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:15,468 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:15,469 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (in total 46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:15,476 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:53:15,476 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:15,476 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:15,479 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:53:15,479 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:15,479 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:15,479 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (in total 46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:15,480 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:53:15,480 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:15,480 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:15,481 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:53:15,481 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:15,485 INFO L752 eck$LassoCheckResult]: Stem: "[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0]" [2025-04-26 16:53:15,485 INFO L754 eck$LassoCheckResult]: Loop: "[35] L24-->L25: Formula: (< 0 (+ v_x_1 1)) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L25-->L24: Formula: (= v_x_3 (+ v_x_2 1)) InVars {x=v_x_3} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:53:15,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1873, now seen corresponding path program 1 times [2025-04-26 16:53:15,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334875640] [2025-04-26 16:53:15,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:15,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,539 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,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,540 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,543 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,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:15,554 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,554 INFO L85 PathProgramCache]: Analyzing trace with hash 2083, now seen corresponding path program 1 times [2025-04-26 16:53:15,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,555 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468749831] [2025-04-26 16:53:15,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:15,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 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 2 of 2 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 sat [2025-04-26 16:53:15,560 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:15,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,562 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,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:15,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:15,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1801075, now seen corresponding path program 1 times [2025-04-26 16:53:15,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:15,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10224480] [2025-04-26 16:53:15,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:15,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:15,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:15,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:15,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,612 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,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:15,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10224480] [2025-04-26 16:53:15,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10224480] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:15,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:15,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:53:15,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412614389] [2025-04-26 16:53:15,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:15,660 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:15,661 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:15,661 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:15,661 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:15,661 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:53:15,661 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,661 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:15,662 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:15,662 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration1_Loop [2025-04-26 16:53:15,662 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:15,662 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:15,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,771 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:15,771 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:53:15,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,776 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:15,781 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:15,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:53:15,781 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:15,801 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:15,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,803 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:15,805 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:15,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:53:15,807 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:15,832 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:53:15,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:53:15,837 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:15,837 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:15,837 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:15,837 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:15,837 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:15,837 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,837 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:15,837 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:15,837 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration1_Loop [2025-04-26 16:53:15,837 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:15,837 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:15,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:15,862 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:15,865 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:15,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,867 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:15,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:53:15,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:15,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:15,880 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:15,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:15,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:15,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:15,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:15,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:15,886 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:15,889 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:53:15,889 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:53:15,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:15,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:15,892 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:15,893 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:15,893 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:15,896 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:15,896 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:53:15,896 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:15,897 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 2*x + 1 Supporting invariants [] [2025-04-26 16:53:15,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:53:15,905 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:15,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:15,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,948 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,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:15,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:15,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:15,974 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,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:15,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:15,975 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:15,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:15,996 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:16,014 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:16,016 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (in total 46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 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:16,109 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.7037037037037037) internal successors, (in total 46), 27 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 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 119 states and 196 transitions. Complement of second has 8 states. [2025-04-26 16:53:16,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:16,112 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:16,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2025-04-26 16:53:16,115 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:53:16,116 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:16,116 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:53:16,116 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:16,116 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 39 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:53:16,116 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:16,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 196 transitions. [2025-04-26 16:53:16,121 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 14 [2025-04-26 16:53:16,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 40 states and 76 transitions. [2025-04-26 16:53:16,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-04-26 16:53:16,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2025-04-26 16:53:16,128 INFO L74 IsDeterministic]: Start isDeterministic. Operand 40 states and 76 transitions. [2025-04-26 16:53:16,128 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:16,128 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 76 transitions. [2025-04-26 16:53:16,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 76 transitions. [2025-04-26 16:53:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2025-04-26 16:53:16,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (in total 58), 29 states have internal predecessors, (58), 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,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 58 transitions. [2025-04-26 16:53:16,146 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 58 transitions. [2025-04-26 16:53:16,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:16,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:53:16,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:53:16,149 INFO L87 Difference]: Start difference. First operand 30 states and 58 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 2 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:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:16,167 INFO L93 Difference]: Finished difference Result 28 states and 44 transitions. [2025-04-26 16:53:16,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 44 transitions. [2025-04-26 16:53:16,168 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 14 [2025-04-26 16:53:16,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 42 transitions. [2025-04-26 16:53:16,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-04-26 16:53:16,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-04-26 16:53:16,168 INFO L74 IsDeterministic]: Start isDeterministic. Operand 26 states and 42 transitions. [2025-04-26 16:53:16,168 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:53:16,168 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 42 transitions. [2025-04-26 16:53:16,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 42 transitions. [2025-04-26 16:53:16,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2025-04-26 16:53:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (in total 35), 20 states have internal predecessors, (35), 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,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2025-04-26 16:53:16,170 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 35 transitions. [2025-04-26 16:53:16,172 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:53:16,172 INFO L438 stractBuchiCegarLoop]: Abstraction has 21 states and 35 transitions. [2025-04-26 16:53:16,173 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:53:16,173 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 35 transitions. [2025-04-26 16:53:16,173 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 14 [2025-04-26 16:53:16,173 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:16,173 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:16,173 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:53:16,173 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:16,174 INFO L752 eck$LassoCheckResult]: Stem: "[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0]" "[47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1]" "[34] L24-->decFINAL: Formula: (<= (+ v_x_4 1) 0) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" [2025-04-26 16:53:16,174 INFO L754 eck$LassoCheckResult]: Loop: "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" [2025-04-26 16:53:16,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1801444, now seen corresponding path program 1 times [2025-04-26 16:53:16,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486953353] [2025-04-26 16:53:16,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:16,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:16,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:16,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,179 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:16,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:16,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:16,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,182 INFO L85 PathProgramCache]: Analyzing trace with hash 2211, now seen corresponding path program 1 times [2025-04-26 16:53:16,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451128517] [2025-04-26 16:53:16,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:16,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:16,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:16,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,184 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:16,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:16,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:16,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1731188934, now seen corresponding path program 1 times [2025-04-26 16:53:16,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778668558] [2025-04-26 16:53:16,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:16,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:16,188 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,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,189 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:16,192 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,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:16,205 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:16,206 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:16,206 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:16,206 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:16,206 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:53:16,206 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,206 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:16,206 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:16,206 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration2_Loop [2025-04-26 16:53:16,206 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:16,206 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:16,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:16,227 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:16,227 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:53:16,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,230 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:16,231 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:16,232 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:53:16,232 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:16,247 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:16,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,250 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:16,250 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:16,252 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:53:16,252 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:16,274 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:53:16,278 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:16,278 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:16,278 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:16,278 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:16,278 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:16,279 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:16,279 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,279 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:16,279 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:16,279 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration2_Loop [2025-04-26 16:53:16,279 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:16,279 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:16,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:16,296 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:16,296 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:16,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,298 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:16,299 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:16,299 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:16,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:16,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:16,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:16,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:16,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:16,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:16,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:16,312 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:16,314 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:53:16,314 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:53:16,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,316 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:16,316 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:16,317 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:16,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:16,320 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:53:16,320 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:16,320 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -1*x Supporting invariants [] [2025-04-26 16:53:16,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:16,325 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:16,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:16,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:16,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:16,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:16,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:16,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:16,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:16,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:16,351 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:16,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:16,363 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:16,363 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:16,363 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 35 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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,382 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 35 transitions. cyclomatic complexity: 20. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 40 states and 62 transitions. Complement of second has 6 states. [2025-04-26 16:53:16,382 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:16,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2025-04-26 16:53:16,383 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:53:16,383 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:16,383 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:53:16,383 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:16,383 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:53:16,383 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:16,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 62 transitions. [2025-04-26 16:53:16,384 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2025-04-26 16:53:16,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 13 states and 20 transitions. [2025-04-26 16:53:16,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-04-26 16:53:16,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-04-26 16:53:16,384 INFO L74 IsDeterministic]: Start isDeterministic. Operand 13 states and 20 transitions. [2025-04-26 16:53:16,385 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:53:16,385 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-04-26 16:53:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 20 transitions. [2025-04-26 16:53:16,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-04-26 16:53:16,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (in total 20), 12 states have internal predecessors, (20), 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,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2025-04-26 16:53:16,385 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-04-26 16:53:16,385 INFO L438 stractBuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2025-04-26 16:53:16,385 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:53:16,386 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2025-04-26 16:53:16,386 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2025-04-26 16:53:16,386 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:16,386 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:16,386 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:53:16,386 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:16,386 INFO L752 eck$LassoCheckResult]: Stem: "[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0]" "[47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" [2025-04-26 16:53:16,386 INFO L754 eck$LassoCheckResult]: Loop: "[35] L24-->L25: Formula: (< 0 (+ v_x_1 1)) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L25-->L24: Formula: (= v_x_3 (+ v_x_2 1)) InVars {x=v_x_3} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:53:16,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,387 INFO L85 PathProgramCache]: Analyzing trace with hash 55844960, now seen corresponding path program 1 times [2025-04-26 16:53:16,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95643168] [2025-04-26 16:53:16,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:16,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:16,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:16,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,392 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:16,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:16,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:16,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2083, now seen corresponding path program 2 times [2025-04-26 16:53:16,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587444010] [2025-04-26 16:53:16,397 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:16,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,401 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:16,401 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:16,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:16,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,403 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:16,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:16,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:16,405 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,405 INFO L85 PathProgramCache]: Analyzing trace with hash 2127400130, now seen corresponding path program 1 times [2025-04-26 16:53:16,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742378805] [2025-04-26 16:53:16,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:16,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:16,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:16,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:16,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:16,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:16,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742378805] [2025-04-26 16:53:16,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742378805] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:53:16,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951321058] [2025-04-26 16:53:16,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:16,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:53:16,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,441 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:53:16,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-26 16:53:16,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:53:16,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:53:16,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:16,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:53:16,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:16,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:53:16,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:16,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951321058] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:53:16,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:53:16,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-26 16:53:16,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619136401] [2025-04-26 16:53:16,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:53:16,500 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:16,500 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:16,500 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:16,500 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:16,500 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:53:16,500 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,500 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:16,500 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:16,500 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration3_Loop [2025-04-26 16:53:16,500 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:16,500 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:16,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:16,519 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:16,519 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:53:16,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,521 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:16,523 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:16,524 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:53:16,524 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:16,540 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:16,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,542 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:16,542 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:16,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:53:16,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:16,567 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:53:16,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:53:16,571 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:16,571 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:16,571 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:16,571 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:16,571 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:16,571 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,571 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:16,571 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:16,571 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration3_Loop [2025-04-26 16:53:16,571 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:16,571 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:16,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:16,591 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:16,591 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:16,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,593 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:16,594 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:16,595 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:16,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:16,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:16,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:16,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:16,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:16,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:16,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:16,607 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:16,609 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:53:16,609 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:53:16,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,611 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:16,612 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:16,612 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:16,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:53:16,615 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:53:16,615 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:16,615 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 2*x + 1 Supporting invariants [] [2025-04-26 16:53:16,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:16,623 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:16,635 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:53:16,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:53:16,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:16,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:16,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:16,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:16,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:16,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:16,650 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:16,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:16,665 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:16,666 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:16,666 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10 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:16,695 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10. 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 42 states and 74 transitions. Complement of second has 8 states. [2025-04-26 16:53:16,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:16,698 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:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2025-04-26 16:53:16,698 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:53:16,698 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:16,698 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:53:16,698 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:16,698 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:53:16,698 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:16,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 74 transitions. [2025-04-26 16:53:16,700 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2025-04-26 16:53:16,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 23 states and 39 transitions. [2025-04-26 16:53:16,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-04-26 16:53:16,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-04-26 16:53:16,700 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23 states and 39 transitions. [2025-04-26 16:53:16,700 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:16,700 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 39 transitions. [2025-04-26 16:53:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 39 transitions. [2025-04-26 16:53:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-04-26 16:53:16,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.6666666666666667) internal successors, (in total 35), 20 states have internal predecessors, (35), 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,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2025-04-26 16:53:16,702 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 35 transitions. [2025-04-26 16:53:16,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:16,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:53:16,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:53:16,702 INFO L87 Difference]: Start difference. First operand 21 states and 35 transitions. Second operand has 4 states, 4 states have (on average 1.75) 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:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:16,719 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2025-04-26 16:53:16,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2025-04-26 16:53:16,719 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2025-04-26 16:53:16,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 23 transitions. [2025-04-26 16:53:16,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-04-26 16:53:16,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-04-26 16:53:16,720 INFO L74 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2025-04-26 16:53:16,720 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:53:16,720 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2025-04-26 16:53:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2025-04-26 16:53:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2025-04-26 16:53:16,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (in total 20), 13 states have internal predecessors, (20), 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,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2025-04-26 16:53:16,721 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-04-26 16:53:16,724 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:53:16,725 INFO L438 stractBuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2025-04-26 16:53:16,725 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:53:16,725 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2025-04-26 16:53:16,725 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2025-04-26 16:53:16,725 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:16,725 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:16,725 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:53:16,725 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2025-04-26 16:53:16,726 INFO L752 eck$LassoCheckResult]: Stem: "[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0]" "[47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" [2025-04-26 16:53:16,726 INFO L754 eck$LassoCheckResult]: Loop: "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[35] L24-->L25: Formula: (< 0 (+ v_x_1 1)) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[37] L25-->L24: Formula: (= v_x_3 (+ v_x_2 1)) InVars {x=v_x_3} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:53:16,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1801449, now seen corresponding path program 1 times [2025-04-26 16:53:16,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271580837] [2025-04-26 16:53:16,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:16,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:16,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:16,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,729 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:16,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:16,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:16,731 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2098572503, now seen corresponding path program 1 times [2025-04-26 16:53:16,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390060574] [2025-04-26 16:53:16,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:16,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:16,738 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,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-26 16:53:16,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:16,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390060574] [2025-04-26 16:53:16,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390060574] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:16,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:16,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:53:16,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522129784] [2025-04-26 16:53:16,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:16,755 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-04-26 16:53:16,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:16,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:53:16,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:53:16,756 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 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:16,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:16,767 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2025-04-26 16:53:16,767 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2025-04-26 16:53:16,767 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-04-26 16:53:16,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 18 transitions. [2025-04-26 16:53:16,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-04-26 16:53:16,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-04-26 16:53:16,768 INFO L74 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2025-04-26 16:53:16,768 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:53:16,768 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-04-26 16:53:16,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2025-04-26 16:53:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-04-26 16:53:16,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (in total 17), 12 states have internal predecessors, (17), 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,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-04-26 16:53:16,769 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-04-26 16:53:16,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:53:16,771 INFO L438 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-04-26 16:53:16,771 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:53:16,771 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2025-04-26 16:53:16,771 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2025-04-26 16:53:16,771 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:16,771 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:16,772 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2025-04-26 16:53:16,772 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:53:16,772 INFO L752 eck$LassoCheckResult]: Stem: "[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0]" "[47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" [2025-04-26 16:53:16,772 INFO L754 eck$LassoCheckResult]: Loop: "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" [2025-04-26 16:53:16,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1731193799, now seen corresponding path program 2 times [2025-04-26 16:53:16,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564410952] [2025-04-26 16:53:16,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:16,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,776 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 6 statements into 2 equivalence classes. [2025-04-26 16:53:16,777 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,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:53:16,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:16,779 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,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:16,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,780 INFO L85 PathProgramCache]: Analyzing trace with hash 2271, now seen corresponding path program 2 times [2025-04-26 16:53:16,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622002533] [2025-04-26 16:53:16,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:16,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:16,782 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:16,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:16,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,782 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:16,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:16,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:16,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:16,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:16,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:16,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:16,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1524898597, now seen corresponding path program 3 times [2025-04-26 16:53:16,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:16,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945587720] [2025-04-26 16:53:16,787 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:53:16,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:16,790 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 3 equivalence classes. [2025-04-26 16:53:16,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:53:16,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 16:53:16,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:16,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:16,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945587720] [2025-04-26 16:53:16,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945587720] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:16,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:16,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:53:16,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806271065] [2025-04-26 16:53:16,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:16,835 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:16,835 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:16,835 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:16,835 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:16,835 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:53:16,835 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,835 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:16,835 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:16,835 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration5_Loop [2025-04-26 16:53:16,835 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:16,835 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:16,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:16,851 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:16,851 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:53:16,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,853 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:16,855 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:16,856 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:53:16,856 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:16,872 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:16,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,874 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:16,874 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:16,875 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:53:16,875 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:53:16,924 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:53:16,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:53:16,928 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:16,928 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:16,928 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:16,928 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:16,929 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:16,929 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,929 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:16,929 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:16,929 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration5_Loop [2025-04-26 16:53:16,929 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:16,929 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:16,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:16,953 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:16,953 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:16,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,955 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:16,957 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:16,958 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:16,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:16,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:16,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:16,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:16,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:16,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:16,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:16,972 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:16,975 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:53:16,975 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:53:16,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:16,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:16,978 INFO L229 MonitoredProcess]: Starting monitored process 19 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:16,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:53:16,980 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:16,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:16,983 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:53:16,983 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:16,983 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -1*x Supporting invariants [] [2025-04-26 16:53:16,989 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:16,989 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:53:17,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:17,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:17,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:17,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:17,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:17,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:17,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:17,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:53:17,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:53:17,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:17,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:17,017 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:17,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:17,025 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:17,025 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:17,026 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:17,050 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 40 states and 58 transitions. Complement of second has 7 states. [2025-04-26 16:53:17,052 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:17,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2025-04-26 16:53:17,052 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:53:17,052 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:17,052 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:53:17,053 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:17,053 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:53:17,053 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:17,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 58 transitions. [2025-04-26 16:53:17,054 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2025-04-26 16:53:17,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 31 states and 45 transitions. [2025-04-26 16:53:17,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-04-26 16:53:17,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-04-26 16:53:17,054 INFO L74 IsDeterministic]: Start isDeterministic. Operand 31 states and 45 transitions. [2025-04-26 16:53:17,054 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:17,054 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 45 transitions. [2025-04-26 16:53:17,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 45 transitions. [2025-04-26 16:53:17,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2025-04-26 16:53:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4545454545454546) internal successors, (in total 32), 21 states have internal predecessors, (32), 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:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2025-04-26 16:53:17,055 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 32 transitions. [2025-04-26 16:53:17,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:17,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:53:17,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:53:17,056 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:17,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:17,076 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2025-04-26 16:53:17,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 34 transitions. [2025-04-26 16:53:17,076 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 16:53:17,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 29 transitions. [2025-04-26 16:53:17,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-04-26 16:53:17,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2025-04-26 16:53:17,076 INFO L74 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2025-04-26 16:53:17,077 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:53:17,077 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 29 transitions. [2025-04-26 16:53:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2025-04-26 16:53:17,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2025-04-26 16:53:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (in total 19), 13 states have internal predecessors, (19), 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:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2025-04-26 16:53:17,077 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-04-26 16:53:17,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:53:17,079 INFO L438 stractBuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2025-04-26 16:53:17,079 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:53:17,079 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2025-04-26 16:53:17,079 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2025-04-26 16:53:17,079 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:17,079 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:17,080 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2025-04-26 16:53:17,080 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:53:17,080 INFO L752 eck$LassoCheckResult]: Stem: "[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0]" "[47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" [2025-04-26 16:53:17,080 INFO L754 eck$LassoCheckResult]: Loop: "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[35] L24-->L25: Formula: (< 0 (+ v_x_1 1)) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L25-->L24: Formula: (= v_x_3 (+ v_x_2 1)) InVars {x=v_x_3} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" [2025-04-26 16:53:17,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:17,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1731193799, now seen corresponding path program 4 times [2025-04-26 16:53:17,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:17,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572876104] [2025-04-26 16:53:17,080 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:53:17,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:17,083 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 6 statements into 2 equivalence classes. [2025-04-26 16:53:17,084 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:17,084 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:53:17,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:17,084 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:17,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:17,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:17,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:17,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:17,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:17,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:17,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2179773, now seen corresponding path program 2 times [2025-04-26 16:53:17,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:17,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052799812] [2025-04-26 16:53:17,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:17,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:17,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 2 equivalence classes. [2025-04-26 16:53:17,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:17,094 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:53:17,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:17,094 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:17,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:53:17,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:53:17,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:17,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:17,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:17,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:17,098 INFO L85 PathProgramCache]: Analyzing trace with hash 843701123, now seen corresponding path program 2 times [2025-04-26 16:53:17,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:17,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474633527] [2025-04-26 16:53:17,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:17,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:17,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-26 16:53:17,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:53:17,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:53:17,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:17,102 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:17,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:53:17,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:53:17,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:17,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:17,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:17,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:17,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:17,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:17,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:17,177 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:17,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:53:17,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:53:17,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:17,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:17,193 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:17,201 INFO L201 PluginConnector]: Adding new model concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:53:17 BoogieIcfgContainer [2025-04-26 16:53:17,201 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:53:17,202 INFO L158 Benchmark]: Toolchain (without parser) took 2133.73ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 86.3MB in the beginning and 32.1MB in the end (delta: 54.2MB). Peak memory consumption was 44.8MB. Max. memory is 8.0GB. [2025-04-26 16:53:17,202 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.81ms. Allocated memory is still 155.2MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:17,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.56ms. Allocated memory is still 155.2MB. Free memory was 86.3MB in the beginning and 84.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:17,202 INFO L158 Benchmark]: Boogie Preprocessor took 17.37ms. Allocated memory is still 155.2MB. Free memory was 84.4MB in the beginning and 83.4MB in the end (delta: 969.4kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:53:17,202 INFO L158 Benchmark]: RCFGBuilder took 137.16ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 75.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:53:17,203 INFO L158 Benchmark]: BuchiAutomizer took 1945.31ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 74.9MB in the beginning and 32.1MB in the end (delta: 42.8MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. [2025-04-26 16:53:17,204 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.81ms. Allocated memory is still 155.2MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.56ms. Allocated memory is still 155.2MB. Free memory was 86.3MB in the beginning and 84.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.37ms. Allocated memory is still 155.2MB. Free memory was 84.4MB in the beginning and 83.4MB in the end (delta: 969.4kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 137.16ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 75.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1945.31ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 74.9MB in the beginning and 32.1MB in the end (delta: 42.8MB). Peak memory consumption was 32.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 36 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, 72 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 141 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 41 mSDtfsCounter, 141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT1 conc0 concLT3 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq154 hnf94 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 31ms 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.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 126, Number of transitions in reduction automaton: 46, Number of states in reduction automaton: 28, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 2 * x + 1 and consists of 5 locations. One deterministic module has affine ranking function -1 * x and consists of 4 locations. One deterministic module has affine ranking function 2 * x + 1 and consists of 5 locations. One deterministic module has affine ranking function -1 * x and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 14 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 33]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L13] 0 x := -2; VAL [x=-2] [L15] FORK 0 fork 1 dec(); VAL [x=-2] [L16] FORK 0 fork 2, 2 inc(); VAL [x=-2] [L32] COND TRUE 2 x < 0 VAL [x=-2] [L33] 2 x := x + 1; VAL [x=-1] [L32] COND TRUE 2 x < 0 VAL [x=-1] Loop: [L33] x := x + 1; [L24] COND TRUE x > -1 [L25] x := x - 1; [L32] COND TRUE x < 0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 33]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L13] 0 x := -2; VAL [x=-2] [L15] FORK 0 fork 1 dec(); VAL [x=-2] [L16] FORK 0 fork 2, 2 inc(); VAL [x=-2] [L32] COND TRUE 2 x < 0 VAL [x=-2] [L33] 2 x := x + 1; VAL [x=-1] [L32] COND TRUE 2 x < 0 VAL [x=-1] Loop: [L33] x := x + 1; [L24] COND TRUE x > -1 [L25] x := x - 1; [L32] COND TRUE x < 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:53:17,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-26 16:53:17,419 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...