/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/4_plus_thr/indep_loops_7.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:57:19,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:57:19,422 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:57:19,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:57:19,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:57:19,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:57:19,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:57:19,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:57:19,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:57:19,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:57:19,440 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:57:19,441 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:57:19,441 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:57:19,441 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:57:19,441 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:57:19,441 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:57:19,441 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:57:19,441 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:57:19,441 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:57:19,441 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:57:19,441 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:57:19,441 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:57:19,441 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:57:19,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:57:19,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:57:19,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:57:19,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:57:19,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:57:19,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:57:19,442 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:57:19,442 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:57:19,442 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:57:19,442 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:57:19,442 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:57:19,442 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:57:19,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:57:19,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:57:19,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:57:19,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:57:19,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:57:19,442 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:57:19,442 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:57:19,442 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:57:19,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:57:19,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:57:19,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:57:19,684 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:57:19,684 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:57:19,686 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_7.c.bpl [2025-04-26 16:57:19,686 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_7.c.bpl' [2025-04-26 16:57:19,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:57:19,704 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:57:19,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:57:19,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:57:19,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:57:19,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:19" (1/1) ... [2025-04-26 16:57:19,734 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:19" (1/1) ... [2025-04-26 16:57:19,739 INFO L138 Inliner]: procedures = 8, calls = 7, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:57:19,740 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:57:19,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:57:19,741 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:57:19,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:57:19,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:19" (1/1) ... [2025-04-26 16:57:19,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:19" (1/1) ... [2025-04-26 16:57:19,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:19" (1/1) ... [2025-04-26 16:57:19,748 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:19" (1/1) ... [2025-04-26 16:57:19,754 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:19" (1/1) ... [2025-04-26 16:57:19,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:19" (1/1) ... [2025-04-26 16:57:19,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:19" (1/1) ... [2025-04-26 16:57:19,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:19" (1/1) ... [2025-04-26 16:57:19,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:19" (1/1) ... [2025-04-26 16:57:19,771 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:57:19,772 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:57:19,772 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:57:19,772 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:57:19,776 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:19" (1/1) ... [2025-04-26 16:57:19,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:57:19,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:19,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:19,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:57:19,817 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:57:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:57:19,817 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:57:19,817 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:57:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:57:19,817 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:57:19,817 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:57:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:57:19,817 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:57:19,817 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:57:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:57:19,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:57:19,817 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:57:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:57:19,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:57:19,818 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:57:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:57:19,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:57:19,818 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 16:57:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 16:57:19,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 16:57:19,818 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread7 given in one single declaration [2025-04-26 16:57:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure thread7 [2025-04-26 16:57:19,818 INFO L138 BoogieDeclarations]: Found implementation of procedure thread7 [2025-04-26 16:57:19,819 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:57:19,850 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:57:19,851 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:57:19,932 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:57:19,932 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:57:19,939 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:57:19,939 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:57:19,939 INFO L201 PluginConnector]: Adding new model indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:57:19 BoogieIcfgContainer [2025-04-26 16:57:19,939 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:57:19,940 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:57:19,940 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:57:19,944 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:57:19,944 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:57:19,944 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:19" (1/2) ... [2025-04-26 16:57:19,945 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@614f8942 and model type indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:57:19, skipping insertion in model container [2025-04-26 16:57:19,945 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:57:19,945 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:57:19" (2/2) ... [2025-04-26 16:57:19,946 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_7.c.bpl [2025-04-26 16:57:20,018 INFO L143 ThreadInstanceAdder]: Constructed 7 joinOtherThreadTransitions. [2025-04-26 16:57:20,053 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:57:20,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:57:20,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:20,056 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:20,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:57:20,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 57 transitions, 163 flow [2025-04-26 16:57:20,135 INFO L116 PetriNetUnfolderBase]: 7/43 cut-off events. [2025-04-26 16:57:20,140 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-26 16:57:20,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 43 events. 7/43 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2025-04-26 16:57:20,144 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 57 transitions, 163 flow [2025-04-26 16:57:20,148 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 43 transitions, 128 flow [2025-04-26 16:57:20,149 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 58 places, 43 transitions, 128 flow [2025-04-26 16:57:20,153 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:57:23,480 WARN L140 AmpleReduction]: Number of pruned transitions: 73851 [2025-04-26 16:57:23,480 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:57:23,480 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 13455 [2025-04-26 16:57:23,480 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:36 [2025-04-26 16:57:23,480 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:13815 [2025-04-26 16:57:23,480 WARN L145 AmpleReduction]: Times succ was already a loop node:44146 [2025-04-26 16:57:23,480 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:8981 [2025-04-26 16:57:23,480 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:57:23,588 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 27307 states, 27306 states have (on average 4.162308650113528) internal successors, (in total 113656), 27306 states have internal predecessors, (113656), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:23,595 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:57:23,595 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:57:23,595 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:57:23,595 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:57:23,595 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:57:23,595 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:57:23,595 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:57:23,595 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:57:23,651 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27307 states, 27306 states have (on average 4.162308650113528) internal successors, (in total 113656), 27306 states have internal predecessors, (113656), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:24,277 INFO L131 ngComponentsAnalysis]: Automaton has 3991 accepting balls. 26924 [2025-04-26 16:57:24,278 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:24,278 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:24,284 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:57:24,284 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:24,284 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:57:24,344 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27307 states, 27306 states have (on average 4.162308650113528) internal successors, (in total 113656), 27306 states have internal predecessors, (113656), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:24,904 INFO L131 ngComponentsAnalysis]: Automaton has 3991 accepting balls. 26924 [2025-04-26 16:57:24,904 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:24,904 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:24,906 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:57:24,906 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:24,909 INFO L752 eck$LassoCheckResult]: Stem: "[137] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:57:24,910 INFO L754 eck$LassoCheckResult]: Loop: "[108] L32-->L34: 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[]" "[110] L34-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:57:24,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:24,914 INFO L85 PathProgramCache]: Analyzing trace with hash 168, now seen corresponding path program 1 times [2025-04-26 16:57:24,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:24,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278761820] [2025-04-26 16:57:24,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:24,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:24,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:57:24,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:57:24,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:24,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:24,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:24,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:57:24,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:57:24,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:24,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:24,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:24,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:24,992 INFO L85 PathProgramCache]: Analyzing trace with hash 4419, now seen corresponding path program 1 times [2025-04-26 16:57:24,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:24,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140268903] [2025-04-26 16:57:24,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:24,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:24,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:25,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:25,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:25,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:25,000 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:25,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:25,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:25,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:25,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:25,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:25,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:25,007 INFO L85 PathProgramCache]: Analyzing trace with hash 164906, now seen corresponding path program 1 times [2025-04-26 16:57:25,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:25,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966087922] [2025-04-26 16:57:25,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:25,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:25,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:25,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:25,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:25,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:25,019 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:25,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:57:25,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:57:25,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:25,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:25,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:25,097 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:25,098 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:25,098 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:25,098 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:25,099 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:25,099 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:25,099 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:25,099 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:25,099 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:57:25,099 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:25,099 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:25,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:25,160 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:25,161 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:25,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:25,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:25,165 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:25,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:57:25,170 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:25,170 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:25,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:57:25,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:25,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:25,213 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:25,219 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:25,219 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:25,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:57:25,372 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:25,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:25,381 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:25,381 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:25,381 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:25,381 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:25,381 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:25,381 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:25,381 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:25,381 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:25,381 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:57:25,381 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:25,381 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:25,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:25,425 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:25,428 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:25,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:25,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:25,436 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:25,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:57:25,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:25,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:25,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:25,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:25,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:25,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:25,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:25,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:25,487 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:25,491 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:25,492 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:25,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:25,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:25,499 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:25,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:57:25,505 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:25,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:57:25,509 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:25,509 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:25,510 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:57:25,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:25,518 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:25,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:25,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:57:25,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:57:25,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:25,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:25,571 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:25,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:25,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:25,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:25,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:25,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:25,586 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:25,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:25,628 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:57:25,686 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 27307 states, 27306 states have (on average 4.162308650113528) internal successors, (in total 113656), 27306 states have internal predecessors, (113656), 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 16:57:26,761 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 27307 states, 27306 states have (on average 4.162308650113528) internal successors, (in total 113656), 27306 states have internal predecessors, (113656), 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 65530 states and 271685 transitions. Complement of second has 6 states. [2025-04-26 16:57:26,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:26,766 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 16:57:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2025-04-26 16:57:26,770 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 16:57:26,771 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:26,771 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:57:26,771 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:26,771 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 104 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 16:57:26,771 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:26,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65530 states and 271685 transitions. [2025-04-26 16:57:27,870 INFO L131 ngComponentsAnalysis]: Automaton has 2898 accepting balls. 16002 [2025-04-26 16:57:28,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65530 states to 37713 states and 155981 transitions. [2025-04-26 16:57:28,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16126 [2025-04-26 16:57:28,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24221 [2025-04-26 16:57:28,555 INFO L74 IsDeterministic]: Start isDeterministic. Operand 37713 states and 155981 transitions. [2025-04-26 16:57:28,556 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:28,556 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37713 states and 155981 transitions. [2025-04-26 16:57:28,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37713 states and 155981 transitions. [2025-04-26 16:57:29,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37713 to 32320. [2025-04-26 16:57:29,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32320 states, 32320 states have (on average 4.130012376237624) internal successors, (in total 133482), 32319 states have internal predecessors, (133482), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32320 states to 32320 states and 133482 transitions. [2025-04-26 16:57:29,959 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32320 states and 133482 transitions. [2025-04-26 16:57:29,959 INFO L438 stractBuchiCegarLoop]: Abstraction has 32320 states and 133482 transitions. [2025-04-26 16:57:29,959 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:57:29,960 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32320 states and 133482 transitions. [2025-04-26 16:57:30,138 INFO L131 ngComponentsAnalysis]: Automaton has 2898 accepting balls. 16002 [2025-04-26 16:57:30,138 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:30,138 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:30,139 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:57:30,139 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:30,140 INFO L752 eck$LassoCheckResult]: Stem: "[137] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[107] L32-->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[]" "[109] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[140] L13-->L41: 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 16:57:30,140 INFO L754 eck$LassoCheckResult]: Loop: "[112] L41-->L43: 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[]" "[114] L43-->L41: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:57:30,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:30,140 INFO L85 PathProgramCache]: Analyzing trace with hash 5111234, now seen corresponding path program 1 times [2025-04-26 16:57:30,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:30,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739504234] [2025-04-26 16:57:30,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:30,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:30,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:30,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:30,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:30,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:30,144 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:30,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:30,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:30,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:30,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:30,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:30,147 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:30,147 INFO L85 PathProgramCache]: Analyzing trace with hash 4547, now seen corresponding path program 1 times [2025-04-26 16:57:30,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:30,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117326188] [2025-04-26 16:57:30,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:30,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:30,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:30,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:30,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:30,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:30,150 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:30,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:30,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:30,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:30,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:30,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:30,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:30,154 INFO L85 PathProgramCache]: Analyzing trace with hash 616932164, now seen corresponding path program 1 times [2025-04-26 16:57:30,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:30,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041944383] [2025-04-26 16:57:30,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:30,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:57:30,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:57:30,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:30,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:30,162 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:30,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:57:30,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:57:30,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:30,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:30,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:30,177 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:30,177 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:30,178 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:30,178 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:30,178 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:30,178 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:30,178 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:30,178 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:30,178 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:57:30,178 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:30,178 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:30,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:30,193 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:30,193 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:30,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:30,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:30,195 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:30,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:57:30,198 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:30,198 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:30,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:57:30,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:30,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:30,215 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:30,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:57:30,217 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:30,217 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:30,291 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:30,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:57:30,295 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:30,295 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:30,295 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:30,295 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:30,295 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:30,295 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:30,295 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:30,295 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:30,295 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:57:30,295 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:30,295 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:30,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:30,317 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:30,317 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:30,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:30,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:30,320 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:30,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:57:30,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:30,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:30,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:30,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:30,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:30,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:30,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:30,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:30,335 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:30,339 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:30,339 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:30,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:30,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:30,341 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:30,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:57:30,344 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:30,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:30,347 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:30,347 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:30,347 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 16:57:30,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:30,355 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:30,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:30,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:30,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:30,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:30,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:30,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:30,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:30,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:30,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:30,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:30,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:30,384 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:30,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:30,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:30,398 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:57:30,398 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32320 states and 133482 transitions. cyclomatic complexity: 105089 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:31,510 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32320 states and 133482 transitions. cyclomatic complexity: 105089. 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 85454 states and 355677 transitions. Complement of second has 6 states. [2025-04-26 16:57:31,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:31,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2025-04-26 16:57:31,511 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 106 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:57:31,511 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:31,511 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 106 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:57:31,511 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:31,511 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 106 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:57:31,511 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:31,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85454 states and 355677 transitions. [2025-04-26 16:57:32,683 INFO L131 ngComponentsAnalysis]: Automaton has 1927 accepting balls. 8494 [2025-04-26 16:57:33,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85454 states to 53739 states and 218981 transitions. [2025-04-26 16:57:33,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18448 [2025-04-26 16:57:33,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25266 [2025-04-26 16:57:33,426 INFO L74 IsDeterministic]: Start isDeterministic. Operand 53739 states and 218981 transitions. [2025-04-26 16:57:33,426 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:33,426 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53739 states and 218981 transitions. [2025-04-26 16:57:33,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53739 states and 218981 transitions. [2025-04-26 16:57:34,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53739 to 46921. [2025-04-26 16:57:34,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46921 states, 46921 states have (on average 4.125444896741331) internal successors, (in total 193570), 46920 states have internal predecessors, (193570), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:34,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46921 states to 46921 states and 193570 transitions. [2025-04-26 16:57:34,950 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46921 states and 193570 transitions. [2025-04-26 16:57:34,950 INFO L438 stractBuchiCegarLoop]: Abstraction has 46921 states and 193570 transitions. [2025-04-26 16:57:34,950 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:57:34,950 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46921 states and 193570 transitions. [2025-04-26 16:57:35,441 INFO L131 ngComponentsAnalysis]: Automaton has 1927 accepting balls. 8494 [2025-04-26 16:57:35,441 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:35,441 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:35,442 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:35,442 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:35,443 INFO L752 eck$LassoCheckResult]: Stem: "[137] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[107] L32-->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[]" "[109] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[140] L13-->L41: 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]" "[111] L41-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[113] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[143] L14-->L50: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:57:35,443 INFO L754 eck$LassoCheckResult]: Loop: "[116] L50-->L52: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[118] L52-->L50: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:57:35,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:35,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1945027051, now seen corresponding path program 1 times [2025-04-26 16:57:35,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:35,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104463155] [2025-04-26 16:57:35,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:35,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:35,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:57:35,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:57:35,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:35,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:35,447 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:35,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:57:35,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:57:35,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:35,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:35,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:35,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:35,451 INFO L85 PathProgramCache]: Analyzing trace with hash 4675, now seen corresponding path program 1 times [2025-04-26 16:57:35,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:35,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447222029] [2025-04-26 16:57:35,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:35,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:35,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:35,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:35,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:35,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:35,456 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:35,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:35,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:35,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:35,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:35,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:35,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:35,461 INFO L85 PathProgramCache]: Analyzing trace with hash 860225965, now seen corresponding path program 1 times [2025-04-26 16:57:35,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:35,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021897513] [2025-04-26 16:57:35,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:35,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:35,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:57:35,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:57:35,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:35,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:35,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:35,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:57:35,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:57:35,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:35,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:35,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:35,491 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:35,491 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:35,492 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:35,492 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:35,492 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:35,492 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:35,492 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:35,492 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:35,492 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:35,492 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:35,492 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:35,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:35,508 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:35,509 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:35,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:35,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:35,511 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:35,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:57:35,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:35,513 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:35,528 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 16:57:35,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:35,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:35,530 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:35,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:57:35,533 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:35,533 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:35,595 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:35,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:35,599 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:35,599 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:35,599 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:35,599 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:35,599 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:35,600 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:35,600 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:35,600 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:35,600 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:35,600 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:35,600 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:35,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:35,616 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:35,616 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:35,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:35,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:35,618 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:35,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:57:35,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:35,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:35,630 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:35,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:35,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:35,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:35,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:35,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:35,632 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:35,636 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:57:35,636 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:35,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:35,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:35,638 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:35,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:57:35,640 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:35,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:35,643 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:35,643 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:35,644 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:57:35,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:57:35,649 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:35,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:35,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:57:35,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:57:35,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:35,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:35,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:35,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:35,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:35,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:35,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:35,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:35,679 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:35,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:35,690 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:57:35,690 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46921 states and 193570 transitions. cyclomatic complexity: 150780 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:36,930 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46921 states and 193570 transitions. cyclomatic complexity: 150780. 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 126434 states and 521262 transitions. Complement of second has 6 states. [2025-04-26 16:57:36,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:36,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-04-26 16:57:36,932 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:57:36,933 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:36,933 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:57:36,933 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:36,933 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:57:36,933 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:36,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126434 states and 521262 transitions. [2025-04-26 16:57:38,788 INFO L131 ngComponentsAnalysis]: Automaton has 1200 accepting balls. 4230 [2025-04-26 16:57:39,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126434 states to 77865 states and 314330 transitions. [2025-04-26 16:57:39,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21924 [2025-04-26 16:57:39,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26005 [2025-04-26 16:57:39,744 INFO L74 IsDeterministic]: Start isDeterministic. Operand 77865 states and 314330 transitions. [2025-04-26 16:57:39,744 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:39,744 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77865 states and 314330 transitions. [2025-04-26 16:57:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77865 states and 314330 transitions. [2025-04-26 16:57:41,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77865 to 72731. [2025-04-26 16:57:41,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72731 states, 72731 states have (on average 3.978303611939888) internal successors, (in total 289346), 72730 states have internal predecessors, (289346), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72731 states to 72731 states and 289346 transitions. [2025-04-26 16:57:42,050 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72731 states and 289346 transitions. [2025-04-26 16:57:42,051 INFO L438 stractBuchiCegarLoop]: Abstraction has 72731 states and 289346 transitions. [2025-04-26 16:57:42,051 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:57:42,051 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72731 states and 289346 transitions. [2025-04-26 16:57:42,467 INFO L131 ngComponentsAnalysis]: Automaton has 1200 accepting balls. 4230 [2025-04-26 16:57:42,467 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:42,467 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:42,468 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:42,468 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:42,468 INFO L752 eck$LassoCheckResult]: Stem: "[137] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[108] L32-->L34: 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[]" "[140] L13-->L41: 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]" "[110] L34-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[143] L14-->L50: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[107] L32-->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[]" "[146] L15-->L59: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[111] L41-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[115] L50-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" [2025-04-26 16:57:42,468 INFO L754 eck$LassoCheckResult]: Loop: "[120] L59-->L61: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[122] L61-->L59: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 16:57:42,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:42,469 INFO L85 PathProgramCache]: Analyzing trace with hash -778618540, now seen corresponding path program 1 times [2025-04-26 16:57:42,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:42,469 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474828672] [2025-04-26 16:57:42,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:42,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:42,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:57:42,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:57:42,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:42,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:42,476 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:42,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:57:42,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:57:42,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:42,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:42,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:42,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:42,486 INFO L85 PathProgramCache]: Analyzing trace with hash 4803, now seen corresponding path program 1 times [2025-04-26 16:57:42,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:42,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5854056] [2025-04-26 16:57:42,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:42,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:42,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:42,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:42,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:42,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:42,489 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:42,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:42,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:42,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:42,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:42,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:42,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:42,494 INFO L85 PathProgramCache]: Analyzing trace with hash -928103594, now seen corresponding path program 1 times [2025-04-26 16:57:42,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:42,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710963657] [2025-04-26 16:57:42,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:42,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:42,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:42,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:42,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:42,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:42,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:42,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:42,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:42,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:42,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:42,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:42,516 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:42,517 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:42,517 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:42,517 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:42,517 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:42,517 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:42,517 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:42,517 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:42,517 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:57:42,517 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:42,517 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:42,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:42,530 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:42,530 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:42,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:42,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:42,532 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:42,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:57:42,534 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:42,534 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:42,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:57:42,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:42,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:42,551 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:42,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:57:42,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:42,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:42,613 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:42,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:57:42,617 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:42,617 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:42,617 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:42,617 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:42,617 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:42,617 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:42,617 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:42,617 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:42,617 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:57:42,617 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:42,617 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:42,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:42,636 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:42,636 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:42,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:42,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:42,638 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:42,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:57:42,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:42,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:42,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:42,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:42,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:42,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:42,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:42,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:42,653 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:42,656 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:42,656 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:42,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:42,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:42,657 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:42,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:57:42,659 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:42,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:57:42,662 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:42,662 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:42,662 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:57:42,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:42,669 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:42,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:42,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:57:42,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:57:42,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:42,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:42,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:42,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:42,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:42,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:42,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:42,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:42,707 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:42,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:42,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:42,719 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:57:42,719 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72731 states and 289346 transitions. cyclomatic complexity: 221492 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 16:57:44,082 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72731 states and 289346 transitions. cyclomatic complexity: 221492. 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 132955 states and 523551 transitions. Complement of second has 6 states. [2025-04-26 16:57:44,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:44,083 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 16:57:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-04-26 16:57:44,083 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:57:44,083 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:44,083 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:57:44,083 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:44,083 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:57:44,083 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:44,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132955 states and 523551 transitions. [2025-04-26 16:57:46,038 INFO L131 ngComponentsAnalysis]: Automaton has 691 accepting balls. 1974 [2025-04-26 16:57:47,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132955 states to 103687 states and 400845 transitions. [2025-04-26 16:57:47,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29244 [2025-04-26 16:57:47,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32820 [2025-04-26 16:57:47,219 INFO L74 IsDeterministic]: Start isDeterministic. Operand 103687 states and 400845 transitions. [2025-04-26 16:57:47,219 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:47,219 INFO L218 hiAutomatonCegarLoop]: Abstraction has 103687 states and 400845 transitions. [2025-04-26 16:57:47,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103687 states and 400845 transitions. [2025-04-26 16:57:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103687 to 96673. [2025-04-26 16:57:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96673 states, 96673 states have (on average 3.909819701467835) internal successors, (in total 377974), 96672 states have internal predecessors, (377974), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96673 states to 96673 states and 377974 transitions. [2025-04-26 16:57:50,032 INFO L240 hiAutomatonCegarLoop]: Abstraction has 96673 states and 377974 transitions. [2025-04-26 16:57:50,032 INFO L438 stractBuchiCegarLoop]: Abstraction has 96673 states and 377974 transitions. [2025-04-26 16:57:50,032 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:57:50,032 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96673 states and 377974 transitions. [2025-04-26 16:57:50,826 INFO L131 ngComponentsAnalysis]: Automaton has 691 accepting balls. 1974 [2025-04-26 16:57:50,826 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:50,826 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:50,827 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:50,827 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:50,828 INFO L752 eck$LassoCheckResult]: Stem: "[137] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[108] L32-->L34: 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[]" "[140] L13-->L41: 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]" "[110] L34-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[143] L14-->L50: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[107] L32-->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[]" "[146] L15-->L59: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[111] L41-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[149] L16-->L68: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[115] L50-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" "[119] L59-->thread4FINAL: Formula: (<= v_z_8 v_x4_4) InVars {x4=v_x4_4, z=v_z_8} OutVars{x4=v_x4_4, z=v_z_8} AuxVars[] AssignedVars[]" [2025-04-26 16:57:50,828 INFO L754 eck$LassoCheckResult]: Loop: "[124] L68-->L70: Formula: (< v_x5_2 v_z_10) InVars {x5=v_x5_2, z=v_z_10} OutVars{x5=v_x5_2, z=v_z_10} AuxVars[] AssignedVars[]" "[126] L70-->L68: Formula: (= v_x5_3 (+ v_x5_4 1)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" [2025-04-26 16:57:50,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:50,828 INFO L85 PathProgramCache]: Analyzing trace with hash -928071078, now seen corresponding path program 1 times [2025-04-26 16:57:50,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:50,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248197154] [2025-04-26 16:57:50,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:50,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:50,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:50,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:50,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:50,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:50,834 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:50,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:50,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:50,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:50,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:50,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:50,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:50,838 INFO L85 PathProgramCache]: Analyzing trace with hash 4931, now seen corresponding path program 1 times [2025-04-26 16:57:50,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:50,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419521548] [2025-04-26 16:57:50,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:50,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:50,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:50,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:50,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:50,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:50,841 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:50,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:50,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:50,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:50,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:50,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:50,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:50,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1476895580, now seen corresponding path program 1 times [2025-04-26 16:57:50,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:50,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988120556] [2025-04-26 16:57:50,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:50,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:50,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:57:50,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:57:50,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:50,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:50,847 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:50,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:57:50,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:57:50,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:50,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:50,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:50,870 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:50,870 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:50,871 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:50,871 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:50,871 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:50,871 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:50,871 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:50,871 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:50,871 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:57:50,871 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:50,871 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:50,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:50,884 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:50,884 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:50,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:50,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:50,887 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:50,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:57:50,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:50,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:50,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:50,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:50,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:50,906 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:50,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:57:50,907 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:50,907 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:50,968 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:50,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:57:50,972 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:50,972 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:50,972 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:50,972 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:50,972 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:50,972 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:50,972 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:50,972 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:50,972 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:57:50,972 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:50,972 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:50,973 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:50,989 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:50,989 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:50,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:50,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:50,991 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:50,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:57:50,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:51,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:51,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:51,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:51,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:51,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:51,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:51,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:51,005 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:51,007 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:57:51,007 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:57:51,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:51,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:51,009 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 16:57:51,009 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 16:57:51,010 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:51,015 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 16:57:51,015 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:51,015 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:51,015 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 16:57:51,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:57:51,020 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:51,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:51,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:51,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:51,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:51,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:51,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:51,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:51,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:51,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:51,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:51,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:51,060 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:51,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:51,070 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:57:51,070 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96673 states and 377974 transitions. cyclomatic complexity: 287368 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:53,132 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96673 states and 377974 transitions. cyclomatic complexity: 287368. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 181122 states and 687159 transitions. Complement of second has 6 states. [2025-04-26 16:57:53,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:53,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:53,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-04-26 16:57:53,133 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:57:53,134 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:53,134 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:57:53,134 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:53,134 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:57:53,134 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:53,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 181122 states and 687159 transitions. [2025-04-26 16:57:55,595 INFO L131 ngComponentsAnalysis]: Automaton has 348 accepting balls. 822 [2025-04-26 16:57:57,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 181122 states to 129800 states and 486937 transitions. [2025-04-26 16:57:57,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34065 [2025-04-26 16:57:57,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35903 [2025-04-26 16:57:57,146 INFO L74 IsDeterministic]: Start isDeterministic. Operand 129800 states and 486937 transitions. [2025-04-26 16:57:57,146 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:57,146 INFO L218 hiAutomatonCegarLoop]: Abstraction has 129800 states and 486937 transitions. [2025-04-26 16:57:57,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129800 states and 486937 transitions. [2025-04-26 16:57:59,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129800 to 123621. [2025-04-26 16:57:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123621 states, 123621 states have (on average 3.7760251090025156) internal successors, (in total 466796), 123620 states have internal predecessors, (466796), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123621 states to 123621 states and 466796 transitions. [2025-04-26 16:58:00,925 INFO L240 hiAutomatonCegarLoop]: Abstraction has 123621 states and 466796 transitions. [2025-04-26 16:58:00,925 INFO L438 stractBuchiCegarLoop]: Abstraction has 123621 states and 466796 transitions. [2025-04-26 16:58:00,925 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:58:00,925 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123621 states and 466796 transitions. [2025-04-26 16:58:01,780 INFO L131 ngComponentsAnalysis]: Automaton has 348 accepting balls. 822 [2025-04-26 16:58:01,780 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:01,780 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:01,782 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:01,782 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:01,782 INFO L752 eck$LassoCheckResult]: Stem: "[137] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[108] L32-->L34: 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[]" "[140] L13-->L41: 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]" "[110] L34-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[143] L14-->L50: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[107] L32-->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[]" "[146] L15-->L59: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[111] L41-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[149] L16-->L68: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[115] L50-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" "[152] L17-->L77: Formula: (and (= v_thread6Thread1of1ForFork5_thidvar3_2 6) (= v_thread6Thread1of1ForFork5_thidvar5_2 6) (= v_thread6Thread1of1ForFork5_thidvar4_2 6) (= v_thread6Thread1of1ForFork5_thidvar2_2 6) (= v_thread6Thread1of1ForFork5_thidvar0_2 6) (= v_thread6Thread1of1ForFork5_thidvar1_2 6)) InVars {} OutVars{thread6Thread1of1ForFork5_thidvar0=v_thread6Thread1of1ForFork5_thidvar0_2, thread6Thread1of1ForFork5_thidvar1=v_thread6Thread1of1ForFork5_thidvar1_2, thread6Thread1of1ForFork5_thidvar2=v_thread6Thread1of1ForFork5_thidvar2_2, thread6Thread1of1ForFork5_thidvar3=v_thread6Thread1of1ForFork5_thidvar3_2, thread6Thread1of1ForFork5_thidvar4=v_thread6Thread1of1ForFork5_thidvar4_2, thread6Thread1of1ForFork5_thidvar5=v_thread6Thread1of1ForFork5_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_thidvar0, thread6Thread1of1ForFork5_thidvar1, thread6Thread1of1ForFork5_thidvar2, thread6Thread1of1ForFork5_thidvar3, thread6Thread1of1ForFork5_thidvar4, thread6Thread1of1ForFork5_thidvar5]" "[119] L59-->thread4FINAL: Formula: (<= v_z_8 v_x4_4) InVars {x4=v_x4_4, z=v_z_8} OutVars{x4=v_x4_4, z=v_z_8} AuxVars[] AssignedVars[]" "[123] L68-->thread5FINAL: Formula: (<= v_z_9 v_x5_1) InVars {x5=v_x5_1, z=v_z_9} OutVars{x5=v_x5_1, z=v_z_9} AuxVars[] AssignedVars[]" [2025-04-26 16:58:01,782 INFO L754 eck$LassoCheckResult]: Loop: "[128] L77-->L79: Formula: (< v_x6_1 v_z_11) InVars {x6=v_x6_1, z=v_z_11} OutVars{x6=v_x6_1, z=v_z_11} AuxVars[] AssignedVars[]" "[130] L79-->L77: Formula: (= v_x6_2 (+ v_x6_3 1)) InVars {x6=v_x6_3} OutVars{x6=v_x6_2} AuxVars[] AssignedVars[x6]" [2025-04-26 16:58:01,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:01,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1476927135, now seen corresponding path program 1 times [2025-04-26 16:58:01,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:01,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839114189] [2025-04-26 16:58:01,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:01,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:01,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:58:01,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:58:01,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:01,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:01,789 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:01,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:58:01,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:58:01,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:01,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:01,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:01,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:01,797 INFO L85 PathProgramCache]: Analyzing trace with hash 5059, now seen corresponding path program 1 times [2025-04-26 16:58:01,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:01,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380828877] [2025-04-26 16:58:01,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:01,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:01,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:01,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:01,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:01,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:01,800 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:01,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:01,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:01,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:01,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:01,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:01,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:01,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1987773153, now seen corresponding path program 1 times [2025-04-26 16:58:01,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:01,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651172053] [2025-04-26 16:58:01,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:01,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:01,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:58:01,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:58:01,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:01,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:01,816 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:01,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:58:01,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:58:01,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:01,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:01,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:01,843 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:01,843 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:01,843 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:01,843 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:01,843 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:01,843 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:01,843 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:01,843 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:01,843 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:58:01,843 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:01,843 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:01,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:01,858 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:01,858 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:01,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:01,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:01,860 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 16:58:01,861 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 16:58:01,862 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:01,862 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:01,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:58:01,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:01,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:01,878 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 16:58:01,878 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 16:58:01,880 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:01,880 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:01,939 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:01,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:58:01,943 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:01,943 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:01,943 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:01,943 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:01,943 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:01,943 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:01,943 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:01,943 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:01,943 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:58:01,943 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:01,943 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:01,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:01,958 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:01,958 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:01,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:01,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:01,960 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 16:58:01,961 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 16:58:01,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:01,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:01,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:01,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:01,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:01,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:01,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:01,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:01,973 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:01,976 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:01,976 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:01,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:01,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:01,978 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 16:58:01,978 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 16:58:01,979 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:01,982 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 16:58:01,982 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:01,982 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:01,982 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x6) = 1*z - 1*x6 Supporting invariants [] [2025-04-26 16:58:01,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:01,987 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:01,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:02,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:58:02,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:58:02,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:02,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:02,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:02,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:02,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:02,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:02,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:02,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:02,026 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:02,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:02,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:02,043 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:02,043 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 123621 states and 466796 transitions. cyclomatic complexity: 350902 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:04,204 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 123621 states and 466796 transitions. cyclomatic complexity: 350902. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 231944 states and 855609 transitions. Complement of second has 6 states. [2025-04-26 16:58:04,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:04,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2025-04-26 16:58:04,205 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:58:04,205 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:04,205 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 16:58:04,205 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:04,205 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 130 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 16:58:04,205 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:04,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231944 states and 855609 transitions. [2025-04-26 16:58:07,379 INFO L131 ngComponentsAnalysis]: Automaton has 127 accepting balls. 254 [2025-04-26 16:58:08,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231944 states to 138845 states and 505393 transitions. [2025-04-26 16:58:08,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33879 [2025-04-26 16:58:08,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34817 [2025-04-26 16:58:08,988 INFO L74 IsDeterministic]: Start isDeterministic. Operand 138845 states and 505393 transitions. [2025-04-26 16:58:08,988 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:08,988 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138845 states and 505393 transitions. [2025-04-26 16:58:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138845 states and 505393 transitions. [2025-04-26 16:58:11,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138845 to 132923. [2025-04-26 16:58:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132923 states, 132923 states have (on average 3.6507526914078077) internal successors, (in total 485269), 132922 states have internal predecessors, (485269), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132923 states to 132923 states and 485269 transitions. [2025-04-26 16:58:12,686 INFO L240 hiAutomatonCegarLoop]: Abstraction has 132923 states and 485269 transitions. [2025-04-26 16:58:12,686 INFO L438 stractBuchiCegarLoop]: Abstraction has 132923 states and 485269 transitions. [2025-04-26 16:58:12,686 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:58:12,686 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132923 states and 485269 transitions. [2025-04-26 16:58:13,783 INFO L131 ngComponentsAnalysis]: Automaton has 127 accepting balls. 254 [2025-04-26 16:58:13,783 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:13,783 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:13,784 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:13,784 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:13,785 INFO L752 eck$LassoCheckResult]: Stem: "[137] $Ultimate##0-->L32: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[108] L32-->L34: 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[]" "[140] L13-->L41: 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]" "[110] L34-->L32: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[143] L14-->L50: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[107] L32-->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[]" "[146] L15-->L59: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[111] L41-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[149] L16-->L68: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[115] L50-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" "[152] L17-->L77: Formula: (and (= v_thread6Thread1of1ForFork5_thidvar3_2 6) (= v_thread6Thread1of1ForFork5_thidvar5_2 6) (= v_thread6Thread1of1ForFork5_thidvar4_2 6) (= v_thread6Thread1of1ForFork5_thidvar2_2 6) (= v_thread6Thread1of1ForFork5_thidvar0_2 6) (= v_thread6Thread1of1ForFork5_thidvar1_2 6)) InVars {} OutVars{thread6Thread1of1ForFork5_thidvar0=v_thread6Thread1of1ForFork5_thidvar0_2, thread6Thread1of1ForFork5_thidvar1=v_thread6Thread1of1ForFork5_thidvar1_2, thread6Thread1of1ForFork5_thidvar2=v_thread6Thread1of1ForFork5_thidvar2_2, thread6Thread1of1ForFork5_thidvar3=v_thread6Thread1of1ForFork5_thidvar3_2, thread6Thread1of1ForFork5_thidvar4=v_thread6Thread1of1ForFork5_thidvar4_2, thread6Thread1of1ForFork5_thidvar5=v_thread6Thread1of1ForFork5_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_thidvar0, thread6Thread1of1ForFork5_thidvar1, thread6Thread1of1ForFork5_thidvar2, thread6Thread1of1ForFork5_thidvar3, thread6Thread1of1ForFork5_thidvar4, thread6Thread1of1ForFork5_thidvar5]" "[119] L59-->thread4FINAL: Formula: (<= v_z_8 v_x4_4) InVars {x4=v_x4_4, z=v_z_8} OutVars{x4=v_x4_4, z=v_z_8} AuxVars[] AssignedVars[]" "[155] L18-->L86: Formula: (and (= v_thread7Thread1of1ForFork6_thidvar1_2 7) (= v_thread7Thread1of1ForFork6_thidvar3_2 7) (= v_thread7Thread1of1ForFork6_thidvar0_2 7) (= v_thread7Thread1of1ForFork6_thidvar2_2 7) (= v_thread7Thread1of1ForFork6_thidvar6_2 7) (= v_thread7Thread1of1ForFork6_thidvar5_2 7) (= v_thread7Thread1of1ForFork6_thidvar4_2 7)) InVars {} OutVars{thread7Thread1of1ForFork6_thidvar6=v_thread7Thread1of1ForFork6_thidvar6_2, thread7Thread1of1ForFork6_thidvar1=v_thread7Thread1of1ForFork6_thidvar1_2, thread7Thread1of1ForFork6_thidvar0=v_thread7Thread1of1ForFork6_thidvar0_2, thread7Thread1of1ForFork6_thidvar5=v_thread7Thread1of1ForFork6_thidvar5_2, thread7Thread1of1ForFork6_thidvar4=v_thread7Thread1of1ForFork6_thidvar4_2, thread7Thread1of1ForFork6_thidvar3=v_thread7Thread1of1ForFork6_thidvar3_2, thread7Thread1of1ForFork6_thidvar2=v_thread7Thread1of1ForFork6_thidvar2_2} AuxVars[] AssignedVars[thread7Thread1of1ForFork6_thidvar6, thread7Thread1of1ForFork6_thidvar1, thread7Thread1of1ForFork6_thidvar0, thread7Thread1of1ForFork6_thidvar5, thread7Thread1of1ForFork6_thidvar4, thread7Thread1of1ForFork6_thidvar3, thread7Thread1of1ForFork6_thidvar2]" "[123] L68-->thread5FINAL: Formula: (<= v_z_9 v_x5_1) InVars {x5=v_x5_1, z=v_z_9} OutVars{x5=v_x5_1, z=v_z_9} AuxVars[] AssignedVars[]" "[127] L77-->thread6FINAL: Formula: (<= v_z_12 v_x6_4) InVars {x6=v_x6_4, z=v_z_12} OutVars{x6=v_x6_4, z=v_z_12} AuxVars[] AssignedVars[]" [2025-04-26 16:58:13,785 INFO L754 eck$LassoCheckResult]: Loop: "[132] L86-->L88: Formula: (< v_x7_1 v_z_13) InVars {x7=v_x7_1, z=v_z_13} OutVars{x7=v_x7_1, z=v_z_13} AuxVars[] AssignedVars[]" "[134] L88-->L86: Formula: (= v_x7_2 (+ v_x7_3 1)) InVars {x7=v_x7_3} OutVars{x7=v_x7_2} AuxVars[] AssignedVars[x7]" [2025-04-26 16:58:13,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:13,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1987803747, now seen corresponding path program 1 times [2025-04-26 16:58:13,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:13,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37901393] [2025-04-26 16:58:13,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:13,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:13,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:58:13,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:58:13,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:13,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:13,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:13,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:58:13,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:58:13,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:13,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:13,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:13,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:13,806 INFO L85 PathProgramCache]: Analyzing trace with hash 5187, now seen corresponding path program 1 times [2025-04-26 16:58:13,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:13,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760973432] [2025-04-26 16:58:13,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:13,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:13,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:13,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:13,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:13,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:13,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:13,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:13,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:13,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:13,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:13,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:13,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:13,811 INFO L85 PathProgramCache]: Analyzing trace with hash -981041627, now seen corresponding path program 1 times [2025-04-26 16:58:13,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:13,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606012148] [2025-04-26 16:58:13,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:13,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:13,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:58:13,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:58:13,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:13,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:13,816 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:13,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:58:13,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:58:13,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:13,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:13,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:13,837 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:13,837 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:13,837 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:13,837 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:13,837 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:13,837 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:13,837 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:13,837 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:13,837 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration7_Loop [2025-04-26 16:58:13,837 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:13,837 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:13,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:13,849 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:13,849 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:13,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:13,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:13,851 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:13,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:58:13,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:13,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:13,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:58:13,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:13,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:13,871 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:13,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:58:13,874 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:13,874 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:13,936 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:13,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:58:13,940 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:13,940 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:13,940 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:13,940 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:13,940 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:13,940 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:13,940 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:13,940 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:13,940 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_7.c.bpl_petrified1_Iteration7_Loop [2025-04-26 16:58:13,940 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:13,940 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:13,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:13,951 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:13,952 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:13,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:13,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:13,953 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:13,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:58:13,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:13,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:13,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:13,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:13,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:13,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:13,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:13,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:13,970 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:13,974 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:13,974 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:13,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:13,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:13,976 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:13,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:58:13,978 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:13,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:13,981 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:13,981 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:13,981 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x7, z) = -1*x7 + 1*z Supporting invariants [] [2025-04-26 16:58:13,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:58:13,987 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:14,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:14,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:58:14,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:58:14,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:14,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:14,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:14,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:14,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:14,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:14,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:14,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:14,031 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:14,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:14,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:14,041 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:14,041 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 132923 states and 485269 transitions. cyclomatic complexity: 361205 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:16,444 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 132923 states and 485269 transitions. cyclomatic complexity: 361205. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 250312 states and 892904 transitions. Complement of second has 6 states. [2025-04-26 16:58:16,445 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:16,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2025-04-26 16:58:16,445 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 123 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 16:58:16,445 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:16,445 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 123 transitions. Stem has 17 letters. Loop has 2 letters. [2025-04-26 16:58:16,445 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:16,445 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 123 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:58:16,446 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:16,446 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 250312 states and 892904 transitions. [2025-04-26 16:58:19,771 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:19,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 250312 states to 0 states and 0 transitions. [2025-04-26 16:58:19,771 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:58:19,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:58:19,771 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:58:19,771 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:58:19,771 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:19,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:19,771 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:19,771 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:58:19,771 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:58:19,771 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:19,771 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:58:19,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:58:19,783 INFO L201 PluginConnector]: Adding new model indep_loops_7.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:58:19 BoogieIcfgContainer [2025-04-26 16:58:19,783 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:58:19,784 INFO L158 Benchmark]: Toolchain (without parser) took 60079.50ms. Allocated memory was 159.4MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 85.1MB in the beginning and 3.2GB in the end (delta: -3.1GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2025-04-26 16:58:19,784 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 85.8MB in the end (delta: 199.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:19,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.64ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:19,784 INFO L158 Benchmark]: Boogie Preprocessor took 30.26ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 82.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:58:19,785 INFO L158 Benchmark]: RCFGBuilder took 167.57ms. Allocated memory is still 159.4MB. Free memory was 81.8MB in the beginning and 72.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:58:19,785 INFO L158 Benchmark]: BuchiAutomizer took 59843.41ms. Allocated memory was 159.4MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 72.2MB in the beginning and 3.2GB in the end (delta: -3.2GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2025-04-26 16:58:19,786 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.19ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 85.8MB in the end (delta: 199.2kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.64ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 30.26ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 82.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 167.57ms. Allocated memory is still 159.4MB. Free memory was 81.8MB in the beginning and 72.2MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 59843.41ms. Allocated memory was 159.4MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 72.2MB in the beginning and 3.2GB in the end (delta: -3.2GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 59.7s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 1.8s. Construction of modules took 0.5s. Büchi inclusion checks took 11.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 15.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 36460 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 21.2s Buchi closure took 0.5s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 618 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 611 mSDsluCounter, 519 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 244 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 741 IncrementalHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 275 mSDtfsCounter, 741 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT7 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: 80ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 3.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 3432, Number of transitions in reduction automaton: 113656, Number of states in reduction automaton: 27307, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (0 trivial, 7 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x6 and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x7 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 16:58:19,799 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...