/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 /storage/cav23-termute-examples/2_thr/lock2.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:45,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:45,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:45,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:45,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:45,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:45,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:45,333 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:45,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:45,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:45,335 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:45,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:45,335 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:45,336 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:45,336 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:45,336 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:45,336 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:45,336 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:45,336 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:45,336 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:45,336 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:45,336 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:45,336 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:45,336 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:45,336 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:45,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:45,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:45,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:45,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:45,336 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:45,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:45,336 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:45,337 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:45,337 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:45,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:45,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:45,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:45,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:45,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:45,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:45,337 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:45,337 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:45,337 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:45,563 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:45,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:45,571 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:45,572 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:45,572 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:45,574 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/lock2.c.bpl [2025-04-26 16:56:45,574 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/lock2.c.bpl' [2025-04-26 16:56:45,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:45,589 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:45,590 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:45,590 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:45,590 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:45,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:45" (1/1) ... [2025-04-26 16:56:45,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:45" (1/1) ... [2025-04-26 16:56:45,620 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:45,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:45,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:45,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:45,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:45,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:45" (1/1) ... [2025-04-26 16:56:45,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:45" (1/1) ... [2025-04-26 16:56:45,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:45" (1/1) ... [2025-04-26 16:56:45,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:45" (1/1) ... [2025-04-26 16:56:45,631 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:45" (1/1) ... [2025-04-26 16:56:45,631 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:45" (1/1) ... [2025-04-26 16:56:45,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:45" (1/1) ... [2025-04-26 16:56:45,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:45" (1/1) ... [2025-04-26 16:56:45,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:45" (1/1) ... [2025-04-26 16:56:45,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:45,645 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:45,645 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:45,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:45,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:45" (1/1) ... [2025-04-26 16:56:45,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:45,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:45,670 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:45,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:56:45,694 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:45,695 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:45,695 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:45,695 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:45,695 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:45,695 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:45,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:45,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:45,695 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:56:45,737 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:45,739 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:45,818 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:45,819 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:45,833 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:45,833 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:45,833 INFO L201 PluginConnector]: Adding new model lock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:45 BoogieIcfgContainer [2025-04-26 16:56:45,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:45,834 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:45,834 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:45,843 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:45,843 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:45,843 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:45" (1/2) ... [2025-04-26 16:56:45,844 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11045578 and model type lock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:45, skipping insertion in model container [2025-04-26 16:56:45,844 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:45,845 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "lock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:45" (2/2) ... [2025-04-26 16:56:45,845 INFO L376 chiAutomizerObserver]: Analyzing ICFG lock2.c.bpl [2025-04-26 16:56:45,893 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:56:45,937 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:45,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:45,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:45,945 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:45,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:56:46,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 26 transitions, 66 flow [2025-04-26 16:56:46,023 INFO L116 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-04-26 16:56:46,026 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:56:46,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 3/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 35 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-04-26 16:56:46,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 26 transitions, 66 flow [2025-04-26 16:56:46,033 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 22 transitions, 56 flow [2025-04-26 16:56:46,033 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 26 places, 22 transitions, 56 flow [2025-04-26 16:56:46,040 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:46,186 WARN L140 AmpleReduction]: Number of pruned transitions: 39 [2025-04-26 16:56:46,186 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:46,186 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 10 [2025-04-26 16:56:46,186 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:32 [2025-04-26 16:56:46,186 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:34 [2025-04-26 16:56:46,187 WARN L145 AmpleReduction]: Times succ was already a loop node:16 [2025-04-26 16:56:46,187 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:6 [2025-04-26 16:56:46,187 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:46,189 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 77 states, 76 states have (on average 1.605263157894737) internal successors, (in total 122), 76 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:46,194 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:46,194 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:46,194 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:46,195 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:46,195 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:46,195 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:46,195 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:46,195 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:46,196 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 77 states, 76 states have (on average 1.605263157894737) internal successors, (in total 122), 76 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:46,206 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 49 [2025-04-26 16:56:46,207 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:46,207 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:46,210 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:46,210 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:46,210 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:46,210 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 77 states, 76 states have (on average 1.605263157894737) internal successors, (in total 122), 76 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:46,213 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 49 [2025-04-26 16:56:46,213 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:46,214 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:46,214 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:56:46,214 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:46,219 INFO L752 eck$LassoCheckResult]: Stem: "[82] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[60] $Ultimate##0-->L27: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" [2025-04-26 16:56:46,219 INFO L754 eck$LassoCheckResult]: Loop: "[62] L27-->L29: Formula: (< v_x1_1 v_z_2) InVars {x1=v_x1_1, z=v_z_2} OutVars{x1=v_x1_1, z=v_z_2} AuxVars[] AssignedVars[]" "[64] L29-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[67] L30-->L27: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" [2025-04-26 16:56:46,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:46,225 INFO L85 PathProgramCache]: Analyzing trace with hash 3563, now seen corresponding path program 1 times [2025-04-26 16:56:46,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:46,231 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63242694] [2025-04-26 16:56:46,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:46,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:46,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:46,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:46,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:46,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:46,285 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:46,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:46,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:46,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:46,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:46,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:46,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:46,305 INFO L85 PathProgramCache]: Analyzing trace with hash 91424, now seen corresponding path program 1 times [2025-04-26 16:56:46,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:46,305 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612866271] [2025-04-26 16:56:46,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:46,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:46,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:46,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:46,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:46,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:46,314 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:46,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:46,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:46,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:46,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:46,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:46,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:46,321 INFO L85 PathProgramCache]: Analyzing trace with hash 106206966, now seen corresponding path program 1 times [2025-04-26 16:56:46,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:46,322 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900823092] [2025-04-26 16:56:46,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:46,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:46,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:46,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:46,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:46,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:46,328 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:46,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:46,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:46,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:46,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:46,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:46,390 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:46,391 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:46,391 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:46,391 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:46,391 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:46,391 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:46,391 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:46,391 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:46,391 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:46,391 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:46,392 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:46,401 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:46,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:46,452 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:46,453 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:46,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:46,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:46,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:46,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:56:46,459 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:46,459 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:46,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:56:46,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:46,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:46,483 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:46,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:56:46,486 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:46,486 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:46,551 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:46,555 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:56:46,556 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:46,556 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:46,556 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:46,556 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:46,556 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:46,556 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:46,556 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:46,556 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:46,556 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:56:46,556 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:46,556 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:46,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:46,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:46,616 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:46,619 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:46,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:46,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:46,622 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:46,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:56:46,625 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:46,637 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:46,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:46,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:46,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:46,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:46,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:46,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:46,643 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:46,651 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:56:46,651 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:46,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:46,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:46,656 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:46,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:56:46,657 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:46,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:46,662 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:46,662 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:46,663 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 16:56:46,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:46,671 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:46,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:46,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:46,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:46,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:46,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:46,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:46,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:46,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:46,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:46,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:46,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:46,727 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:46,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:46,836 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:56:46,838 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 77 states, 76 states have (on average 1.605263157894737) internal successors, (in total 122), 76 states have internal predecessors, (122), 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 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 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:56:46,927 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 77 states, 76 states have (on average 1.605263157894737) internal successors, (in total 122), 76 states have internal predecessors, (122), 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 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 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) Result 224 states and 378 transitions. Complement of second has 7 states. [2025-04-26 16:56:46,934 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:56:46,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 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:56:46,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2025-04-26 16:56:46,943 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 16:56:46,945 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:46,945 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 16:56:46,945 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:46,945 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 16:56:46,945 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:46,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 378 transitions. [2025-04-26 16:56:46,957 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 55 [2025-04-26 16:56:46,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 147 states and 257 transitions. [2025-04-26 16:56:46,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2025-04-26 16:56:46,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2025-04-26 16:56:46,965 INFO L74 IsDeterministic]: Start isDeterministic. Operand 147 states and 257 transitions. [2025-04-26 16:56:46,965 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:46,965 INFO L218 hiAutomatonCegarLoop]: Abstraction has 147 states and 257 transitions. [2025-04-26 16:56:46,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 257 transitions. [2025-04-26 16:56:46,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 106. [2025-04-26 16:56:46,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.8113207547169812) internal successors, (in total 192), 105 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:46,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 192 transitions. [2025-04-26 16:56:46,993 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 192 transitions. [2025-04-26 16:56:46,993 INFO L438 stractBuchiCegarLoop]: Abstraction has 106 states and 192 transitions. [2025-04-26 16:56:46,993 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:46,993 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 192 transitions. [2025-04-26 16:56:46,995 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 43 [2025-04-26 16:56:46,995 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:46,995 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:46,995 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:46,995 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:46,998 INFO L752 eck$LassoCheckResult]: Stem: "[82] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[79] L13-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[70] $Ultimate##0-->L47: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" [2025-04-26 16:56:46,999 INFO L754 eck$LassoCheckResult]: Loop: "[72] L47-->L49: Formula: (< v_x2_3 v_z_5) InVars {x2=v_x2_3, z=v_z_5} OutVars{x2=v_x2_3, z=v_z_5} AuxVars[] AssignedVars[]" "[74] L49-->L50: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[76] L50-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-04-26 16:56:46,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:46,999 INFO L85 PathProgramCache]: Analyzing trace with hash 111112, now seen corresponding path program 1 times [2025-04-26 16:56:46,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:46,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022078736] [2025-04-26 16:56:46,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:47,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:47,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:47,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:47,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:47,005 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:47,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:47,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:47,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:47,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:47,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:47,010 INFO L85 PathProgramCache]: Analyzing trace with hash 101353, now seen corresponding path program 1 times [2025-04-26 16:56:47,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:47,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907110650] [2025-04-26 16:56:47,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:47,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:47,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:47,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:47,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:47,015 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:47,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:47,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:47,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:47,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:47,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:47,019 INFO L85 PathProgramCache]: Analyzing trace with hash -984758142, now seen corresponding path program 1 times [2025-04-26 16:56:47,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:47,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090625124] [2025-04-26 16:56:47,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:47,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:47,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:47,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:47,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:47,027 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:47,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:47,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:47,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:47,034 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:47,060 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:47,060 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:47,060 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:47,060 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:47,060 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:47,060 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,060 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:47,060 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:47,060 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:47,060 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:47,060 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:47,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:47,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:47,093 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:47,094 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:47,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:47,097 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:56:47,099 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:56:47,100 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:47,100 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:47,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:47,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:47,120 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:56:47,122 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:56:47,123 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:47,123 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:47,148 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:47,148 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {x1=0} Honda state: {x1=0} Generalized eigenvectors: [{x1=-1}, {x1=7}, {x1=-7}] Lambdas: [1, 2, 1] Nus: [0, 1] [2025-04-26 16:56:47,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:47,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:47,158 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:56:47,158 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:56:47,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:47,159 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:47,176 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:56:47,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:47,178 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:56:47,181 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:56:47,182 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:47,182 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:47,247 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:47,252 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:56:47,252 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:47,252 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:47,252 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:47,252 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:47,252 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:47,252 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,252 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:47,252 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:47,252 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:56:47,252 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:47,252 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:47,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:47,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:47,285 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:47,285 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:47,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:47,289 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:47,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:56:47,291 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:47,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:47,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:47,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:47,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:47,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:47,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:47,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:47,305 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:47,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:47,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:47,313 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:56:47,314 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:56:47,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:47,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:47,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:47,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:47,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:47,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:47,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:47,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:47,332 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:47,334 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:47,334 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:47,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:47,335 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:56:47,336 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:56:47,337 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:47,340 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:56:47,340 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:47,340 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:47,340 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 16:56:47,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:47,347 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:47,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:47,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:47,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:47,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:47,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:47,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:47,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:47,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:47,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:47,379 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:47,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:47,407 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:56:47,407 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 192 transitions. cyclomatic complexity: 106 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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:56:47,454 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 192 transitions. cyclomatic complexity: 106. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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 291 states and 497 transitions. Complement of second has 7 states. [2025-04-26 16:56:47,454 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:56:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 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:56:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-04-26 16:56:47,455 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:56:47,455 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:47,455 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:56:47,455 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:47,455 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:56:47,456 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:47,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 291 states and 497 transitions. [2025-04-26 16:56:47,459 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 52 [2025-04-26 16:56:47,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 291 states to 213 states and 375 transitions. [2025-04-26 16:56:47,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2025-04-26 16:56:47,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2025-04-26 16:56:47,463 INFO L74 IsDeterministic]: Start isDeterministic. Operand 213 states and 375 transitions. [2025-04-26 16:56:47,463 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:47,463 INFO L218 hiAutomatonCegarLoop]: Abstraction has 213 states and 375 transitions. [2025-04-26 16:56:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states and 375 transitions. [2025-04-26 16:56:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 164. [2025-04-26 16:56:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 164 states have (on average 1.8658536585365855) internal successors, (in total 306), 163 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 306 transitions. [2025-04-26 16:56:47,477 INFO L240 hiAutomatonCegarLoop]: Abstraction has 164 states and 306 transitions. [2025-04-26 16:56:47,477 INFO L438 stractBuchiCegarLoop]: Abstraction has 164 states and 306 transitions. [2025-04-26 16:56:47,477 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:47,477 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 164 states and 306 transitions. [2025-04-26 16:56:47,478 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 46 [2025-04-26 16:56:47,478 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:47,479 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:47,482 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:56:47,482 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:47,482 INFO L752 eck$LassoCheckResult]: Stem: "[82] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[60] $Ultimate##0-->L27: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[61] L27-->L32: Formula: (<= v_z_3 v_x1_4) InVars {x1=v_x1_4, z=v_z_3} OutVars{x1=v_x1_4, z=v_z_3} AuxVars[] AssignedVars[]" "[63] L32-->L33-1: Formula: (= v_l_3 1) InVars {} OutVars{l=v_l_3} AuxVars[] AssignedVars[l]" [2025-04-26 16:56:47,482 INFO L754 eck$LassoCheckResult]: Loop: "[66] L33-1-->L35: Formula: (< v_x3_2 v_z_4) InVars {x3=v_x3_2, z=v_z_4} OutVars{x3=v_x3_2, z=v_z_4} AuxVars[] AssignedVars[]" "[69] L35-->L33-1: Formula: (= (+ v_x3_4 1) v_x3_3) InVars {x3=v_x3_4} OutVars{x3=v_x3_3} AuxVars[] AssignedVars[x3]" [2025-04-26 16:56:47,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:47,483 INFO L85 PathProgramCache]: Analyzing trace with hash 3425997, now seen corresponding path program 1 times [2025-04-26 16:56:47,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:47,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050541587] [2025-04-26 16:56:47,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:47,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:47,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:47,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:47,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:47,488 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:47,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:47,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:47,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:47,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:47,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:47,493 INFO L85 PathProgramCache]: Analyzing trace with hash 3076, now seen corresponding path program 1 times [2025-04-26 16:56:47,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:47,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712835447] [2025-04-26 16:56:47,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:47,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:47,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:47,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:47,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:47,500 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:47,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:47,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:47,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:47,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:47,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:47,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1002582064, now seen corresponding path program 1 times [2025-04-26 16:56:47,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:47,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296166035] [2025-04-26 16:56:47,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:47,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:47,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:47,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:47,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:47,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:47,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:47,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:47,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:47,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:47,523 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:47,524 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:47,524 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:47,524 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:47,524 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:47,524 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,524 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:47,524 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:47,524 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:47,524 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:47,524 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:47,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:47,539 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:47,539 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:47,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:47,541 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:56:47,543 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:56:47,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:47,544 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:47,559 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:56:47,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:47,561 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:56:47,562 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:56:47,563 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:47,563 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:47,631 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:47,635 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:56:47,635 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:47,635 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:47,635 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:47,635 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:47,635 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:47,635 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,635 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:47,635 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:47,635 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:56:47,635 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:47,635 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:47,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:47,658 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:47,658 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:47,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:47,660 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:56:47,662 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:56:47,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:47,673 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:47,673 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:47,673 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:47,673 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:47,673 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:47,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:47,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:47,677 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:47,679 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:47,679 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:47,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:47,702 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:56:47,704 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:56:47,704 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:47,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:47,707 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:47,707 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:47,707 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x3, z) = -1*x3 + 1*z Supporting invariants [] [2025-04-26 16:56:47,712 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:56:47,713 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:47,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:47,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:47,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:47,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:47,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:47,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:47,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:47,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:47,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:47,744 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:47,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:47,757 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:47,757 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 164 states and 306 transitions. cyclomatic complexity: 168 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:56:47,800 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 164 states and 306 transitions. cyclomatic complexity: 168. 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 242 states and 450 transitions. Complement of second has 6 states. [2025-04-26 16:56:47,800 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:56:47,801 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:56:47,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2025-04-26 16:56:47,801 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:56:47,801 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:47,801 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:56:47,801 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:47,801 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:56:47,801 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:47,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 242 states and 450 transitions. [2025-04-26 16:56:47,804 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 26 [2025-04-26 16:56:47,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 242 states to 121 states and 208 transitions. [2025-04-26 16:56:47,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2025-04-26 16:56:47,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2025-04-26 16:56:47,805 INFO L74 IsDeterministic]: Start isDeterministic. Operand 121 states and 208 transitions. [2025-04-26 16:56:47,805 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:47,805 INFO L218 hiAutomatonCegarLoop]: Abstraction has 121 states and 208 transitions. [2025-04-26 16:56:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 208 transitions. [2025-04-26 16:56:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2025-04-26 16:56:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.735042735042735) internal successors, (in total 203), 116 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 203 transitions. [2025-04-26 16:56:47,809 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 203 transitions. [2025-04-26 16:56:47,809 INFO L438 stractBuchiCegarLoop]: Abstraction has 117 states and 203 transitions. [2025-04-26 16:56:47,809 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:47,809 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 203 transitions. [2025-04-26 16:56:47,810 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 26 [2025-04-26 16:56:47,810 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:47,810 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:47,810 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:47,810 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:47,810 INFO L752 eck$LassoCheckResult]: Stem: "[82] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[60] $Ultimate##0-->L27: Formula: (and (= v_l_7 0) (< 0 v_l_8)) InVars {l=v_l_8} OutVars{l=v_l_7} AuxVars[] AssignedVars[l]" "[79] L13-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[70] $Ultimate##0-->L47: Formula: (and (= v_l_11 0) (< 0 v_l_12)) InVars {l=v_l_12} OutVars{l=v_l_11} AuxVars[] AssignedVars[l]" "[72] L47-->L49: Formula: (< v_x2_3 v_z_5) InVars {x2=v_x2_3, z=v_z_5} OutVars{x2=v_x2_3, z=v_z_5} AuxVars[] AssignedVars[]" "[74] L49-->L50: Formula: (= (+ v_x2_5 1) v_x2_4) InVars {x2=v_x2_5} OutVars{x2=v_x2_4} AuxVars[] AssignedVars[x2]" "[76] L50-->L47: Formula: (= v_x1_6 (+ v_x1_5 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[71] L47-->L52: Formula: (<= v_z_6 v_x2_6) InVars {x2=v_x2_6, z=v_z_6} OutVars{x2=v_x2_6, z=v_z_6} AuxVars[] AssignedVars[]" [2025-04-26 16:56:47,810 INFO L754 eck$LassoCheckResult]: Loop: "[62] L27-->L29: Formula: (< v_x1_1 v_z_2) InVars {x1=v_x1_1, z=v_z_2} OutVars{x1=v_x1_1, z=v_z_2} AuxVars[] AssignedVars[]" "[64] L29-->L30: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[67] L30-->L27: Formula: (= v_x2_2 (+ v_x2_1 1)) InVars {x2=v_x2_2} OutVars{x2=v_x2_1} AuxVars[] AssignedVars[x2]" [2025-04-26 16:56:47,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:47,811 INFO L85 PathProgramCache]: Analyzing trace with hash -886713857, now seen corresponding path program 1 times [2025-04-26 16:56:47,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:47,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270515515] [2025-04-26 16:56:47,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:47,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:47,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:47,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:47,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:56:47,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:47,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270515515] [2025-04-26 16:56:47,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270515515] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:47,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:47,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:47,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560323625] [2025-04-26 16:56:47,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:47,851 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:56:47,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:47,852 INFO L85 PathProgramCache]: Analyzing trace with hash 91424, now seen corresponding path program 2 times [2025-04-26 16:56:47,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:47,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939738965] [2025-04-26 16:56:47,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:47,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:47,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:47,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:47,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:47,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:47,855 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:47,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:47,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:47,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:47,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:47,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:47,875 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:47,876 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:47,876 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:47,876 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:47,876 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:47,876 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,876 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:47,876 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:47,876 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:56:47,876 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:47,876 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:47,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:47,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:47,900 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:47,900 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:47,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:47,902 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:56:47,903 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:56:47,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:47,904 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:47,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:56:47,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:47,922 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:56:47,922 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:56:47,923 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:47,923 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:47,986 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:47,990 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:56:47,990 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:47,990 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:47,990 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:47,990 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:47,990 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:47,990 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:47,991 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:47,991 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:47,991 INFO L132 ssoRankerPreferences]: Filename of dumped script: lock2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:56:47,991 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:47,991 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:47,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:47,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:48,018 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:48,018 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:48,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:48,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:48,020 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:48,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:56:48,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:48,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:48,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:56:48,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:48,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:48,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:48,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:56:48,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:56:48,034 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:48,037 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:56:48,037 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:56:48,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:48,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:48,038 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:48,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:56:48,042 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:48,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:56:48,048 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:56:48,048 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:48,048 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:56:48,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:56:48,054 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:48,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:48,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:48,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:48,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:48,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:48,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:48,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:48,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:48,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:48,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:48,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:48,092 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:48,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:48,117 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:56:48,117 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 203 transitions. cyclomatic complexity: 101 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:48,132 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 203 transitions. cyclomatic complexity: 101. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 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 127 states and 217 transitions. Complement of second has 6 states. [2025-04-26 16:56:48,132 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:56:48,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2025-04-26 16:56:48,132 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:56:48,133 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:48,133 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 16:56:48,133 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:48,133 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 8 letters. Loop has 6 letters. [2025-04-26 16:56:48,133 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:48,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 217 transitions. [2025-04-26 16:56:48,134 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 17 [2025-04-26 16:56:48,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 108 states and 188 transitions. [2025-04-26 16:56:48,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-04-26 16:56:48,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-04-26 16:56:48,135 INFO L74 IsDeterministic]: Start isDeterministic. Operand 108 states and 188 transitions. [2025-04-26 16:56:48,135 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:48,135 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 188 transitions. [2025-04-26 16:56:48,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 188 transitions. [2025-04-26 16:56:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-04-26 16:56:48,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.7407407407407407) internal successors, (in total 188), 107 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 188 transitions. [2025-04-26 16:56:48,139 INFO L240 hiAutomatonCegarLoop]: Abstraction has 108 states and 188 transitions. [2025-04-26 16:56:48,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:48,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:56:48,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:56:48,140 INFO L87 Difference]: Start difference. First operand 108 states and 188 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:48,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:48,149 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2025-04-26 16:56:48,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 28 transitions. [2025-04-26 16:56:48,150 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:48,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2025-04-26 16:56:48,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:48,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:48,150 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:48,150 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:48,150 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:48,150 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:48,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:56:48,151 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:48,151 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:48,151 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:48,151 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:48,151 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:48,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:56:48,162 INFO L201 PluginConnector]: Adding new model lock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:48 BoogieIcfgContainer [2025-04-26 16:56:48,162 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:48,162 INFO L158 Benchmark]: Toolchain (without parser) took 2573.22ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.4MB in the beginning and 34.7MB in the end (delta: 51.7MB). Peak memory consumption was 51.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:48,162 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 87.1MB in the end (delta: 199.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:48,163 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.10ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 84.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:48,163 INFO L158 Benchmark]: Boogie Preprocessor took 22.41ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:48,163 INFO L158 Benchmark]: RCFGBuilder took 188.10ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 74.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:48,163 INFO L158 Benchmark]: BuchiAutomizer took 2327.82ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.1MB in the beginning and 34.7MB in the end (delta: 39.3MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. [2025-04-26 16:56:48,164 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.15ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 87.1MB in the end (delta: 199.2kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.10ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 84.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.41ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 188.10ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 74.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2327.82ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.1MB in the beginning and 34.7MB in the end (delta: 39.3MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 94 StatesRemovedByMinimization, 3 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, 118 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 113 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 114 IncrementalHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 68 mSDtfsCounter, 114 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax100 hnf100 lsp77 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 42ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 255, Number of transitions in reduction automaton: 122, Number of states in reduction automaton: 77, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:56:48,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...