/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_6.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:58:19,193 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:58:19,234 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:58:19,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:58:19,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:58:19,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:58:19,239 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:58:19,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:58:19,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:58:19,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:58:19,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:58:19,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:58:19,261 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:58:19,261 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:58:19,264 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:58:19,264 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:58:19,264 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:58:19,265 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:58:19,265 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:58:19,265 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:58:19,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:58:19,265 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:58:19,265 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:58:19,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:58:19,265 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:58:19,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:58:19,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:58:19,265 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:58:19,265 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:58:19,265 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:58:19,265 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:58:19,265 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:58:19,265 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:58:19,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:58:19,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:58:19,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:19,266 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:58:19,266 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:58:19,266 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:58:19,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:58:19,266 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:58:19,266 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:58:19,266 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:58:19,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:58:19,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:58:19,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:58:19,503 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:58:19,503 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:58:19,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_6.c.bpl [2025-04-26 16:58:19,505 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/indep_loops_minus1_6.c.bpl' [2025-04-26 16:58:19,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:58:19,523 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:58:19,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:19,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:58:19,524 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:58:19,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:19" (1/1) ... [2025-04-26 16:58:19,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:19" (1/1) ... [2025-04-26 16:58:19,558 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:58:19,559 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:19,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:58:19,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:58:19,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:58:19,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:19" (1/1) ... [2025-04-26 16:58:19,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:19" (1/1) ... [2025-04-26 16:58:19,568 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:19" (1/1) ... [2025-04-26 16:58:19,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:19" (1/1) ... [2025-04-26 16:58:19,571 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:19" (1/1) ... [2025-04-26 16:58:19,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:19" (1/1) ... [2025-04-26 16:58:19,576 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:19" (1/1) ... [2025-04-26 16:58:19,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:19" (1/1) ... [2025-04-26 16:58:19,577 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:19" (1/1) ... [2025-04-26 16:58:19,587 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:58:19,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:58:19,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:58:19,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:58:19,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:19" (1/1) ... [2025-04-26 16:58:19,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:19,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:19,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:19,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:58:19,644 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:58:19,645 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:58:19,645 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:58:19,645 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:58:19,645 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:58:19,645 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:58:19,645 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:58:19,645 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:58:19,645 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:58:19,645 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:58:19,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:58:19,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:58:19,645 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:58:19,645 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:58:19,645 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:58:19,645 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:58:19,645 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:58:19,646 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:58:19,646 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 16:58:19,646 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 16:58:19,646 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 16:58:19,646 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:58:19,682 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:58:19,684 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:58:19,759 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:58:19,759 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:58:19,768 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:58:19,768 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:58:19,769 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:19 BoogieIcfgContainer [2025-04-26 16:58:19,769 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:58:19,769 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:58:19,770 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:58:19,773 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:58:19,774 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:19,774 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:19" (1/2) ... [2025-04-26 16:58:19,774 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@76dca210 and model type indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:58:19, skipping insertion in model container [2025-04-26 16:58:19,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:19,775 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:19" (2/2) ... [2025-04-26 16:58:19,776 INFO L376 chiAutomizerObserver]: Analyzing ICFG indep_loops_minus1_6.c.bpl [2025-04-26 16:58:19,841 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 16:58:19,880 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:58:19,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:58:19,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:19,883 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:19,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:58:19,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 50 transitions, 142 flow [2025-04-26 16:58:19,973 INFO L116 PetriNetUnfolderBase]: 6/38 cut-off events. [2025-04-26 16:58:19,976 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 16:58:19,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63 conditions, 38 events. 6/38 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 83 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2025-04-26 16:58:19,982 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 50 transitions, 142 flow [2025-04-26 16:58:19,986 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 38 transitions, 112 flow [2025-04-26 16:58:19,987 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 51 places, 38 transitions, 112 flow [2025-04-26 16:58:19,992 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:58:21,280 WARN L140 AmpleReduction]: Number of pruned transitions: 19152 [2025-04-26 16:58:21,281 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:58:21,281 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 3991 [2025-04-26 16:58:21,281 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:33 [2025-04-26 16:58:21,281 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:4402 [2025-04-26 16:58:21,281 WARN L145 AmpleReduction]: Times succ was already a loop node:9443 [2025-04-26 16:58:21,281 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:1792 [2025-04-26 16:58:21,281 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:58:21,316 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 8427 states, 8426 states have (on average 3.6121528601946356) internal successors, (in total 30436), 8426 states have internal predecessors, (30436), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:21,323 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:58:21,323 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:58:21,323 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:58:21,323 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:58:21,323 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:58:21,323 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:58:21,324 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:58:21,324 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:58:21,351 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8427 states, 8426 states have (on average 3.6121528601946356) internal successors, (in total 30436), 8426 states have internal predecessors, (30436), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:21,525 INFO L131 ngComponentsAnalysis]: Automaton has 1238 accepting balls. 8080 [2025-04-26 16:58:21,526 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:21,526 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:21,529 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:58:21,529 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:21,529 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:58:21,553 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8427 states, 8426 states have (on average 3.6121528601946356) internal successors, (in total 30436), 8426 states have internal predecessors, (30436), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:21,663 INFO L131 ngComponentsAnalysis]: Automaton has 1238 accepting balls. 8080 [2025-04-26 16:58:21,663 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:21,663 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:21,664 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 16:58:21,664 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:21,669 INFO L752 eck$LassoCheckResult]: Stem: "[121] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:58:21,669 INFO L754 eck$LassoCheckResult]: Loop: "[95] L29-->L31: 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[]" "[97] L31-->L29: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:58:21,675 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:21,675 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 1 times [2025-04-26 16:58:21,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:21,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422548948] [2025-04-26 16:58:21,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:21,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:21,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:58:21,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:58:21,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:21,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:21,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:21,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:58:21,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:58:21,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:21,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:21,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:21,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:21,751 INFO L85 PathProgramCache]: Analyzing trace with hash 4003, now seen corresponding path program 1 times [2025-04-26 16:58:21,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:21,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643993398] [2025-04-26 16:58:21,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:21,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:21,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:21,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:21,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:21,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:21,758 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:21,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:21,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:21,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:21,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:21,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:21,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:21,763 INFO L85 PathProgramCache]: Analyzing trace with hash 149114, now seen corresponding path program 1 times [2025-04-26 16:58:21,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:21,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997448671] [2025-04-26 16:58:21,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:21,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:21,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:21,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:21,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:21,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:21,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:21,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:21,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:21,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:21,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:21,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:21,824 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:21,825 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:21,825 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:21,825 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:21,825 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:21,825 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:21,825 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:21,825 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:21,826 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:21,826 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:21,826 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:21,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:21,915 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:21,916 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:21,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:21,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:21,920 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:21,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:58:21,927 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:21,928 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:21,980 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 16:58:21,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:21,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:21,983 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:21,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:58:21,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:21,986 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:22,056 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:22,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:58:22,062 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:22,062 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:22,062 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:22,062 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:22,062 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:22,062 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:22,063 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:22,063 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:22,063 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:22,063 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:22,063 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:22,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:22,091 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:22,095 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:22,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:22,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:22,100 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:22,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:58:22,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:22,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:22,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:22,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:22,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:22,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:22,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:22,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:22,122 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:22,128 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:22,128 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:22,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:22,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:22,134 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:22,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:58:22,135 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:22,138 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:22,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:58:22,139 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:22,140 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:22,140 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 16:58:22,147 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 16:58:22,150 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:22,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:22,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:58:22,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:58:22,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:22,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:22,184 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:22,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:22,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:22,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:22,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:22,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:22,193 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:22,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:22,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:22,224 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:22,240 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 8427 states, 8426 states have (on average 3.6121528601946356) internal successors, (in total 30436), 8426 states have internal predecessors, (30436), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:22,681 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 8427 states, 8426 states have (on average 3.6121528601946356) internal successors, (in total 30436), 8426 states have internal predecessors, (30436), 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 22138 states and 83473 transitions. Complement of second has 6 states. [2025-04-26 16:58:22,682 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:22,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:22,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2025-04-26 16:58:22,690 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 16:58:22,690 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:22,693 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:58:22,693 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:22,693 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 91 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 16:58:22,693 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:22,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22138 states and 83473 transitions. [2025-04-26 16:58:23,105 INFO L131 ngComponentsAnalysis]: Automaton has 1002 accepting balls. 4966 [2025-04-26 16:58:23,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22138 states to 13962 states and 51426 transitions. [2025-04-26 16:58:23,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6199 [2025-04-26 16:58:23,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9382 [2025-04-26 16:58:23,342 INFO L74 IsDeterministic]: Start isDeterministic. Operand 13962 states and 51426 transitions. [2025-04-26 16:58:23,343 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:23,343 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13962 states and 51426 transitions. [2025-04-26 16:58:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13962 states and 51426 transitions. [2025-04-26 16:58:23,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13962 to 11040. [2025-04-26 16:58:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11040 states, 11040 states have (on average 3.8041666666666667) internal successors, (in total 41998), 11039 states have internal predecessors, (41998), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11040 states to 11040 states and 41998 transitions. [2025-04-26 16:58:23,804 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11040 states and 41998 transitions. [2025-04-26 16:58:23,804 INFO L438 stractBuchiCegarLoop]: Abstraction has 11040 states and 41998 transitions. [2025-04-26 16:58:23,804 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:58:23,804 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11040 states and 41998 transitions. [2025-04-26 16:58:23,875 INFO L131 ngComponentsAnalysis]: Automaton has 1002 accepting balls. 4966 [2025-04-26 16:58:23,875 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:23,875 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:23,875 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:58:23,875 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:23,876 INFO L752 eck$LassoCheckResult]: Stem: "[121] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[94] L29-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[96] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[124] L12-->L38: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:58:23,876 INFO L754 eck$LassoCheckResult]: Loop: "[99] L38-->L40: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[101] L40-->L38: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:58:23,877 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:23,877 INFO L85 PathProgramCache]: Analyzing trace with hash 4621666, now seen corresponding path program 1 times [2025-04-26 16:58:23,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:23,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416756754] [2025-04-26 16:58:23,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:23,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:23,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:23,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:23,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:23,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:23,884 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:23,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:23,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:23,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:23,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:23,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:23,890 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:23,890 INFO L85 PathProgramCache]: Analyzing trace with hash 4131, now seen corresponding path program 1 times [2025-04-26 16:58:23,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:23,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743110679] [2025-04-26 16:58:23,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:23,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:23,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:23,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:23,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:23,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:23,894 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:23,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:23,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:23,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:23,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:23,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:23,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:23,900 INFO L85 PathProgramCache]: Analyzing trace with hash 146456900, now seen corresponding path program 1 times [2025-04-26 16:58:23,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:23,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086213965] [2025-04-26 16:58:23,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:23,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:23,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:23,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:23,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:23,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:23,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:23,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:23,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:23,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:23,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:23,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:23,935 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:23,935 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:23,935 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:23,935 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:23,935 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:23,935 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:23,935 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:23,935 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:23,935 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:23,935 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:23,935 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:23,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:23,955 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:23,956 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:23,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:23,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:23,959 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:23,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:58:23,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:23,962 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:23,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:23,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:23,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:23,981 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:23,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:58:24,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:24,087 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:24,157 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:24,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:24,162 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:24,162 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:24,163 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:24,163 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:24,163 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:24,163 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:24,163 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:24,163 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:24,163 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:24,163 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:24,163 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:24,164 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:24,182 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:24,182 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:24,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:24,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:24,185 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:24,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:58:24,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:24,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:24,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:24,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:24,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:24,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:24,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:24,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:24,204 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:24,209 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:24,209 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:24,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:24,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:24,211 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:24,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:58:24,214 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:24,217 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:24,218 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 16:58:24,219 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:24,219 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:24,219 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x2) = 1*z - 1*x2 Supporting invariants [] [2025-04-26 16:58:24,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:24,226 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:24,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:24,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:24,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:24,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:24,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:24,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:24,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:24,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:24,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:24,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:24,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:24,260 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:24,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:24,275 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:24,276 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11040 states and 41998 transitions. cyclomatic complexity: 32292 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:24,608 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11040 states and 41998 transitions. cyclomatic complexity: 32292. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 30255 states and 113550 transitions. Complement of second has 6 states. [2025-04-26 16:58:24,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:24,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:24,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2025-04-26 16:58:24,609 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:58:24,609 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:24,609 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:58:24,610 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:24,610 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 93 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:58:24,610 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:24,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30255 states and 113550 transitions. [2025-04-26 16:58:25,010 INFO L131 ngComponentsAnalysis]: Automaton has 775 accepting balls. 2834 [2025-04-26 16:58:25,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30255 states to 19674 states and 72520 transitions. [2025-04-26 16:58:25,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6830 [2025-04-26 16:58:25,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9262 [2025-04-26 16:58:25,297 INFO L74 IsDeterministic]: Start isDeterministic. Operand 19674 states and 72520 transitions. [2025-04-26 16:58:25,297 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:25,297 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19674 states and 72520 transitions. [2025-04-26 16:58:25,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19674 states and 72520 transitions. [2025-04-26 16:58:25,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19674 to 17231. [2025-04-26 16:58:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17231 states, 17231 states have (on average 3.7644942255237654) internal successors, (in total 64866), 17230 states have internal predecessors, (64866), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:25,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17231 states to 17231 states and 64866 transitions. [2025-04-26 16:58:25,891 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17231 states and 64866 transitions. [2025-04-26 16:58:25,891 INFO L438 stractBuchiCegarLoop]: Abstraction has 17231 states and 64866 transitions. [2025-04-26 16:58:25,891 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:58:25,891 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17231 states and 64866 transitions. [2025-04-26 16:58:25,971 INFO L131 ngComponentsAnalysis]: Automaton has 775 accepting balls. 2834 [2025-04-26 16:58:25,971 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:25,971 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:25,972 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:25,972 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:25,972 INFO L752 eck$LassoCheckResult]: Stem: "[121] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[94] L29-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[96] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[124] L12-->L38: 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]" "[98] L38-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[100] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[127] L13-->L47: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:58:25,973 INFO L754 eck$LassoCheckResult]: Loop: "[103] L47-->L49: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[105] L49-->L47: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:58:25,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:25,973 INFO L85 PathProgramCache]: Analyzing trace with hash 245195739, now seen corresponding path program 1 times [2025-04-26 16:58:25,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:25,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424470307] [2025-04-26 16:58:25,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:25,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:25,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:25,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:25,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:25,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:25,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:25,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:25,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:25,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:25,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:25,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:25,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:25,986 INFO L85 PathProgramCache]: Analyzing trace with hash 4259, now seen corresponding path program 1 times [2025-04-26 16:58:25,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:25,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532385276] [2025-04-26 16:58:25,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:25,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:25,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:25,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:25,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:25,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:25,991 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:25,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:25,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:25,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:25,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:25,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:25,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash -590092803, now seen corresponding path program 1 times [2025-04-26 16:58:25,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:25,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812298815] [2025-04-26 16:58:25,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:25,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:25,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:26,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:26,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:26,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:26,000 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:26,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:26,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:26,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:26,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:26,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:26,024 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:26,024 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:26,024 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:26,024 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:26,024 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:26,024 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:26,025 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:26,025 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:26,025 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:26,025 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:26,025 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:26,025 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:26,043 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:26,043 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:26,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:26,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:26,045 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:26,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:58:26,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:26,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:26,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:58:26,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:26,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:26,067 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:26,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:58:26,070 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:26,070 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:26,135 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:26,139 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 16:58:26,140 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:26,140 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:26,140 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:26,140 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:26,140 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:26,140 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:26,140 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:26,140 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:26,140 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:26,140 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:26,140 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:26,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:26,156 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:26,156 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:26,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:26,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:26,158 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:26,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:58:26,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:26,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:26,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:26,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:26,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:26,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:26,172 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:26,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:26,174 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:26,176 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:26,176 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:26,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:26,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:26,178 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:26,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:58:26,180 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:26,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:26,184 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:26,184 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:26,184 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 16:58:26,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:26,190 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:26,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:26,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:26,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:26,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:26,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:26,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:26,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:26,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:26,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:26,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:26,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:26,221 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:26,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:26,232 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:26,232 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17231 states and 64866 transitions. cyclomatic complexity: 49169 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:26,600 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17231 states and 64866 transitions. cyclomatic complexity: 49169. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 46424 states and 171369 transitions. Complement of second has 6 states. [2025-04-26 16:58:26,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2025-04-26 16:58:26,602 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:58:26,602 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:26,602 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:58:26,602 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:26,602 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 98 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:58:26,602 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:26,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46424 states and 171369 transitions. [2025-04-26 16:58:27,253 INFO L131 ngComponentsAnalysis]: Automaton has 590 accepting balls. 1626 [2025-04-26 16:58:27,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46424 states to 29477 states and 107003 transitions. [2025-04-26 16:58:27,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8465 [2025-04-26 16:58:27,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9939 [2025-04-26 16:58:27,637 INFO L74 IsDeterministic]: Start isDeterministic. Operand 29477 states and 107003 transitions. [2025-04-26 16:58:27,637 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:27,637 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29477 states and 107003 transitions. [2025-04-26 16:58:27,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29477 states and 107003 transitions. [2025-04-26 16:58:28,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29477 to 27607. [2025-04-26 16:58:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27607 states, 27607 states have (on average 3.6209294744086646) internal successors, (in total 99963), 27606 states have internal predecessors, (99963), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27607 states to 27607 states and 99963 transitions. [2025-04-26 16:58:28,620 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27607 states and 99963 transitions. [2025-04-26 16:58:28,620 INFO L438 stractBuchiCegarLoop]: Abstraction has 27607 states and 99963 transitions. [2025-04-26 16:58:28,620 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:58:28,620 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27607 states and 99963 transitions. [2025-04-26 16:58:28,750 INFO L131 ngComponentsAnalysis]: Automaton has 590 accepting balls. 1626 [2025-04-26 16:58:28,751 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:28,751 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:28,751 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:28,751 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:28,752 INFO L752 eck$LassoCheckResult]: Stem: "[121] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[95] L29-->L31: 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[]" "[124] L12-->L38: 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]" "[97] L31-->L29: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[127] L13-->L47: 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]" "[94] L29-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[130] L14-->L56: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[98] L38-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[102] L47-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" [2025-04-26 16:58:28,752 INFO L754 eck$LassoCheckResult]: Loop: "[107] L56-->L58: 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[]" "[109] L58-->L56: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" [2025-04-26 16:58:28,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:28,752 INFO L85 PathProgramCache]: Analyzing trace with hash -513364165, now seen corresponding path program 1 times [2025-04-26 16:58:28,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:28,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598841955] [2025-04-26 16:58:28,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:28,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:28,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:28,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:28,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:28,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:28,760 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:28,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:28,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:28,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:28,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:28,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:28,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:28,769 INFO L85 PathProgramCache]: Analyzing trace with hash 4387, now seen corresponding path program 1 times [2025-04-26 16:58:28,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:28,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476071811] [2025-04-26 16:58:28,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:28,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:28,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:28,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:28,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:28,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:28,774 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:28,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:28,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:28,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:28,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:28,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:28,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:28,777 INFO L85 PathProgramCache]: Analyzing trace with hash 578279901, now seen corresponding path program 1 times [2025-04-26 16:58:28,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:28,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789303284] [2025-04-26 16:58:28,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:28,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:28,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:28,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:28,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:28,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:28,787 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:28,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:28,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:28,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:28,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:28,796 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:28,809 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:28,809 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:28,809 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:28,809 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:28,809 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:28,809 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:28,809 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:28,809 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:28,809 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:28,809 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:28,809 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:28,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:28,824 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:28,824 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:28,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:28,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:28,828 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:28,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:58:28,830 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:28,830 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:28,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:58:28,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:28,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:28,848 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:28,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:58:28,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:28,851 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:28,914 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:28,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:58:28,918 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:28,918 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:28,918 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:28,918 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:28,918 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:28,918 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:28,918 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:28,918 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:28,918 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:28,918 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:28,918 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:28,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:28,941 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:28,942 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:28,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:28,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:28,944 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:28,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:58:28,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:28,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:28,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:28,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:28,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:28,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:28,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:28,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:28,960 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:28,965 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:28,965 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:28,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:28,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:28,967 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:28,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:58:28,969 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:28,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:58:28,972 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:28,972 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:28,972 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 16:58:28,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:28,978 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:28,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:28,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:28,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:28,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:28,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:28,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:28,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:29,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:29,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:29,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:29,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:29,015 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:29,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:29,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:29,029 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:29,029 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27607 states and 99963 transitions. cyclomatic complexity: 74279 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:29,547 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27607 states and 99963 transitions. cyclomatic complexity: 74279. 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 49284 states and 173111 transitions. Complement of second has 6 states. [2025-04-26 16:58:29,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:29,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-04-26 16:58:29,548 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:58:29,548 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:29,548 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:58:29,548 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:29,548 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:58:29,548 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:29,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49284 states and 173111 transitions. [2025-04-26 16:58:30,282 INFO L131 ngComponentsAnalysis]: Automaton has 496 accepting balls. 1076 [2025-04-26 16:58:30,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49284 states to 38189 states and 132914 transitions. [2025-04-26 16:58:30,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10898 [2025-04-26 16:58:30,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12094 [2025-04-26 16:58:30,641 INFO L74 IsDeterministic]: Start isDeterministic. Operand 38189 states and 132914 transitions. [2025-04-26 16:58:30,641 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:30,642 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38189 states and 132914 transitions. [2025-04-26 16:58:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38189 states and 132914 transitions. [2025-04-26 16:58:31,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38189 to 35833. [2025-04-26 16:58:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35833 states, 35833 states have (on average 3.550805123768593) internal successors, (in total 127236), 35832 states have internal predecessors, (127236), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:31,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35833 states to 35833 states and 127236 transitions. [2025-04-26 16:58:31,448 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35833 states and 127236 transitions. [2025-04-26 16:58:31,448 INFO L438 stractBuchiCegarLoop]: Abstraction has 35833 states and 127236 transitions. [2025-04-26 16:58:31,448 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:58:31,448 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35833 states and 127236 transitions. [2025-04-26 16:58:31,608 INFO L131 ngComponentsAnalysis]: Automaton has 482 accepting balls. 1048 [2025-04-26 16:58:31,609 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:31,609 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:31,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:31,609 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:31,610 INFO L752 eck$LassoCheckResult]: Stem: "[121] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[95] L29-->L31: 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[]" "[124] L12-->L38: 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]" "[97] L31-->L29: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[127] L13-->L47: 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]" "[94] L29-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[130] L14-->L56: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[98] L38-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[133] L15-->L65: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[102] L47-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" "[136] L16-->L75: Formula: (and (= v_thread6Thread1of1ForFork5_thidvar3_2 6) (= v_thread6Thread1of1ForFork5_thidvar5_2 6) (= v_thread6Thread1of1ForFork5_thidvar4_2 6) (= v_thread6Thread1of1ForFork5_thidvar2_2 6) (= v_thread6Thread1of1ForFork5_thidvar0_2 6) (= v_thread6Thread1of1ForFork5_thidvar1_2 6)) InVars {} OutVars{thread6Thread1of1ForFork5_thidvar0=v_thread6Thread1of1ForFork5_thidvar0_2, thread6Thread1of1ForFork5_thidvar1=v_thread6Thread1of1ForFork5_thidvar1_2, thread6Thread1of1ForFork5_thidvar2=v_thread6Thread1of1ForFork5_thidvar2_2, thread6Thread1of1ForFork5_thidvar3=v_thread6Thread1of1ForFork5_thidvar3_2, thread6Thread1of1ForFork5_thidvar4=v_thread6Thread1of1ForFork5_thidvar4_2, thread6Thread1of1ForFork5_thidvar5=v_thread6Thread1of1ForFork5_thidvar5_2} AuxVars[] AssignedVars[thread6Thread1of1ForFork5_thidvar0, thread6Thread1of1ForFork5_thidvar1, thread6Thread1of1ForFork5_thidvar2, thread6Thread1of1ForFork5_thidvar3, thread6Thread1of1ForFork5_thidvar4, thread6Thread1of1ForFork5_thidvar5]" [2025-04-26 16:58:31,610 INFO L754 eck$LassoCheckResult]: Loop: "[116] L75-->L77: Formula: (< v_x6_3 v_z_11) InVars {x6=v_x6_3, z=v_z_11} OutVars{x6=v_x6_3, z=v_z_11} AuxVars[] AssignedVars[]" "[118] L77-->L75: Formula: (= v_x6_4 (+ v_x6_5 1)) InVars {x6=v_x6_5} OutVars{x6=v_x6_4} AuxVars[] AssignedVars[x6]" [2025-04-26 16:58:31,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:31,611 INFO L85 PathProgramCache]: Analyzing trace with hash 578309564, now seen corresponding path program 1 times [2025-04-26 16:58:31,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:31,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934111706] [2025-04-26 16:58:31,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:31,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:31,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:31,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:31,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:31,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:31,617 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:31,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:31,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:31,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:31,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:31,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:31,623 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:31,623 INFO L85 PathProgramCache]: Analyzing trace with hash 4675, now seen corresponding path program 1 times [2025-04-26 16:58:31,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:31,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132152351] [2025-04-26 16:58:31,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:31,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:31,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:31,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:31,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:31,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:31,625 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:31,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:31,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:31,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:31,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:31,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:31,627 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:31,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1704713534, now seen corresponding path program 1 times [2025-04-26 16:58:31,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:31,627 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900809488] [2025-04-26 16:58:31,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:31,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:31,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:58:31,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:58:31,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:31,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:31,637 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:31,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:58:31,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:58:31,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:31,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:31,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:31,664 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:31,664 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:31,664 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:31,664 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:31,664 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:31,664 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:31,664 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:31,664 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:31,664 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:58:31,664 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:31,664 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:31,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:31,681 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:31,681 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:31,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:31,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:31,683 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:31,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:58:31,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:31,685 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:31,700 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 16:58:31,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:31,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:31,702 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:31,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:58:31,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:31,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:31,770 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:31,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:31,775 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:31,775 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:31,775 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:31,775 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:31,775 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:31,775 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:31,775 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:31,775 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:31,775 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:58:31,775 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:31,775 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:31,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:31,794 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:31,794 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:31,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:31,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:31,796 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:31,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:58:31,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:31,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:31,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:31,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:31,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:31,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:31,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:31,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:31,813 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:31,817 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:31,817 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:31,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:31,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:31,819 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:31,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:58:31,822 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:31,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:31,825 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:31,825 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:31,825 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x6, z) = -1*x6 + 1*z Supporting invariants [] [2025-04-26 16:58:31,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:31,832 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:31,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:31,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:31,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:31,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:31,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:31,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:31,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:31,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:31,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:31,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:31,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:31,989 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:31,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:32,048 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:32,048 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35833 states and 127236 transitions. cyclomatic complexity: 93768 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:33,071 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35833 states and 127236 transitions. cyclomatic complexity: 93768. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 107468 states and 394069 transitions. Complement of second has 6 states. [2025-04-26 16:58:33,071 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:33,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:33,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-04-26 16:58:33,072 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:58:33,072 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:33,072 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:58:33,072 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:33,072 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:58:33,072 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:33,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107468 states and 394069 transitions. [2025-04-26 16:58:34,373 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 240 [2025-04-26 16:58:34,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107468 states to 50649 states and 186495 transitions. [2025-04-26 16:58:34,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11212 [2025-04-26 16:58:34,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11862 [2025-04-26 16:58:34,816 INFO L74 IsDeterministic]: Start isDeterministic. Operand 50649 states and 186495 transitions. [2025-04-26 16:58:34,816 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:34,816 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50649 states and 186495 transitions. [2025-04-26 16:58:34,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50649 states and 186495 transitions. [2025-04-26 16:58:35,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50649 to 47400. [2025-04-26 16:58:35,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47400 states, 47400 states have (on average 3.7059071729957807) internal successors, (in total 175660), 47399 states have internal predecessors, (175660), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47400 states to 47400 states and 175660 transitions. [2025-04-26 16:58:36,186 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47400 states and 175660 transitions. [2025-04-26 16:58:36,186 INFO L438 stractBuchiCegarLoop]: Abstraction has 47400 states and 175660 transitions. [2025-04-26 16:58:36,186 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:58:36,186 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47400 states and 175660 transitions. [2025-04-26 16:58:36,581 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 240 [2025-04-26 16:58:36,581 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:36,581 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:36,582 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:36,582 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:58:36,583 INFO L752 eck$LassoCheckResult]: Stem: "[121] $Ultimate##0-->L29: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[95] L29-->L31: 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[]" "[124] L12-->L38: 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]" "[97] L31-->L29: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[127] L13-->L47: 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]" "[94] L29-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[130] L14-->L56: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[98] L38-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[133] L15-->L65: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[102] L47-->thread3FINAL: Formula: (<= v_z_6 v_x3_4) InVars {x3=v_x3_4, z=v_z_6} OutVars{x3=v_x3_4, z=v_z_6} AuxVars[] AssignedVars[]" "[106] L56-->thread4FINAL: Formula: (<= v_z_8 v_x4_4) InVars {x4=v_x4_4, z=v_z_8} OutVars{x4=v_x4_4, z=v_z_8} AuxVars[] AssignedVars[]" [2025-04-26 16:58:36,583 INFO L754 eck$LassoCheckResult]: Loop: "[111] L65-->L67: Formula: (< v_x5_1 v_z_9) InVars {x5=v_x5_1, z=v_z_9} OutVars{x5=v_x5_1, z=v_z_9} AuxVars[] AssignedVars[]" "[113] L67-->L68: Formula: (= v_x5_2 (+ v_x5_3 1)) InVars {x5=v_x5_3} OutVars{x5=v_x5_2} AuxVars[] AssignedVars[x5]" "[114] L68-->L65: Formula: (= v_x6_1 (+ v_x6_2 1)) InVars {x6=v_x6_2} OutVars{x6=v_x6_1} AuxVars[] AssignedVars[x6]" [2025-04-26 16:58:36,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:36,583 INFO L85 PathProgramCache]: Analyzing trace with hash 578309534, now seen corresponding path program 1 times [2025-04-26 16:58:36,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:36,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455974967] [2025-04-26 16:58:36,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:36,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:36,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:36,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:36,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:36,588 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:36,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:36,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:36,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:36,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:36,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:36,595 INFO L85 PathProgramCache]: Analyzing trace with hash 140079, now seen corresponding path program 1 times [2025-04-26 16:58:36,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:36,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091481921] [2025-04-26 16:58:36,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:36,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:36,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:36,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:36,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:36,598 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:36,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:36,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:36,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:36,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:36,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:36,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1305613426, now seen corresponding path program 1 times [2025-04-26 16:58:36,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:36,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316257843] [2025-04-26 16:58:36,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:36,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:36,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:58:36,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:58:36,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:36,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:36,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:58:36,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:58:36,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:36,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:36,642 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:36,642 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:36,642 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:36,642 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:36,642 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:36,642 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,642 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:36,642 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:36,642 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:58:36,642 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:36,642 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:36,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,649 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,671 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:36,671 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:36,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,673 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:36,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:58:36,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:36,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:36,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:36,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,696 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:36,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:58:36,701 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:36,702 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:36,762 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:36,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:58:36,767 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:36,767 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:36,767 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:36,767 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:36,767 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:36,767 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,767 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:36,767 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:36,767 INFO L132 ssoRankerPreferences]: Filename of dumped script: indep_loops_minus1_6.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:58:36,767 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:36,767 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:36,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:36,785 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:36,785 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:36,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,787 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:36,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:58:36,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:58:36,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:36,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:36,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:36,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:36,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:36,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:36,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:36,801 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:36,803 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:36,803 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:36,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:36,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:36,805 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:58:36,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:58:36,807 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:36,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:36,811 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:36,811 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:36,811 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x5) = 1*z - 1*x5 Supporting invariants [] [2025-04-26 16:58:36,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:36,816 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:36,824 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:36,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:58:36,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:58:36,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:36,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:36,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:36,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:58:36,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:58:36,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:36,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:36,856 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:36,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:36,895 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:58:36,896 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47400 states and 175660 transitions. cyclomatic complexity: 130088 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:37,661 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47400 states and 175660 transitions. cyclomatic complexity: 130088. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 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 89691 states and 317733 transitions. Complement of second has 6 states. [2025-04-26 16:58:37,662 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:58:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2025-04-26 16:58:37,663 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 16:58:37,663 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:37,663 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 16:58:37,663 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:37,663 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 105 transitions. Stem has 11 letters. Loop has 6 letters. [2025-04-26 16:58:37,663 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:37,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 89691 states and 317733 transitions. [2025-04-26 16:58:38,865 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:38,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 89691 states to 0 states and 0 transitions. [2025-04-26 16:58:38,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:58:38,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:58:38,866 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:58:38,866 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:58:38,866 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:38,866 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:38,866 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:38,866 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:58:38,866 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:58:38,866 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:38,866 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:58:38,876 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 16:58:38,877 INFO L201 PluginConnector]: Adding new model indep_loops_minus1_6.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:58:38 BoogieIcfgContainer [2025-04-26 16:58:38,877 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:58:38,878 INFO L158 Benchmark]: Toolchain (without parser) took 19354.97ms. Allocated memory was 159.4MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 85.1MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 998.5MB. Max. memory is 8.0GB. [2025-04-26 16:58:38,878 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.21ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:38,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.47ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 83.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:38,878 INFO L158 Benchmark]: Boogie Preprocessor took 26.89ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 82.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:38,879 INFO L158 Benchmark]: RCFGBuilder took 180.70ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 72.0MB in the end (delta: 10.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:58:38,879 INFO L158 Benchmark]: BuchiAutomizer took 19107.97ms. Allocated memory was 159.4MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 71.9MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 985.9MB. Max. memory is 8.0GB. [2025-04-26 16:58:38,880 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.21ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.47ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 83.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.89ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 82.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 180.70ms. Allocated memory is still 159.4MB. Free memory was 82.1MB in the beginning and 72.0MB in the end (delta: 10.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 19107.97ms. Allocated memory was 159.4MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 71.9MB in the beginning and 2.5GB in the end (delta: -2.4GB). Peak memory consumption was 985.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.9s and 7 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.3s. Büchi inclusion checks took 3.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 4.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 12840 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 6.2s Buchi closure took 0.1s. 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, 438 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 432 mSDsluCounter, 410 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 200 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 544 IncrementalHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 210 mSDtfsCounter, 544 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 lsp95 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 43ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 1.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 1406, Number of transitions in reduction automaton: 30436, Number of states in reduction automaton: 8427, 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 z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x6 and consists of 4 locations. One deterministic module has affine ranking function -1 * x5 + z and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:58:38,891 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...