/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/3_thr/seq_loops_indep_3.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:37,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:37,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:37,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:37,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:37,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:37,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:37,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:37,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:37,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:37,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:37,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:37,819 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:37,819 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:37,819 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:37,819 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:37,819 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:37,819 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:37,819 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:37,819 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:37,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:37,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:37,820 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:37,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:37,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:37,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:37,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:37,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:37,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:37,820 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:37,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:37,820 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:37,820 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:37,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:37,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:37,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:37,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:37,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:37,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:37,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:37,821 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:37,821 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:37,821 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:38,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:38,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:38,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:38,048 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:38,049 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:38,049 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/seq_loops_indep_3.c.bpl [2025-04-26 18:42:38,049 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/seq_loops_indep_3.c.bpl' [2025-04-26 18:42:38,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:38,063 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:38,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:38,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:38,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:38,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,086 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,091 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:38,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:38,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:38,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:38,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:38,098 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,100 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,100 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,102 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,108 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:38,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:38,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:38,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:38,118 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/1) ... [2025-04-26 18:42:38,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:38,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:38,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:42:38,170 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:38,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:38,171 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:38,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:38,171 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:42:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:42:38,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:42:38,171 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:38,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:38,172 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:42:38,209 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:38,211 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:38,294 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:38,294 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:38,301 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:38,301 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:38,301 INFO L201 PluginConnector]: Adding new model seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:38 BoogieIcfgContainer [2025-04-26 18:42:38,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:38,302 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:38,302 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:38,307 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:38,307 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:38,308 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:38" (1/2) ... [2025-04-26 18:42:38,308 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f4b4a1 and model type seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:38, skipping insertion in model container [2025-04-26 18:42:38,308 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:38,309 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:38" (2/2) ... [2025-04-26 18:42:38,309 INFO L376 chiAutomizerObserver]: Analyzing ICFG seq_loops_indep_3.c.bpl [2025-04-26 18:42:38,360 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:42:38,399 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:38,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:38,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,402 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:38,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:42:38,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 34 transitions, 89 flow [2025-04-26 18:42:38,467 INFO L116 PetriNetUnfolderBase]: 6/28 cut-off events. [2025-04-26 18:42:38,468 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:42:38,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 6/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 57 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-26 18:42:38,471 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 34 transitions, 89 flow [2025-04-26 18:42:38,474 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 28 transitions, 74 flow [2025-04-26 18:42:38,474 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 32 places, 28 transitions, 74 flow [2025-04-26 18:42:38,475 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 28 transitions, 74 flow [2025-04-26 18:42:38,515 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 303 states, 302 states have (on average 3.3940397350993377) internal successors, (in total 1025), 302 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:38,516 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 303 states, 302 states have (on average 3.3940397350993377) internal successors, (in total 1025), 302 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:38,518 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:38,594 WARN L140 AmpleReduction]: Number of pruned transitions: 299 [2025-04-26 18:42:38,595 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:38,595 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 134 [2025-04-26 18:42:38,595 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:22 [2025-04-26 18:42:38,595 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:146 [2025-04-26 18:42:38,595 WARN L145 AmpleReduction]: Times succ was already a loop node:268 [2025-04-26 18:42:38,595 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:20 [2025-04-26 18:42:38,595 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:38,596 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 303 states, 302 states have (on average 2.403973509933775) internal successors, (in total 726), 302 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:38,602 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:38,602 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:38,602 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:38,602 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:38,602 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:38,602 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:38,602 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:38,603 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:38,604 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 303 states, 302 states have (on average 2.403973509933775) internal successors, (in total 726), 302 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:38,623 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 280 [2025-04-26 18:42:38,624 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:38,624 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:38,627 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:38,628 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:38,628 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:38,629 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 303 states, 302 states have (on average 2.403973509933775) internal successors, (in total 726), 302 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:38,640 INFO L131 ngComponentsAnalysis]: Automaton has 84 accepting balls. 280 [2025-04-26 18:42:38,641 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:38,641 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:38,641 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:38,641 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:38,647 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:38,647 INFO L754 eck$LassoCheckResult]: Loop: "[78] L23-->L25: 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[]" "[81] L25-->L23: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:38,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:38,652 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 1 times [2025-04-26 18:42:38,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:38,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821928206] [2025-04-26 18:42:38,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:38,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:38,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:38,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:38,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,702 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:38,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:38,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:38,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:38,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:38,717 INFO L85 PathProgramCache]: Analyzing trace with hash 3460, now seen corresponding path program 1 times [2025-04-26 18:42:38,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:38,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224622303] [2025-04-26 18:42:38,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:38,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:38,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:38,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:38,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,727 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:38,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:38,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:38,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:38,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:38,733 INFO L85 PathProgramCache]: Analyzing trace with hash 128390, now seen corresponding path program 1 times [2025-04-26 18:42:38,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:38,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758365205] [2025-04-26 18:42:38,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:38,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:38,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:38,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:38,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,741 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:38,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:38,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:38,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:38,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:38,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:38,800 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:38,802 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:38,802 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:38,802 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:38,803 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:38,803 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,803 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:38,803 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:38,803 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:38,803 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:38,803 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:38,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:38,929 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:38,930 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:38,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,934 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:38,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:42:38,937 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:38,937 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:38,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:38,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:38,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:38,961 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:38,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:42:38,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:38,964 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:39,033 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:39,037 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:42:39,038 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:39,038 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:39,038 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:39,038 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:39,038 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:39,038 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,038 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:39,038 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:39,038 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:39,038 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:39,038 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:39,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,067 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:39,070 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:39,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:42:39,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:39,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:39,089 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:39,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:39,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:39,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:39,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:39,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:39,097 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:39,109 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:39,109 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:39,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,142 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:42:39,144 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:39,148 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:39,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:42:39,149 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:39,150 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:42:39,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:42:39,158 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:39,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:39,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:39,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:39,187 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:39,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:39,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:39,196 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:39,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:39,238 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:39,240 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 303 states, 302 states have (on average 2.403973509933775) internal successors, (in total 726), 302 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:39,357 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 303 states, 302 states have (on average 2.403973509933775) internal successors, (in total 726), 302 states have internal predecessors, (726), 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 690 states and 1679 transitions. Complement of second has 6 states. [2025-04-26 18:42:39,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-04-26 18:42:39,368 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 18:42:39,369 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:39,369 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:42:39,369 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:39,369 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 18:42:39,369 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:39,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 690 states and 1679 transitions. [2025-04-26 18:42:39,385 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 194 [2025-04-26 18:42:39,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 690 states to 373 states and 918 transitions. [2025-04-26 18:42:39,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 202 [2025-04-26 18:42:39,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 266 [2025-04-26 18:42:39,393 INFO L74 IsDeterministic]: Start isDeterministic. Operand 373 states and 918 transitions. [2025-04-26 18:42:39,393 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:39,393 INFO L218 hiAutomatonCegarLoop]: Abstraction has 373 states and 918 transitions. [2025-04-26 18:42:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 918 transitions. [2025-04-26 18:42:39,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 330. [2025-04-26 18:42:39,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 330 states have (on average 2.3848484848484848) internal successors, (in total 787), 329 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 787 transitions. [2025-04-26 18:42:39,422 INFO L240 hiAutomatonCegarLoop]: Abstraction has 330 states and 787 transitions. [2025-04-26 18:42:39,422 INFO L438 stractBuchiCegarLoop]: Abstraction has 330 states and 787 transitions. [2025-04-26 18:42:39,422 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:39,422 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 330 states and 787 transitions. [2025-04-26 18:42:39,424 INFO L131 ngComponentsAnalysis]: Automaton has 63 accepting balls. 194 [2025-04-26 18:42:39,425 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:39,425 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:39,425 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:39,425 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:39,425 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] L23-->L27-1: 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[]" [2025-04-26 18:42:39,425 INFO L754 eck$LassoCheckResult]: Loop: "[80] L27-1-->L29: Formula: (< v_x3_1 v_z_3) InVars {x3=v_x3_1, z=v_z_3} OutVars{x3=v_x3_1, z=v_z_3} AuxVars[] AssignedVars[]" "[83] L29-->L27-1: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 18:42:39,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,426 INFO L85 PathProgramCache]: Analyzing trace with hash 4138, now seen corresponding path program 1 times [2025-04-26 18:42:39,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128528923] [2025-04-26 18:42:39,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:39,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,429 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:39,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,431 INFO L85 PathProgramCache]: Analyzing trace with hash 3524, now seen corresponding path program 1 times [2025-04-26 18:42:39,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183732731] [2025-04-26 18:42:39,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:39,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,435 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:39,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,439 INFO L85 PathProgramCache]: Analyzing trace with hash 3979181, now seen corresponding path program 1 times [2025-04-26 18:42:39,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579163857] [2025-04-26 18:42:39,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:39,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:39,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:39,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,444 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:39,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:39,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:39,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,459 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:39,459 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:39,459 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:39,459 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:39,459 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:39,459 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,459 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:39,459 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:39,459 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:39,459 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:39,459 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:39,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,475 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:39,475 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:39,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,477 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:42:39,480 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:39,480 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:39,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:39,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,499 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:42:39,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:39,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:39,570 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:39,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:42:39,575 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:39,575 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:39,575 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:39,575 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:39,575 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:39,575 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,575 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:39,575 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:39,575 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:39,575 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:39,575 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:39,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,598 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:39,598 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:39,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,600 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:42:39,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:39,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:39,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:39,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:39,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:39,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:39,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:39,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:39,618 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:39,620 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:39,620 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:39,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,622 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:42:39,625 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:39,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:42:39,628 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:39,628 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:39,628 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 18:42:39,634 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 18:42:39,635 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:39,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:39,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:39,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:39,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:39,659 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:39,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:39,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:39,674 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:39,675 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 330 states and 787 transitions. cyclomatic complexity: 541 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:39,749 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 330 states and 787 transitions. cyclomatic complexity: 541. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 652 states and 1688 transitions. Complement of second has 6 states. [2025-04-26 18:42:39,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-04-26 18:42:39,752 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:42:39,752 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:39,752 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:39,752 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:39,752 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:42:39,752 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:39,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 652 states and 1688 transitions. [2025-04-26 18:42:39,757 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 108 [2025-04-26 18:42:39,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 652 states to 425 states and 1082 transitions. [2025-04-26 18:42:39,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2025-04-26 18:42:39,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 231 [2025-04-26 18:42:39,766 INFO L74 IsDeterministic]: Start isDeterministic. Operand 425 states and 1082 transitions. [2025-04-26 18:42:39,766 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:39,766 INFO L218 hiAutomatonCegarLoop]: Abstraction has 425 states and 1082 transitions. [2025-04-26 18:42:39,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states and 1082 transitions. [2025-04-26 18:42:39,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 387. [2025-04-26 18:42:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 387 states have (on average 2.5684754521963824) internal successors, (in total 994), 386 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 994 transitions. [2025-04-26 18:42:39,782 INFO L240 hiAutomatonCegarLoop]: Abstraction has 387 states and 994 transitions. [2025-04-26 18:42:39,783 INFO L438 stractBuchiCegarLoop]: Abstraction has 387 states and 994 transitions. [2025-04-26 18:42:39,783 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:39,783 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 387 states and 994 transitions. [2025-04-26 18:42:39,784 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 108 [2025-04-26 18:42:39,784 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:39,784 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:39,785 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:39,785 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:39,785 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] L23-->L27-1: 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[]" "[79] L27-1-->thread1FINAL: Formula: (<= v_z_4 v_x3_4) InVars {x3=v_x3_4, z=v_z_4} OutVars{x3=v_x3_4, z=v_z_4} AuxVars[] AssignedVars[]" "[82] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[103] L12-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:42:39,785 INFO L754 eck$LassoCheckResult]: Loop: "[85] L36-->L38: Formula: (< v_x2_1 v_z_5) InVars {x2=v_x2_1, z=v_z_5} OutVars{x2=v_x2_1, z=v_z_5} AuxVars[] AssignedVars[]" "[88] L38-->L36: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:39,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,786 INFO L85 PathProgramCache]: Analyzing trace with hash 123353722, now seen corresponding path program 1 times [2025-04-26 18:42:39,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,787 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390437323] [2025-04-26 18:42:39,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:39,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:39,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:39,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,791 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:39,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:39,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:39,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,793 INFO L85 PathProgramCache]: Analyzing trace with hash 3684, now seen corresponding path program 1 times [2025-04-26 18:42:39,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374402099] [2025-04-26 18:42:39,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:39,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:39,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:39,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:39,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1716154723, now seen corresponding path program 1 times [2025-04-26 18:42:39,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:39,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766771094] [2025-04-26 18:42:39,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:39,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:39,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:39,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:39,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,801 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:39,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:39,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:39,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:39,804 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:39,816 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:39,816 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:39,816 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:39,816 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:39,816 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:39,816 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,816 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:39,816 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:39,816 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:39,816 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:39,816 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:39,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,831 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:39,832 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:39,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,834 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:42:39,835 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:39,835 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:39,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:39,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,853 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:42:39,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:39,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:39,919 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:39,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:42:39,924 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:39,924 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:39,924 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:39,924 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:39,924 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:39,925 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,925 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:39,925 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:39,925 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:39,925 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:39,925 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:39,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:39,940 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:39,940 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:39,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,942 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:42:39,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:39,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:39,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:39,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:39,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:39,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:39,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:39,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:39,957 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:39,959 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:39,959 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:39,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:39,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:39,961 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:39,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:42:39,962 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:39,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:42:39,965 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:39,965 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:39,966 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 18:42:39,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:42:39,972 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:39,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:39,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:39,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:39,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:39,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:39,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:39,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,006 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:40,022 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:40,022 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 387 states and 994 transitions. cyclomatic complexity: 683 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,088 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 387 states and 994 transitions. cyclomatic complexity: 683. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1044 states and 2660 transitions. Complement of second has 6 states. [2025-04-26 18:42:40,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2025-04-26 18:42:40,089 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:42:40,089 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,089 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:42:40,089 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,089 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 66 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:42:40,090 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1044 states and 2660 transitions. [2025-04-26 18:42:40,112 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 68 [2025-04-26 18:42:40,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1044 states to 605 states and 1497 transitions. [2025-04-26 18:42:40,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 203 [2025-04-26 18:42:40,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2025-04-26 18:42:40,117 INFO L74 IsDeterministic]: Start isDeterministic. Operand 605 states and 1497 transitions. [2025-04-26 18:42:40,117 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:40,117 INFO L218 hiAutomatonCegarLoop]: Abstraction has 605 states and 1497 transitions. [2025-04-26 18:42:40,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states and 1497 transitions. [2025-04-26 18:42:40,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 553. [2025-04-26 18:42:40,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 553 states have (on average 2.464737793851718) internal successors, (in total 1363), 552 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 1363 transitions. [2025-04-26 18:42:40,136 INFO L240 hiAutomatonCegarLoop]: Abstraction has 553 states and 1363 transitions. [2025-04-26 18:42:40,136 INFO L438 stractBuchiCegarLoop]: Abstraction has 553 states and 1363 transitions. [2025-04-26 18:42:40,136 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:40,136 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 553 states and 1363 transitions. [2025-04-26 18:42:40,138 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 68 [2025-04-26 18:42:40,138 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:40,138 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:40,139 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:42:40,139 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:40,139 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] L23-->L27-1: 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[]" "[79] L27-1-->thread1FINAL: Formula: (<= v_z_4 v_x3_4) InVars {x3=v_x3_4, z=v_z_4} OutVars{x3=v_x3_4, z=v_z_4} AuxVars[] AssignedVars[]" "[82] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[103] L12-->L36: 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]" "[84] L36-->L40-1: Formula: (<= v_z_6 v_x2_4) InVars {x2=v_x2_4, z=v_z_6} OutVars{x2=v_x2_4, z=v_z_6} AuxVars[] AssignedVars[]" [2025-04-26 18:42:40,139 INFO L754 eck$LassoCheckResult]: Loop: "[87] L40-1-->L42: 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[]" "[90] L42-->L40-1: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 18:42:40,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,139 INFO L85 PathProgramCache]: Analyzing trace with hash -471001830, now seen corresponding path program 1 times [2025-04-26 18:42:40,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015735184] [2025-04-26 18:42:40,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:40,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:40,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,143 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:40,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:40,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,146 INFO L85 PathProgramCache]: Analyzing trace with hash 3748, now seen corresponding path program 1 times [2025-04-26 18:42:40,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018786130] [2025-04-26 18:42:40,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,148 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1661189763, now seen corresponding path program 1 times [2025-04-26 18:42:40,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12579169] [2025-04-26 18:42:40,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:40,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:40,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,153 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:40,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:40,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,174 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:40,175 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:40,175 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:40,175 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:40,175 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:40,175 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,175 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:40,175 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:40,175 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:40,175 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:40,175 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:40,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,191 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:40,191 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:40,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,193 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:42:40,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:40,196 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:40,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:42:40,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,215 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:42:40,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:40,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:40,281 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:40,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:42:40,286 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:40,286 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:40,286 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:40,286 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:40,286 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:40,286 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,286 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:40,286 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:40,286 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:40,286 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:40,286 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:40,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,306 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:40,306 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:40,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,308 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:42:40,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:40,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:40,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:40,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:40,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:40,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:40,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:40,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:40,324 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:40,329 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:40,329 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:40,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,331 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:42:40,333 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:40,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:40,337 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:40,337 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:40,337 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 18:42:40,343 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 18:42:40,344 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:40,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:40,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:40,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,369 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:40,381 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:40,381 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 553 states and 1363 transitions. cyclomatic complexity: 901 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,450 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 553 states and 1363 transitions. cyclomatic complexity: 901. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1014 states and 2518 transitions. Complement of second has 6 states. [2025-04-26 18:42:40,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:40,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-04-26 18:42:40,453 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:42:40,453 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,453 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:42:40,453 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,453 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:42:40,453 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1014 states and 2518 transitions. [2025-04-26 18:42:40,459 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 28 [2025-04-26 18:42:40,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1014 states to 587 states and 1450 transitions. [2025-04-26 18:42:40,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 180 [2025-04-26 18:42:40,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 203 [2025-04-26 18:42:40,463 INFO L74 IsDeterministic]: Start isDeterministic. Operand 587 states and 1450 transitions. [2025-04-26 18:42:40,463 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:40,463 INFO L218 hiAutomatonCegarLoop]: Abstraction has 587 states and 1450 transitions. [2025-04-26 18:42:40,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states and 1450 transitions. [2025-04-26 18:42:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 551. [2025-04-26 18:42:40,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 551 states have (on average 2.486388384754991) internal successors, (in total 1370), 550 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 1370 transitions. [2025-04-26 18:42:40,474 INFO L240 hiAutomatonCegarLoop]: Abstraction has 551 states and 1370 transitions. [2025-04-26 18:42:40,474 INFO L438 stractBuchiCegarLoop]: Abstraction has 551 states and 1370 transitions. [2025-04-26 18:42:40,474 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:40,474 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 551 states and 1370 transitions. [2025-04-26 18:42:40,476 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 28 [2025-04-26 18:42:40,476 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:40,476 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:40,477 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:40,477 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:40,477 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] L23-->L27-1: 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[]" "[80] L27-1-->L29: Formula: (< v_x3_1 v_z_3) InVars {x3=v_x3_1, z=v_z_3} OutVars{x3=v_x3_1, z=v_z_3} AuxVars[] AssignedVars[]" "[103] L12-->L36: 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]" "[83] L29-->L27-1: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[106] L13-->L49: 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]" "[79] L27-1-->thread1FINAL: Formula: (<= v_z_4 v_x3_4) InVars {x3=v_x3_4, z=v_z_4} OutVars{x3=v_x3_4, z=v_z_4} AuxVars[] AssignedVars[]" "[84] L36-->L40-1: Formula: (<= v_z_6 v_x2_4) InVars {x2=v_x2_4, z=v_z_6} OutVars{x2=v_x2_4, z=v_z_6} AuxVars[] AssignedVars[]" "[86] L40-1-->thread2FINAL: 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 18:42:40,477 INFO L754 eck$LassoCheckResult]: Loop: "[92] L49-->L51: Formula: (< v_x5_2 v_z_12) InVars {x5=v_x5_2, z=v_z_12} OutVars{x5=v_x5_2, z=v_z_12} AuxVars[] AssignedVars[]" "[95] L51-->L49: Formula: (= v_x5_3 (+ v_x5_4 1)) InVars {x5=v_x5_4} OutVars{x5=v_x5_3} AuxVars[] AssignedVars[x5]" [2025-04-26 18:42:40,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1513617945, now seen corresponding path program 1 times [2025-04-26 18:42:40,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72590500] [2025-04-26 18:42:40,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:40,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:40,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,483 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:40,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:40,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,487 INFO L85 PathProgramCache]: Analyzing trace with hash 3908, now seen corresponding path program 1 times [2025-04-26 18:42:40,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122200252] [2025-04-26 18:42:40,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,489 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,491 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1407065252, now seen corresponding path program 1 times [2025-04-26 18:42:40,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,491 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417631435] [2025-04-26 18:42:40,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:40,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:40,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,495 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:40,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:40,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,508 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:40,509 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:40,509 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:40,509 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:40,509 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:40,509 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,509 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:40,509 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:40,509 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:40,509 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:40,509 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:40,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,529 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:40,529 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:40,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,531 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:42:40,532 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:40,532 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:40,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:42:40,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,550 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:42:40,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:40,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:40,615 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:40,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:42:40,619 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:40,620 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:40,620 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:40,620 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:40,620 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:40,620 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,620 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:40,620 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:40,620 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:42:40,620 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:40,620 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:40,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,638 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:40,638 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:40,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,640 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:42:40,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 18:42:40,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:40,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:40,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:40,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:40,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:40,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:40,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:40,654 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:40,656 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:40,656 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:40,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,658 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:42:40,660 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:40,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:40,663 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:40,663 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:40,664 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 18:42:40,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:42:40,670 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:40,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:40,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:40,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:40,701 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:40,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:40,712 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:40,713 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 551 states and 1370 transitions. cyclomatic complexity: 893 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,754 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 551 states and 1370 transitions. cyclomatic complexity: 893. 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 822 states and 1971 transitions. Complement of second has 6 states. [2025-04-26 18:42:40,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-04-26 18:42:40,756 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:42:40,756 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,756 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:42:40,756 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,756 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:42:40,756 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:40,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 822 states and 1971 transitions. [2025-04-26 18:42:40,761 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:42:40,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 822 states to 734 states and 1732 transitions. [2025-04-26 18:42:40,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 221 [2025-04-26 18:42:40,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2025-04-26 18:42:40,765 INFO L74 IsDeterministic]: Start isDeterministic. Operand 734 states and 1732 transitions. [2025-04-26 18:42:40,765 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:40,765 INFO L218 hiAutomatonCegarLoop]: Abstraction has 734 states and 1732 transitions. [2025-04-26 18:42:40,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states and 1732 transitions. [2025-04-26 18:42:40,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 691. [2025-04-26 18:42:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 691 states have (on average 2.402315484804631) internal successors, (in total 1660), 690 states have internal predecessors, (1660), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1660 transitions. [2025-04-26 18:42:40,789 INFO L240 hiAutomatonCegarLoop]: Abstraction has 691 states and 1660 transitions. [2025-04-26 18:42:40,789 INFO L438 stractBuchiCegarLoop]: Abstraction has 691 states and 1660 transitions. [2025-04-26 18:42:40,789 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:42:40,789 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 691 states and 1660 transitions. [2025-04-26 18:42:40,791 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:42:40,792 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:40,792 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:40,793 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:40,793 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:40,793 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] L23-->L27-1: 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[]" "[80] L27-1-->L29: Formula: (< v_x3_1 v_z_3) InVars {x3=v_x3_1, z=v_z_3} OutVars{x3=v_x3_1, z=v_z_3} AuxVars[] AssignedVars[]" "[103] L12-->L36: 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]" "[83] L29-->L27-1: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" "[106] L13-->L49: 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]" "[79] L27-1-->thread1FINAL: Formula: (<= v_z_4 v_x3_4) InVars {x3=v_x3_4, z=v_z_4} OutVars{x3=v_x3_4, z=v_z_4} AuxVars[] AssignedVars[]" "[84] L36-->L40-1: Formula: (<= v_z_6 v_x2_4) InVars {x2=v_x2_4, z=v_z_6} OutVars{x2=v_x2_4, z=v_z_6} AuxVars[] AssignedVars[]" "[86] L40-1-->thread2FINAL: 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[]" "[91] L49-->L53-1: 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 18:42:40,793 INFO L754 eck$LassoCheckResult]: Loop: "[94] L53-1-->L55: Formula: (< v_x6_1 v_z_10) InVars {x6=v_x6_1, z=v_z_10} OutVars{x6=v_x6_1, z=v_z_10} AuxVars[] AssignedVars[]" "[97] L55-->L53-1: Formula: (= v_x6_2 (+ v_x6_3 1)) InVars {x6=v_x6_3} OutVars{x6=v_x6_2} AuxVars[] AssignedVars[x6]" [2025-04-26 18:42:40,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,793 INFO L85 PathProgramCache]: Analyzing trace with hash -322483870, now seen corresponding path program 1 times [2025-04-26 18:42:40,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,794 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752608192] [2025-04-26 18:42:40,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:40,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:40,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,802 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:40,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:40,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,811 INFO L85 PathProgramCache]: Analyzing trace with hash 3972, now seen corresponding path program 1 times [2025-04-26 18:42:40,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183948031] [2025-04-26 18:42:40,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,814 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,815 INFO L85 PathProgramCache]: Analyzing trace with hash -669350747, now seen corresponding path program 1 times [2025-04-26 18:42:40,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677633245] [2025-04-26 18:42:40,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:42:40,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:42:40,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,819 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:42:40,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:42:40,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,843 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:40,843 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:40,843 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:40,843 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:40,843 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:40,843 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,843 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:40,843 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:40,843 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:42:40,843 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:40,843 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:40,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,858 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:40,858 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:40,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,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 18:42:40,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:42:40,863 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:40,863 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:40,882 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 18:42:40,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,885 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:42:40,888 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:40,888 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:40,953 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:40,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:40,958 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:40,959 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:40,959 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:40,959 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:40,959 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:40,959 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,959 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:40,959 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:40,959 INFO L132 ssoRankerPreferences]: Filename of dumped script: seq_loops_indep_3.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:42:40,959 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:40,959 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:40,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,973 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:40,974 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:40,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,976 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:42:40,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:40,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:40,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:40,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:40,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:40,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:40,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:40,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:40,991 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:40,993 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:40,993 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:40,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,995 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:42:40,998 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:41,000 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:42:41,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,002 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:41,002 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:41,002 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x6) = 1*z - 1*x6 Supporting invariants [] [2025-04-26 18:42:41,008 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 18:42:41,009 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:41,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:41,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:41,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,057 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:41,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 18:42:41,071 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 691 states and 1660 transitions. cyclomatic complexity: 1065 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:41,127 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 691 states and 1660 transitions. cyclomatic complexity: 1065. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 1131 states and 2658 transitions. Complement of second has 6 states. [2025-04-26 18:42:41,128 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:41,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-26 18:42:41,128 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:42:41,128 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,128 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:42:41,129 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,129 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 71 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 18:42:41,129 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1131 states and 2658 transitions. [2025-04-26 18:42:41,135 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:41,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1131 states to 0 states and 0 transitions. [2025-04-26 18:42:41,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:41,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:41,135 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:41,135 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:41,135 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:41,135 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:41,135 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:41,136 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:42:41,136 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:41,136 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:41,136 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:41,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,152 INFO L201 PluginConnector]: Adding new model seq_loops_indep_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:41 BoogieIcfgContainer [2025-04-26 18:42:41,152 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:41,152 INFO L158 Benchmark]: Toolchain (without parser) took 3089.42ms. Allocated memory was 167.8MB in the beginning and 125.8MB in the end (delta: -41.9MB). Free memory was 93.8MB in the beginning and 60.5MB in the end (delta: 33.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:41,153 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 94.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:41,153 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.27ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 92.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:41,153 INFO L158 Benchmark]: Boogie Preprocessor took 23.35ms. Allocated memory is still 167.8MB. Free memory was 91.8MB in the beginning and 90.9MB in the end (delta: 951.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:41,153 INFO L158 Benchmark]: RCFGBuilder took 184.02ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 81.6MB in the end (delta: 9.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:41,153 INFO L158 Benchmark]: BuchiAutomizer took 2849.57ms. Allocated memory was 167.8MB in the beginning and 125.8MB in the end (delta: -41.9MB). Free memory was 81.5MB in the beginning and 60.5MB in the end (delta: 21.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:41,154 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 94.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.27ms. Allocated memory is still 167.8MB. Free memory was 93.8MB in the beginning and 92.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.35ms. Allocated memory is still 167.8MB. Free memory was 91.8MB in the beginning and 90.9MB in the end (delta: 951.3kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 184.02ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 81.6MB in the end (delta: 9.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 2849.57ms. Allocated memory was 167.8MB in the beginning and 125.8MB in the end (delta: -41.9MB). Free memory was 81.5MB in the beginning and 60.5MB in the end (delta: 21.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 212 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 309 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 258 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 353 IncrementalHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 146 mSDtfsCounter, 353 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 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: 77ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 200, Number of transitions in reduction automaton: 726, Number of states in reduction automaton: 303, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (0 trivial, 6 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 -1 * x3 + 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 * 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. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:41,168 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...