/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/cnolock2.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:11,355 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:11,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:11,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:11,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:11,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:11,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:11,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:11,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:11,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:11,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:11,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:11,431 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:11,431 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:11,432 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:11,432 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:11,432 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:11,432 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:11,432 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:11,432 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:11,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:11,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:11,433 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:11,433 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:11,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:11,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:11,433 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:11,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:11,433 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:11,433 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:11,433 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:11,433 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:11,433 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:11,433 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:11,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:11,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:11,434 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:11,434 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:11,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:11,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:11,434 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:11,434 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:11,434 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:11,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:11,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:11,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:11,643 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:11,644 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:11,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/cnolock2.c.bpl [2025-04-26 18:42:11,646 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/cnolock2.c.bpl' [2025-04-26 18:42:11,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:11,662 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:11,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:11,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:11,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:11,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:11" (1/1) ... [2025-04-26 18:42:11,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:11" (1/1) ... [2025-04-26 18:42:11,696 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:11,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:11,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:11,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:11,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:11,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:11" (1/1) ... [2025-04-26 18:42:11,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:11" (1/1) ... [2025-04-26 18:42:11,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:11" (1/1) ... [2025-04-26 18:42:11,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:11" (1/1) ... [2025-04-26 18:42:11,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:11" (1/1) ... [2025-04-26 18:42:11,706 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:11" (1/1) ... [2025-04-26 18:42:11,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:11" (1/1) ... [2025-04-26 18:42:11,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:11" (1/1) ... [2025-04-26 18:42:11,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:11" (1/1) ... [2025-04-26 18:42:11,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:11,720 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:11,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:11,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:11,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:11" (1/1) ... [2025-04-26 18:42:11,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:11,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:11,745 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 18:42:11,749 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 18:42:11,769 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:11,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:11,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:11,769 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:11,770 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:11,770 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:11,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:11,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:11,770 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 18:42:11,807 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:11,808 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:11,876 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:11,877 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:11,886 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:11,886 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:11,888 INFO L201 PluginConnector]: Adding new model cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:11 BoogieIcfgContainer [2025-04-26 18:42:11,888 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:11,890 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:11,890 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:11,894 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:11,895 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:11,895 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:11" (1/2) ... [2025-04-26 18:42:11,896 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6e375ca1 and model type cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:11, skipping insertion in model container [2025-04-26 18:42:11,896 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:11,896 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:11" (2/2) ... [2025-04-26 18:42:11,897 INFO L376 chiAutomizerObserver]: Analyzing ICFG cnolock2.c.bpl [2025-04-26 18:42:11,943 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:42:11,988 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:11,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:11,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:11,990 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 18:42:11,991 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 18:42:12,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 20 transitions, 54 flow [2025-04-26 18:42:12,052 INFO L116 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-04-26 18:42:12,055 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:42:12,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 3/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 23 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 14. Up to 3 conditions per place. [2025-04-26 18:42:12,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 20 transitions, 54 flow [2025-04-26 18:42:12,060 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 20 places, 16 transitions, 44 flow [2025-04-26 18:42:12,060 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 20 places, 16 transitions, 44 flow [2025-04-26 18:42:12,060 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 20 places, 16 transitions, 44 flow [2025-04-26 18:42:12,069 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 37 states, 36 states have (on average 2.111111111111111) internal successors, (in total 76), 36 states have internal predecessors, (76), 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 18:42:12,069 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 37 states, 36 states have (on average 2.111111111111111) internal successors, (in total 76), 36 states have internal predecessors, (76), 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 18:42:12,071 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:12,124 WARN L140 AmpleReduction]: Number of pruned transitions: 16 [2025-04-26 18:42:12,125 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:12,125 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 5 [2025-04-26 18:42:12,125 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:17 [2025-04-26 18:42:12,125 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:14 [2025-04-26 18:42:12,125 WARN L145 AmpleReduction]: Times succ was already a loop node:8 [2025-04-26 18:42:12,125 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:8 [2025-04-26 18:42:12,125 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:12,125 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (in total 60), 36 states have internal predecessors, (60), 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 18:42:12,130 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:12,130 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:12,130 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:12,131 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:12,131 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:12,131 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:12,131 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:12,131 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:12,132 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (in total 60), 36 states have internal predecessors, (60), 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 18:42:12,140 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 26 [2025-04-26 18:42:12,140 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:12,140 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:12,143 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:12,143 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:12,143 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:12,143 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (in total 60), 36 states have internal predecessors, (60), 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 18:42:12,145 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 26 [2025-04-26 18:42:12,145 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:12,145 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:12,145 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:12,145 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:12,150 INFO L752 eck$LassoCheckResult]: Stem: "[55] $Ultimate##0-->L25-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:12,150 INFO L754 eck$LassoCheckResult]: Loop: "[43] L25-2-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[45] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[47] L25-->L25-2: Formula: (<= v_x2_3 v_x1_6) InVars {x1=v_x1_6, x2=v_x2_3} OutVars{x1=v_x1_6, x2=v_x2_3} AuxVars[] AssignedVars[]" [2025-04-26 18:42:12,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:12,153 INFO L85 PathProgramCache]: Analyzing trace with hash 86, now seen corresponding path program 1 times [2025-04-26 18:42:12,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:12,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810355023] [2025-04-26 18:42:12,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:12,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:12,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:12,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:12,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,206 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:12,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:12,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:12,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:12,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:12,249 INFO L85 PathProgramCache]: Analyzing trace with hash 72556, now seen corresponding path program 1 times [2025-04-26 18:42:12,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:12,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208168395] [2025-04-26 18:42:12,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:12,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:12,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:12,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:12,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,262 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:12,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:12,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:12,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:12,271 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:12,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2604791, now seen corresponding path program 1 times [2025-04-26 18:42:12,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:12,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115114727] [2025-04-26 18:42:12,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:12,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:12,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:12,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:12,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,281 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:12,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:12,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:12,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:12,349 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:12,350 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:12,350 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:12,350 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:12,351 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:12,351 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:12,351 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:12,351 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:12,351 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:12,351 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:12,351 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:12,360 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:12,438 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:12,439 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:12,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:12,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:12,442 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 18:42:12,444 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 18:42:12,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:12,446 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:12,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:12,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:12,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:12,471 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 18:42:12,472 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 18:42:12,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:12,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:12,579 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:12,584 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 18:42:12,584 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:12,584 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:12,584 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:12,584 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:12,584 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:12,584 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:12,584 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:12,584 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:12,584 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:12,584 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:12,585 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:12,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:12,622 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:12,625 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:12,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:12,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:12,629 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 18:42:12,630 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 18:42:12,632 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 18:42:12,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:12,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:12,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:12,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:12,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:12,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:12,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:12,662 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:12,681 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:12,681 INFO L437 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:12,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:12,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:12,688 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 18:42:12,689 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 18:42:12,690 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:12,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:42:12,693 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:12,694 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:12,694 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:42:12,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:42:12,703 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:12,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:12,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:12,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:12,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:12,737 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:12,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:12,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:12,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:12,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:12,747 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:12,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:12,799 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 18:42:12,816 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 18:42:12,818 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (in total 60), 36 states have internal predecessors, (60), 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.0) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:12,896 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 37 states, 36 states have (on average 1.6666666666666667) internal successors, (in total 60), 36 states have internal predecessors, (60), 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.0) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 88 states and 162 transitions. Complement of second has 6 states. [2025-04-26 18:42:12,897 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 18:42:12,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.0) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2025-04-26 18:42:12,906 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 1 letters. Loop has 3 letters. [2025-04-26 18:42:12,906 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:12,906 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 18:42:12,906 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:12,907 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 1 letters. Loop has 6 letters. [2025-04-26 18:42:12,907 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:12,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 162 transitions. [2025-04-26 18:42:12,912 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 18:42:12,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 40 states and 78 transitions. [2025-04-26 18:42:12,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-04-26 18:42:12,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-04-26 18:42:12,918 INFO L74 IsDeterministic]: Start isDeterministic. Operand 40 states and 78 transitions. [2025-04-26 18:42:12,918 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:12,919 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 78 transitions. [2025-04-26 18:42:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 78 transitions. [2025-04-26 18:42:12,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2025-04-26 18:42:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.0) internal successors, (in total 64), 31 states have internal predecessors, (64), 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 18:42:12,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 64 transitions. [2025-04-26 18:42:12,940 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 64 transitions. [2025-04-26 18:42:12,940 INFO L438 stractBuchiCegarLoop]: Abstraction has 32 states and 64 transitions. [2025-04-26 18:42:12,940 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:12,940 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 64 transitions. [2025-04-26 18:42:12,941 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 18:42:12,941 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:12,941 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:12,941 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:42:12,941 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:12,941 INFO L752 eck$LassoCheckResult]: Stem: "[55] $Ultimate##0-->L25-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[42] L25-2-->thread1FINAL: Formula: (<= v_z_2 v_x1_7) InVars {x1=v_x1_7, z=v_z_2} OutVars{x1=v_x1_7, z=v_z_2} AuxVars[] AssignedVars[]" "[44] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[58] L13-->L35: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:42:12,943 INFO L754 eck$LassoCheckResult]: Loop: "[50] L35-->L37: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[52] L37-->L35: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:12,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:12,943 INFO L85 PathProgramCache]: Analyzing trace with hash 2603810, now seen corresponding path program 1 times [2025-04-26 18:42:12,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:12,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274211911] [2025-04-26 18:42:12,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:12,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:12,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:12,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:12,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,949 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:12,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:12,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:12,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:12,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:12,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 1 times [2025-04-26 18:42:12,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:12,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90625154] [2025-04-26 18:42:12,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:12,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:12,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:12,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:12,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,960 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:12,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:12,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:12,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:12,965 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:12,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1792704284, now seen corresponding path program 1 times [2025-04-26 18:42:12,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:12,965 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749895275] [2025-04-26 18:42:12,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:12,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:12,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:12,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:12,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,971 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:12,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:12,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:12,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:12,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:12,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:12,996 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:12,996 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:12,996 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:12,996 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:12,996 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:12,996 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:12,996 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:12,996 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:12,996 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:12,996 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:12,996 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:12,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,017 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:13,017 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:13,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,020 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 18:42:13,022 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 18:42:13,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:13,024 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:13,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:42:13,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,044 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 18:42:13,045 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 18:42:13,047 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:13,047 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:13,115 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:13,120 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 18:42:13,120 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:13,120 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:13,120 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:13,120 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:13,120 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:13,120 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,120 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:13,120 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:13,120 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:13,120 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:13,120 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:13,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,142 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:13,142 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:13,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,145 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 18:42:13,146 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 18:42:13,147 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 18:42:13,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:13,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:13,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:13,159 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:13,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:13,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:13,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:13,162 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:13,167 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:13,168 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:13,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,170 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 18:42:13,171 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 18:42:13,174 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:13,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:42:13,178 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:13,178 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:13,178 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 18:42:13,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:42:13,186 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:13,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:13,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:13,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:13,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:13,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:13,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:13,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:13,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:13,219 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:13,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:13,235 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 18:42:13,235 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 18:42:13,235 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 64 transitions. cyclomatic complexity: 39 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 18:42:13,280 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 64 transitions. cyclomatic complexity: 39. 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 91 states and 178 transitions. Complement of second has 7 states. [2025-04-26 18:42:13,281 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 18:42:13,281 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 18:42:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2025-04-26 18:42:13,281 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:13,282 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:13,282 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:42:13,282 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:13,282 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:42:13,282 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:13,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 178 transitions. [2025-04-26 18:42:13,284 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 18:42:13,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 66 states and 134 transitions. [2025-04-26 18:42:13,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-04-26 18:42:13,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-04-26 18:42:13,285 INFO L74 IsDeterministic]: Start isDeterministic. Operand 66 states and 134 transitions. [2025-04-26 18:42:13,285 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:13,285 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 134 transitions. [2025-04-26 18:42:13,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 134 transitions. [2025-04-26 18:42:13,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2025-04-26 18:42:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (in total 129), 61 states have internal predecessors, (129), 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 18:42:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 129 transitions. [2025-04-26 18:42:13,288 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 129 transitions. [2025-04-26 18:42:13,288 INFO L438 stractBuchiCegarLoop]: Abstraction has 62 states and 129 transitions. [2025-04-26 18:42:13,288 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:13,288 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 129 transitions. [2025-04-26 18:42:13,289 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2025-04-26 18:42:13,289 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:13,289 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:13,289 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:13,289 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:13,290 INFO L752 eck$LassoCheckResult]: Stem: "[55] $Ultimate##0-->L25-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[43] L25-2-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[45] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[58] L13-->L35: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[46] L25-->L27: Formula: (< v_x1_4 v_x2_1) InVars {x1=v_x1_4, x2=v_x2_1} OutVars{x1=v_x1_4, x2=v_x2_1} AuxVars[] AssignedVars[]" "[48] L27-->L25-2: Formula: (= v_x2_2 v_x1_5) InVars {x1=v_x1_5} OutVars{x1=v_x1_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[42] L25-2-->thread1FINAL: Formula: (<= v_z_2 v_x1_7) InVars {x1=v_x1_7, z=v_z_2} OutVars{x1=v_x1_7, z=v_z_2} AuxVars[] AssignedVars[]" [2025-04-26 18:42:13,290 INFO L754 eck$LassoCheckResult]: Loop: "[50] L35-->L37: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[52] L37-->L35: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:13,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,290 INFO L85 PathProgramCache]: Analyzing trace with hash 290290790, now seen corresponding path program 1 times [2025-04-26 18:42:13,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:13,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678199040] [2025-04-26 18:42:13,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:13,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:13,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:13,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:13,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,294 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:13,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:13,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:13,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:13,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 2 times [2025-04-26 18:42:13,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:13,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565690421] [2025-04-26 18:42:13,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:13,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:13,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:13,306 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:13,306 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:13,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:13,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:13,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:13,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:13,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash -203423448, now seen corresponding path program 1 times [2025-04-26 18:42:13,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:13,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48906528] [2025-04-26 18:42:13,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:13,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:13,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:13,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:13,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:13,369 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 18:42:13,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:13,369 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48906528] [2025-04-26 18:42:13,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48906528] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:13,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:13,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:42:13,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231091109] [2025-04-26 18:42:13,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:13,387 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:13,388 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:13,388 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:13,388 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:13,388 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:13,388 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,388 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:13,388 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:13,388 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:13,388 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:13,388 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:13,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,406 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:13,407 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:13,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,409 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 18:42:13,410 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 18:42:13,412 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:13,412 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:13,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:42:13,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,430 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 18:42:13,431 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 18:42:13,432 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:13,432 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:13,497 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:13,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:42:13,502 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:13,502 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:13,502 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:13,502 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:13,502 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:13,502 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,502 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:13,502 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:13,502 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:13,502 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:13,502 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:13,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,518 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:13,519 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:13,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,520 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 18:42:13,521 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 18:42:13,522 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 18:42:13,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:13,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:13,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:13,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:13,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:13,533 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:13,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:13,535 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:13,537 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:13,537 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:13,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,539 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 18:42:13,541 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 18:42:13,542 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:13,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:42:13,545 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:13,545 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:13,545 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 18:42:13,551 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 18:42:13,552 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:13,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:13,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:13,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:13,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:13,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:13,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:13,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:13,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:13,583 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:13,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:13,594 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 18:42:13,594 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 18:42:13,595 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 129 transitions. cyclomatic complexity: 80 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:13,618 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 129 transitions. cyclomatic complexity: 80. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 80 states and 154 transitions. Complement of second has 6 states. [2025-04-26 18:42:13,618 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 18:42:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2025-04-26 18:42:13,619 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:42:13,619 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:13,619 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:42:13,619 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:13,619 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:42:13,619 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:13,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 154 transitions. [2025-04-26 18:42:13,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 18:42:13,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 40 states and 77 transitions. [2025-04-26 18:42:13,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-04-26 18:42:13,621 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-04-26 18:42:13,621 INFO L74 IsDeterministic]: Start isDeterministic. Operand 40 states and 77 transitions. [2025-04-26 18:42:13,621 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:13,621 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 77 transitions. [2025-04-26 18:42:13,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 77 transitions. [2025-04-26 18:42:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-04-26 18:42:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.894736842105263) internal successors, (in total 72), 37 states have internal predecessors, (72), 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 18:42:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 72 transitions. [2025-04-26 18:42:13,623 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 72 transitions. [2025-04-26 18:42:13,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:13,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:42:13,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:42:13,625 INFO L87 Difference]: Start difference. First operand 38 states and 72 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:13,655 INFO L93 Difference]: Finished difference Result 44 states and 78 transitions. [2025-04-26 18:42:13,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 78 transitions. [2025-04-26 18:42:13,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 18:42:13,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 78 transitions. [2025-04-26 18:42:13,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-04-26 18:42:13,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-04-26 18:42:13,656 INFO L74 IsDeterministic]: Start isDeterministic. Operand 44 states and 78 transitions. [2025-04-26 18:42:13,656 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:13,656 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 78 transitions. [2025-04-26 18:42:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 78 transitions. [2025-04-26 18:42:13,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2025-04-26 18:42:13,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.894736842105263) internal successors, (in total 72), 37 states have internal predecessors, (72), 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 18:42:13,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 72 transitions. [2025-04-26 18:42:13,658 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 72 transitions. [2025-04-26 18:42:13,659 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:13,659 INFO L438 stractBuchiCegarLoop]: Abstraction has 38 states and 72 transitions. [2025-04-26 18:42:13,659 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:13,659 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 72 transitions. [2025-04-26 18:42:13,660 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 18:42:13,660 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:13,660 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:13,660 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-04-26 18:42:13,660 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:13,660 INFO L752 eck$LassoCheckResult]: Stem: "[55] $Ultimate##0-->L25-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[43] L25-2-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[45] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[58] L13-->L35: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[46] L25-->L27: Formula: (< v_x1_4 v_x2_1) InVars {x1=v_x1_4, x2=v_x2_1} OutVars{x1=v_x1_4, x2=v_x2_1} AuxVars[] AssignedVars[]" "[48] L27-->L25-2: Formula: (= v_x2_2 v_x1_5) InVars {x1=v_x1_5} OutVars{x1=v_x1_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[43] L25-2-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[45] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[50] L35-->L37: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" [2025-04-26 18:42:13,660 INFO L754 eck$LassoCheckResult]: Loop: "[52] L37-->L35: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[50] L35-->L37: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" [2025-04-26 18:42:13,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,661 INFO L85 PathProgramCache]: Analyzing trace with hash -203422644, now seen corresponding path program 1 times [2025-04-26 18:42:13,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:13,661 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417301111] [2025-04-26 18:42:13,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:13,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:13,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:13,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:13,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,666 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:13,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:13,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:13,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:13,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 3 times [2025-04-26 18:42:13,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:13,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864474758] [2025-04-26 18:42:13,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:42:13,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:13,671 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:13,672 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:13,672 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:42:13,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,672 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:13,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:13,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:13,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:13,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2079336394, now seen corresponding path program 1 times [2025-04-26 18:42:13,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:13,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880860317] [2025-04-26 18:42:13,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:13,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:13,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:13,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:13,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,679 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:13,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:13,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:13,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,683 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:13,694 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:13,694 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:13,694 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:13,694 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:13,694 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:13,694 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,694 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:13,694 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:13,694 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:13,694 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:13,694 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:13,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,712 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:13,712 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:13,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,714 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 18:42:13,715 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 18:42:13,716 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:13,716 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:13,732 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 18:42:13,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,734 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 18:42:13,734 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 18:42:13,736 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:13,736 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:13,823 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:13,827 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 18:42:13,828 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:13,828 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:13,828 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:13,828 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:13,828 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:13,828 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,828 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:13,828 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:13,828 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:13,828 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:13,828 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:13,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,846 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:13,847 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:13,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,853 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 18:42:13,856 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 18:42:13,856 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 18:42:13,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:13,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:13,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:13,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:13,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:13,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:13,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:13,871 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:13,874 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:13,874 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:13,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,876 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 18:42:13,877 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 18:42:13,878 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:13,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:13,882 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:13,882 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:13,882 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 18:42:13,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:42:13,888 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:13,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:13,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:13,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:13,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:13,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:13,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:13,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:13,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:13,935 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:13,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:13,946 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 18:42:13,947 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 18:42:13,947 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 72 transitions. cyclomatic complexity: 42 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:13,984 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 72 transitions. cyclomatic complexity: 42. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 111 states and 208 transitions. Complement of second has 7 states. [2025-04-26 18:42:13,987 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 18:42:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:13,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-04-26 18:42:13,988 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:42:13,988 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:13,988 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:42:13,988 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:13,988 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:42:13,988 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:13,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 208 transitions. [2025-04-26 18:42:13,989 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 18:42:13,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 86 states and 162 transitions. [2025-04-26 18:42:13,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-04-26 18:42:13,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-04-26 18:42:13,990 INFO L74 IsDeterministic]: Start isDeterministic. Operand 86 states and 162 transitions. [2025-04-26 18:42:13,990 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:13,990 INFO L218 hiAutomatonCegarLoop]: Abstraction has 86 states and 162 transitions. [2025-04-26 18:42:13,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 162 transitions. [2025-04-26 18:42:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2025-04-26 18:42:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.9444444444444444) internal successors, (in total 140), 71 states have internal predecessors, (140), 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 18:42:13,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 140 transitions. [2025-04-26 18:42:13,996 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 140 transitions. [2025-04-26 18:42:13,996 INFO L438 stractBuchiCegarLoop]: Abstraction has 72 states and 140 transitions. [2025-04-26 18:42:13,996 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:13,996 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 140 transitions. [2025-04-26 18:42:13,997 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 18:42:13,997 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:13,997 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:13,997 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:13,998 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:13,998 INFO L752 eck$LassoCheckResult]: Stem: "[55] $Ultimate##0-->L25-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[43] L25-2-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[45] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[58] L13-->L35: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[50] L35-->L37: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[46] L25-->L27: Formula: (< v_x1_4 v_x2_1) InVars {x1=v_x1_4, x2=v_x2_1} OutVars{x1=v_x1_4, x2=v_x2_1} AuxVars[] AssignedVars[]" "[48] L27-->L25-2: Formula: (= v_x2_2 v_x1_5) InVars {x1=v_x1_5} OutVars{x1=v_x1_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[43] L25-2-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[45] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[52] L37-->L35: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:13,998 INFO L754 eck$LassoCheckResult]: Loop: "[50] L35-->L37: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[52] L37-->L35: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:14,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1898318176, now seen corresponding path program 2 times [2025-04-26 18:42:14,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:14,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646705108] [2025-04-26 18:42:14,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:14,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:14,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-04-26 18:42:14,008 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:14,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:42:14,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,008 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:14,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:14,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:14,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:14,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2563, now seen corresponding path program 4 times [2025-04-26 18:42:14,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:14,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992213501] [2025-04-26 18:42:14,013 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:42:14,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:14,014 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-04-26 18:42:14,015 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:14,015 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:42:14,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,015 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:14,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:14,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:14,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:14,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1077335266, now seen corresponding path program 3 times [2025-04-26 18:42:14,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:14,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105905940] [2025-04-26 18:42:14,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:42:14,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:14,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 3 equivalence classes. [2025-04-26 18:42:14,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:42:14,022 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 18:42:14,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,022 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:14,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:42:14,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:42:14,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:14,050 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:14,050 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:14,050 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:14,050 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:14,050 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:14,050 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,050 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:14,050 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:14,050 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:14,050 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:14,050 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:14,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,066 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:14,066 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:14,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,068 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 18:42:14,070 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 18:42:14,070 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:14,071 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:14,087 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 18:42:14,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,090 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 18:42:14,091 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 18:42:14,093 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:14,093 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:14,159 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:14,163 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 18:42:14,163 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:14,163 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:14,163 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:14,163 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:14,164 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:14,164 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,164 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:14,164 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:14,164 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:14,164 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:14,164 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:14,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,196 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:14,196 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:14,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,198 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 18:42:14,198 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 18:42:14,200 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 18:42:14,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:14,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:14,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:14,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:14,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:14,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:14,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:14,212 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:14,216 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:14,216 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:14,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,218 INFO L229 MonitoredProcess]: Starting monitored process 22 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 18:42:14,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:42:14,220 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:14,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:14,223 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:14,223 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:14,223 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 18:42:14,228 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 18:42:14,229 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:14,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:14,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:14,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:14,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:14,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,261 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,272 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 18:42:14,272 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 18:42:14,273 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 140 transitions. cyclomatic complexity: 83 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 18:42:14,319 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 140 transitions. cyclomatic complexity: 83. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 185 states and 343 transitions. Complement of second has 7 states. [2025-04-26 18:42:14,321 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 18:42:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 18:42:14,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2025-04-26 18:42:14,321 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:42:14,321 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,321 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:42:14,322 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,322 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 18:42:14,322 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 343 transitions. [2025-04-26 18:42:14,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 18:42:14,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 138 states and 261 transitions. [2025-04-26 18:42:14,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-04-26 18:42:14,324 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-04-26 18:42:14,324 INFO L74 IsDeterministic]: Start isDeterministic. Operand 138 states and 261 transitions. [2025-04-26 18:42:14,325 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:14,325 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 261 transitions. [2025-04-26 18:42:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 261 transitions. [2025-04-26 18:42:14,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 86. [2025-04-26 18:42:14,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.9534883720930232) internal successors, (in total 168), 85 states have internal predecessors, (168), 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 18:42:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 168 transitions. [2025-04-26 18:42:14,328 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 168 transitions. [2025-04-26 18:42:14,328 INFO L438 stractBuchiCegarLoop]: Abstraction has 86 states and 168 transitions. [2025-04-26 18:42:14,328 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:42:14,328 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 168 transitions. [2025-04-26 18:42:14,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-04-26 18:42:14,329 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:14,329 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:14,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-04-26 18:42:14,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:14,330 INFO L752 eck$LassoCheckResult]: Stem: "[55] $Ultimate##0-->L25-2: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[43] L25-2-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[45] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[58] L13-->L35: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[50] L35-->L37: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" "[52] L37-->L35: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[46] L25-->L27: Formula: (< v_x1_4 v_x2_1) InVars {x1=v_x1_4, x2=v_x2_1} OutVars{x1=v_x1_4, x2=v_x2_1} AuxVars[] AssignedVars[]" "[48] L27-->L25-2: Formula: (= v_x2_2 v_x1_5) InVars {x1=v_x1_5} OutVars{x1=v_x1_5, x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[43] L25-2-->L24: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[45] L24-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[50] L35-->L37: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" [2025-04-26 18:42:14,330 INFO L754 eck$LassoCheckResult]: Loop: "[52] L37-->L35: Formula: (= v_x2_5 (+ v_x2_6 1)) InVars {x2=v_x2_6} OutVars{x2=v_x2_5} AuxVars[] AssignedVars[x2]" "[50] L35-->L37: Formula: (< v_x2_4 v_z_3) InVars {x2=v_x2_4, z=v_z_3} OutVars{x2=v_x2_4, z=v_z_3} AuxVars[] AssignedVars[]" [2025-04-26 18:42:14,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1451753418, now seen corresponding path program 4 times [2025-04-26 18:42:14,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:14,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652867561] [2025-04-26 18:42:14,330 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 18:42:14,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:14,332 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 11 statements into 2 equivalence classes. [2025-04-26 18:42:14,334 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:14,334 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 18:42:14,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,334 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:14,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:14,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:14,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:14,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2623, now seen corresponding path program 5 times [2025-04-26 18:42:14,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:14,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099079564] [2025-04-26 18:42:14,338 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 18:42:14,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:14,340 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:14,340 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:14,340 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:14,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,340 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:14,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:14,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:14,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:14,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,342 INFO L85 PathProgramCache]: Analyzing trace with hash -729334840, now seen corresponding path program 5 times [2025-04-26 18:42:14,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:14,342 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711106772] [2025-04-26 18:42:14,342 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 18:42:14,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:14,344 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 13 statements into 4 equivalence classes. [2025-04-26 18:42:14,347 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:42:14,347 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-26 18:42:14,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,347 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:14,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:42:14,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:42:14,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:14,367 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:14,367 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:14,367 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:14,367 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:14,367 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:14,367 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,367 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:14,367 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:14,367 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:42:14,367 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:14,367 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:14,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,382 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:14,382 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:14,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,385 INFO L229 MonitoredProcess]: Starting monitored process 23 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 18:42:14,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:42:14,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:14,387 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:14,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:14,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,406 INFO L229 MonitoredProcess]: Starting monitored process 24 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 18:42:14,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:42:14,409 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:14,409 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:14,497 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:14,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:14,502 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:14,502 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:14,502 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:14,502 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:14,502 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:14,502 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,502 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:14,502 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:14,502 INFO L132 ssoRankerPreferences]: Filename of dumped script: cnolock2.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:42:14,502 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:14,502 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:14,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,530 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:14,530 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:14,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,532 INFO L229 MonitoredProcess]: Starting monitored process 25 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 18:42:14,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:42:14,535 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 18:42:14,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:14,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:14,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:14,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:14,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:14,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:14,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:14,548 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:14,550 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:14,551 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:14,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,552 INFO L229 MonitoredProcess]: Starting monitored process 26 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 18:42:14,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:42:14,555 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:14,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:14,558 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:14,558 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:14,558 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 18:42:14,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 18:42:14,564 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:14,575 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:14,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:14,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:14,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:14,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,599 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,609 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 18:42:14,610 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 18:42:14,610 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 168 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 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 18:42:14,640 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 168 transitions. cyclomatic complexity: 100. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 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 132 states and 247 transitions. Complement of second has 7 states. [2025-04-26 18:42:14,640 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 18:42:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 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 18:42:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-04-26 18:42:14,641 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:42:14,641 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,641 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:42:14,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:14,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:14,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:14,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:14,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,678 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,686 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 18:42:14,686 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:14,686 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 168 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 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 18:42:14,717 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 168 transitions. cyclomatic complexity: 100. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 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 132 states and 247 transitions. Complement of second has 7 states. [2025-04-26 18:42:14,718 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 18:42:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 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 18:42:14,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-04-26 18:42:14,719 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:42:14,719 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,719 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 18:42:14,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:14,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:14,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:14,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:14,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,751 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,759 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 18:42:14,759 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:14,759 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 168 transitions. cyclomatic complexity: 100 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 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 18:42:14,787 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 168 transitions. cyclomatic complexity: 100. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 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 188 states and 354 transitions. Complement of second has 6 states. [2025-04-26 18:42:14,788 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 18:42:14,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 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 18:42:14,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2025-04-26 18:42:14,789 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:42:14,789 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,789 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:42:14,789 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,789 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:42:14,789 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 354 transitions. [2025-04-26 18:42:14,791 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:14,791 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 0 states and 0 transitions. [2025-04-26 18:42:14,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:14,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:14,791 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:14,791 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:14,791 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:14,792 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:14,792 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:14,792 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:42:14,792 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:14,793 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:14,793 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:14,803 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 18:42:14,804 INFO L201 PluginConnector]: Adding new model cnolock2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:14 BoogieIcfgContainer [2025-04-26 18:42:14,804 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:14,805 INFO L158 Benchmark]: Toolchain (without parser) took 3142.29ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 85.6MB in the beginning and 62.8MB in the end (delta: 22.8MB). Peak memory consumption was 4.6MB. Max. memory is 8.0GB. [2025-04-26 18:42:14,805 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.77ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:14,805 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.44ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 83.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:14,805 INFO L158 Benchmark]: Boogie Preprocessor took 22.03ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 82.6MB in the end (delta: 967.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:14,805 INFO L158 Benchmark]: RCFGBuilder took 168.22ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 74.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:42:14,805 INFO L158 Benchmark]: BuchiAutomizer took 2914.07ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 74.0MB in the beginning and 62.8MB in the end (delta: 11.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:14,808 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.77ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.44ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 83.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.03ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 82.6MB in the end (delta: 967.3kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 168.22ms. Allocated memory is still 159.4MB. Free memory was 82.6MB in the beginning and 74.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2914.07ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 74.0MB in the beginning and 62.8MB in the end (delta: 11.3MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 1.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 86 StatesRemovedByMinimization, 6 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 [5, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 221 IncrementalHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 85 mSDtfsCounter, 221 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq148 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 68ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 141, Number of transitions in reduction automaton: 60, Number of states in reduction automaton: 37, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (1 trivial, 5 deterministic, 1 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 z + -1 * x2 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 z + -1 * x2 and consists of 4 locations. One nondeterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:14,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...