/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/indep_loops_2.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:12,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:12,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:12,899 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:12,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:12,900 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:12,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:12,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:12,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:12,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:12,928 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:12,928 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:12,928 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:12,928 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:12,928 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:12,928 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:12,928 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:12,928 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:12,928 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:12,929 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:12,929 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:12,929 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:12,929 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:12,929 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:12,929 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:12,929 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:12,929 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:12,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:12,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:12,929 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:12,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:12,930 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:12,930 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:12,930 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:12,930 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:12,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:12,930 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:12,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:12,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:12,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:12,930 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:12,930 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:12,930 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:13,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:13,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:13,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:13,195 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:13,195 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:13,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/indep_loops_2.c.bpl [2025-04-26 18:42:13,196 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/indep_loops_2.c.bpl' [2025-04-26 18:42:13,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:13,210 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:13,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:13,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:13,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:13,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:13" (1/1) ... [2025-04-26 18:42:13,246 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:13" (1/1) ... [2025-04-26 18:42:13,252 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:13,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:13,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:13,255 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:13,255 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:13,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:13" (1/1) ... [2025-04-26 18:42:13,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:13" (1/1) ... [2025-04-26 18:42:13,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:13" (1/1) ... [2025-04-26 18:42:13,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:13" (1/1) ... [2025-04-26 18:42:13,265 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:13" (1/1) ... [2025-04-26 18:42:13,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:13" (1/1) ... [2025-04-26 18:42:13,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:13" (1/1) ... [2025-04-26 18:42:13,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:13" (1/1) ... [2025-04-26 18:42:13,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:13" (1/1) ... [2025-04-26 18:42:13,283 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:13,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:13,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:13,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:13,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:13" (1/1) ... [2025-04-26 18:42:13,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:13,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,314 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:13,320 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:13,338 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:13,338 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:13,339 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:13,339 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:13,339 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:13,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:13,339 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:13,377 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:13,379 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:13,438 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:13,438 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:13,447 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:13,447 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:13,449 INFO L201 PluginConnector]: Adding new model indep_loops_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:13 BoogieIcfgContainer [2025-04-26 18:42:13,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:13,450 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:13,450 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:13,455 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:13,455 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:13,456 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_2.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:13" (1/2) ... [2025-04-26 18:42:13,457 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17b95789 and model type indep_loops_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:13, skipping insertion in model container [2025-04-26 18:42:13,457 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:13,457 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:13" (2/2) ... [2025-04-26 18:42:13,458 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_2.c.bpl [2025-04-26 18:42:13,500 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:42:13,534 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:13,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:13,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,536 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:13,539 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:13,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 17 transitions, 48 flow [2025-04-26 18:42:13,612 INFO L116 PetriNetUnfolderBase]: 2/13 cut-off events. [2025-04-26 18:42:13,615 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:42:13,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22 conditions, 13 events. 2/13 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-26 18:42:13,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 20 places, 17 transitions, 48 flow [2025-04-26 18:42:13,623 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 18 places, 13 transitions, 38 flow [2025-04-26 18:42:13,624 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 18 places, 13 transitions, 38 flow [2025-04-26 18:42:13,624 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 18 places, 13 transitions, 38 flow [2025-04-26 18:42:13,634 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (in total 51), 26 states have internal predecessors, (51), 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,636 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 27 states, 26 states have (on average 1.9615384615384615) internal successors, (in total 51), 26 states have internal predecessors, (51), 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,639 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:13,676 WARN L140 AmpleReduction]: Number of pruned transitions: 10 [2025-04-26 18:42:13,678 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:13,678 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 6 [2025-04-26 18:42:13,679 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:11 [2025-04-26 18:42:13,679 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:9 [2025-04-26 18:42:13,681 WARN L145 AmpleReduction]: Times succ was already a loop node:10 [2025-04-26 18:42:13,681 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:42:13,681 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:13,682 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 27 states, 26 states have (on average 1.5769230769230769) internal successors, (in total 41), 26 states have internal predecessors, (41), 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,687 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:13,687 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:13,687 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:13,687 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:13,687 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:13,687 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:13,687 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:13,687 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:13,689 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.5769230769230769) internal successors, (in total 41), 26 states have internal predecessors, (41), 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,700 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 18:42:13,700 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:13,700 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:13,703 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:13,703 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:13,704 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:13,704 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.5769230769230769) internal successors, (in total 41), 26 states have internal predecessors, (41), 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,705 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 18:42:13,705 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:13,705 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:13,706 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:13,706 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:13,711 INFO L752 eck$LassoCheckResult]: Stem: "[42] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:13,711 INFO L754 eck$LassoCheckResult]: Loop: "[33] L21-->L23: 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[]" "[35] L23-->L21: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:13,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,717 INFO L85 PathProgramCache]: Analyzing trace with hash 73, now seen corresponding path program 1 times [2025-04-26 18:42:13,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:13,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743641039] [2025-04-26 18:42:13,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:13,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:13,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:13,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:13,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,769 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:13,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:13,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:13,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:13,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2019, now seen corresponding path program 1 times [2025-04-26 18:42:13,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:13,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047596278] [2025-04-26 18:42:13,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:13,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:13,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:13,795 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,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:13,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:13,799 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,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:13,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:13,801 INFO L85 PathProgramCache]: Analyzing trace with hash 71211, now seen corresponding path program 1 times [2025-04-26 18:42:13,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:13,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944342079] [2025-04-26 18:42:13,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:13,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:13,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:13,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:13,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:13,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:13,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:13,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:13,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:13,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:13,862 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:13,862 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:13,863 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:13,863 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:13,863 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:13,863 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,863 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:13,863 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:13,863 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:13,863 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:13,863 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:13,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:13,914 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:13,915 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:13,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,918 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:13,920 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:13,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:13,921 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:13,943 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:13,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:13,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:13,965 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:13,968 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:13,969 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:13,969 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:14,046 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:14,050 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:14,051 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:14,051 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:14,051 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:14,051 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:14,051 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:14,051 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,051 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:14,051 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:14,051 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_2.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:14,051 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:14,051 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:14,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,080 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:14,082 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:14,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,085 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:14,086 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:14,087 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,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:14,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:14,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:14,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:14,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:14,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:14,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:14,104 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:14,109 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:14,109 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:14,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,112 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:14,113 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:14,114 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:14,117 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:14,117 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:14,118 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:14,118 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 18:42:14,124 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:14,126 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:14,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:14,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:14,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,180 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:14,186 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,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,187 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,208 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,238 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,239 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27 states, 26 states have (on average 1.5769230769230769) internal successors, (in total 41), 26 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 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,323 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27 states, 26 states have (on average 1.5769230769230769) internal successors, (in total 41), 26 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 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 60 states and 95 transitions. Complement of second has 6 states. [2025-04-26 18:42:14,325 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,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 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,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2025-04-26 18:42:14,331 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 18:42:14,331 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,331 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:42:14,332 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,332 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 18:42:14,332 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 95 transitions. [2025-04-26 18:42:14,334 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:42:14,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 20 states and 31 transitions. [2025-04-26 18:42:14,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-04-26 18:42:14,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-04-26 18:42:14,338 INFO L74 IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions. [2025-04-26 18:42:14,338 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:14,338 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 31 transitions. [2025-04-26 18:42:14,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions. [2025-04-26 18:42:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-04-26 18:42:14,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (in total 28), 17 states have internal predecessors, (28), 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,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2025-04-26 18:42:14,353 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 28 transitions. [2025-04-26 18:42:14,353 INFO L438 stractBuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2025-04-26 18:42:14,354 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:14,354 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2025-04-26 18:42:14,354 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:42:14,354 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:14,354 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:14,354 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:42:14,354 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:14,355 INFO L752 eck$LassoCheckResult]: Stem: "[42] $Ultimate##0-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[32] L21-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[34] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[45] L12-->L30: 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:14,355 INFO L754 eck$LassoCheckResult]: Loop: "[37] L30-->L32: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[39] L32-->L30: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:14,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2206594, now seen corresponding path program 1 times [2025-04-26 18:42:14,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:14,355 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370283632] [2025-04-26 18:42:14,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:14,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:14,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:14,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:14,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,359 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:14,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:14,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:14,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:14,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2147, now seen corresponding path program 1 times [2025-04-26 18:42:14,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:14,362 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519550022] [2025-04-26 18:42:14,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:14,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:14,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:14,365 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,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,366 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:14,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:14,367 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,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:14,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2120538020, now seen corresponding path program 1 times [2025-04-26 18:42:14,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:14,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069695980] [2025-04-26 18:42:14,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:14,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:14,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:14,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:14,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,377 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:14,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:14,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:14,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:14,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:14,405 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:14,405 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:14,405 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:14,405 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:14,405 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:14,405 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,405 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:14,405 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:14,405 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:14,405 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:14,405 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:14,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,427 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:14,427 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:14,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,429 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:14,431 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:14,432 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:14,432 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:14,451 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:14,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,453 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:14,454 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:14,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:14,455 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:14,519 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:14,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:42:14,524 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:14,524 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:14,524 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:14,524 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:14,524 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:14,524 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,524 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:14,524 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:14,524 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_2.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:14,524 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:14,524 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:14,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:14,544 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:14,544 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:14,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,548 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:14,548 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:14,549 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,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:14,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:14,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:14,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:14,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:14,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:14,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:14,562 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:14,566 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:14,566 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:14,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:14,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:14,568 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:14,568 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:14,569 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:14,572 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:14,572 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:14,572 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:14,572 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 18:42:14,577 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:14,579 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:14,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:14,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:14,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:14,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:14,605 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,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:14,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:14,606 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:14,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:14,618 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,618 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,618 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 15 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:14,645 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 15. 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 35 states and 53 transitions. Complement of second has 6 states. [2025-04-26 18:42:14,645 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,645 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:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2025-04-26 18:42:14,646 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:14,646 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,646 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:42:14,646 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,646 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:42:14,646 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:14,646 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 53 transitions. [2025-04-26 18:42:14,648 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:14,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 0 states and 0 transitions. [2025-04-26 18:42:14,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:14,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:14,649 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:14,649 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:14,649 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:14,649 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:14,649 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:14,649 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:14,649 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:14,649 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:14,649 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:14,659 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,660 INFO L201 PluginConnector]: Adding new model indep_loops_2.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:14 BoogieIcfgContainer [2025-04-26 18:42:14,660 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:14,661 INFO L158 Benchmark]: Toolchain (without parser) took 1451.03ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 84.8MB in the beginning and 88.2MB in the end (delta: -3.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:14,661 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 85.6MB in the end (delta: 199.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:14,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.51ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 82.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:14,661 INFO L158 Benchmark]: Boogie Preprocessor took 27.96ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 82.1MB in the end (delta: 853.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:14,661 INFO L158 Benchmark]: RCFGBuilder took 162.70ms. Allocated memory is still 159.4MB. Free memory was 82.0MB in the beginning and 73.4MB in the end (delta: 8.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:42:14,662 INFO L158 Benchmark]: BuchiAutomizer took 1210.39ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.4MB in the beginning and 88.2MB in the end (delta: -14.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:14,663 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.16ms. Allocated memory is still 159.4MB. Free memory was 85.8MB in the beginning and 85.6MB in the end (delta: 199.2kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.51ms. Allocated memory is still 159.4MB. Free memory was 84.8MB in the beginning and 82.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.96ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 82.1MB in the end (delta: 853.2kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 162.70ms. Allocated memory is still 159.4MB. Free memory was 82.0MB in the beginning and 73.4MB in the end (delta: 8.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 1210.39ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.4MB in the beginning and 88.2MB in the end (delta: -14.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 27 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 13 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 35ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 151, Number of transitions in reduction automaton: 41, Number of states in reduction automaton: 27, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. - 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,673 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...