/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/me1.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:58:53,009 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:58:53,065 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:58:53,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:58:53,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:58:53,069 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:53,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:58:53,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:58:53,091 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:58:53,091 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:58:53,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:58:53,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:58:53,092 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:58:53,092 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:58:53,092 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:58:53,092 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:58:53,092 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:58:53,092 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:58:53,092 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:58:53,092 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:58:53,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:58:53,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:58:53,092 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:58:53,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:58:53,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:58:53,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:58:53,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:58:53,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:58:53,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:58:53,093 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:58:53,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:58:53,093 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:58:53,093 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:58:53,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:58:53,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:58:53,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:53,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:58:53,095 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:58:53,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:58:53,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:58:53,095 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:58:53,095 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:58:53,095 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:58:53,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:58:53,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:58:53,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:58:53,321 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:58:53,322 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:58:53,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/me1.c.bpl [2025-04-26 16:58:53,322 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/me1.c.bpl' [2025-04-26 16:58:53,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:58:53,336 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:58:53,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:53,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:58:53,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:58:53,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:53" (1/1) ... [2025-04-26 16:58:53,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:53" (1/1) ... [2025-04-26 16:58:53,372 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:58:53,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:53,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:58:53,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:58:53,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:58:53,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:53" (1/1) ... [2025-04-26 16:58:53,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:53" (1/1) ... [2025-04-26 16:58:53,381 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:53" (1/1) ... [2025-04-26 16:58:53,381 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:53" (1/1) ... [2025-04-26 16:58:53,382 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:53" (1/1) ... [2025-04-26 16:58:53,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:53" (1/1) ... [2025-04-26 16:58:53,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:53" (1/1) ... [2025-04-26 16:58:53,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:53" (1/1) ... [2025-04-26 16:58:53,385 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:53" (1/1) ... [2025-04-26 16:58:53,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:58:53,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:58:53,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:58:53,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:58:53,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:53" (1/1) ... [2025-04-26 16:58:53,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:53,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:53,419 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:53,423 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:53,436 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:58:53,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:58:53,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:58:53,437 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:58:53,437 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:58:53,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:58:53,437 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:58:53,437 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:58:53,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:58:53,437 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:58:53,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:58:53,437 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:58:53,437 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:58:53,437 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:58:53,437 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:58:53,438 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:53,477 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:58:53,479 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:58:53,569 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:58:53,569 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:58:53,580 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:58:53,580 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:58:53,581 INFO L201 PluginConnector]: Adding new model me1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:53 BoogieIcfgContainer [2025-04-26 16:58:53,581 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:58:53,582 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:58:53,582 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:58:53,587 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:58:53,587 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:53,587 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:53" (1/2) ... [2025-04-26 16:58:53,589 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11730384 and model type me1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:58:53, skipping insertion in model container [2025-04-26 16:58:53,589 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:53,589 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:53" (2/2) ... [2025-04-26 16:58:53,590 INFO L376 chiAutomizerObserver]: Analyzing ICFG me1.c.bpl [2025-04-26 16:58:53,649 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:58:53,690 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:58:53,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:58:53,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:53,694 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:53,695 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:53,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 38 transitions, 104 flow [2025-04-26 16:58:53,771 INFO L116 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-04-26 16:58:53,775 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:58:53,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 30 events. 4/30 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 67 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2025-04-26 16:58:53,781 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 38 transitions, 104 flow [2025-04-26 16:58:53,784 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 30 transitions, 84 flow [2025-04-26 16:58:53,784 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 39 places, 30 transitions, 84 flow [2025-04-26 16:58:53,790 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:58:54,117 WARN L140 AmpleReduction]: Number of pruned transitions: 1372 [2025-04-26 16:58:54,117 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:58:54,119 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 218 [2025-04-26 16:58:54,119 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:40 [2025-04-26 16:58:54,119 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:510 [2025-04-26 16:58:54,119 WARN L145 AmpleReduction]: Times succ was already a loop node:470 [2025-04-26 16:58:54,119 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:52 [2025-04-26 16:58:54,119 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:58:54,124 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 769 states, 768 states have (on average 2.1575520833333335) internal successors, (in total 1657), 768 states have internal predecessors, (1657), 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:54,132 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:58:54,132 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:58:54,132 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:58:54,132 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:58:54,132 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:58:54,132 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:58:54,132 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:58:54,133 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:58:54,135 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 769 states, 768 states have (on average 2.1575520833333335) internal successors, (in total 1657), 768 states have internal predecessors, (1657), 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:54,168 INFO L131 ngComponentsAnalysis]: Automaton has 143 accepting balls. 460 [2025-04-26 16:58:54,168 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:54,168 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:54,173 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:54,173 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:54,173 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:58:54,174 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 769 states, 768 states have (on average 2.1575520833333335) internal successors, (in total 1657), 768 states have internal predecessors, (1657), 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:54,185 INFO L131 ngComponentsAnalysis]: Automaton has 143 accepting balls. 460 [2025-04-26 16:58:54,185 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:54,185 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:54,185 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:54,185 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:54,189 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:58:54,189 INFO L754 eck$LassoCheckResult]: Loop: "[75] L27-->L29: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[77] L29-->L27: 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:54,192 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:54,192 INFO L85 PathProgramCache]: Analyzing trace with hash 3165, now seen corresponding path program 1 times [2025-04-26 16:58:54,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:54,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550543766] [2025-04-26 16:58:54,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:54,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:54,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:54,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:54,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,241 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:54,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:54,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:54,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:54,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:54,256 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 1 times [2025-04-26 16:58:54,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:54,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812454073] [2025-04-26 16:58:54,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:54,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:54,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:54,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:54,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,268 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:54,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:54,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:54,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:54,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:54,274 INFO L85 PathProgramCache]: Analyzing trace with hash 3043967, now seen corresponding path program 1 times [2025-04-26 16:58:54,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:54,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912769549] [2025-04-26 16:58:54,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:54,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:54,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:54,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:54,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,283 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:54,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:54,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:58:54,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:54,342 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:54,343 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:54,343 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:54,343 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:54,343 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:54,343 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,343 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:54,343 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:54,343 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:54,343 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:54,343 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:54,356 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:54,401 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:54,401 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:54,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:54,419 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:54,420 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:54,421 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:54,421 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:54,448 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:54,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:54,450 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:54,452 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:54,453 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:54,453 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:54,525 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:54,530 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:54,530 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:54,530 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:54,530 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:54,530 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:54,530 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:54,530 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,530 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:54,530 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:54,530 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:54,530 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:54,530 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:54,531 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:54,557 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:54,560 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:54,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:54,563 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:54,565 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:54,567 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:54,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:54,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:54,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:54,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:54,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:54,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:54,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:54,586 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:54,591 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:54,591 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:54,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:54,617 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:54,618 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:54,619 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:54,622 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:54,622 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:54,622 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:54,622 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-04-26 16:58:54,627 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:54,629 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:54,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:54,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:54,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:54,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:54,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:54,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:54,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:54,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:54,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:54,674 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:54,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:54,697 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:54,713 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:54,716 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 769 states, 768 states have (on average 2.1575520833333335) internal successors, (in total 1657), 768 states have internal predecessors, (1657), 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.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:54,855 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 769 states, 768 states have (on average 2.1575520833333335) internal successors, (in total 1657), 768 states have internal predecessors, (1657), 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.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2432 states and 5338 transitions. Complement of second has 7 states. [2025-04-26 16:58:54,856 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:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2025-04-26 16:58:54,865 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:58:54,866 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:54,866 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:58:54,866 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:54,866 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 65 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:58:54,866 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:54,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2432 states and 5338 transitions. [2025-04-26 16:58:54,888 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 534 [2025-04-26 16:58:54,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2432 states to 1708 states and 3875 transitions. [2025-04-26 16:58:54,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1159 [2025-04-26 16:58:54,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1374 [2025-04-26 16:58:54,917 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1708 states and 3875 transitions. [2025-04-26 16:58:54,918 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:54,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1708 states and 3875 transitions. [2025-04-26 16:58:54,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states and 3875 transitions. [2025-04-26 16:58:54,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1183. [2025-04-26 16:58:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1183 states have (on average 2.4133558748943362) internal successors, (in total 2855), 1182 states have internal predecessors, (2855), 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:54,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 2855 transitions. [2025-04-26 16:58:54,985 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1183 states and 2855 transitions. [2025-04-26 16:58:54,985 INFO L438 stractBuchiCegarLoop]: Abstraction has 1183 states and 2855 transitions. [2025-04-26 16:58:54,986 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:58:54,986 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1183 states and 2855 transitions. [2025-04-26 16:58:54,991 INFO L131 ngComponentsAnalysis]: Automaton has 156 accepting balls. 468 [2025-04-26 16:58:54,991 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:54,991 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:54,991 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:58:54,991 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:54,992 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-1-->$Ultimate##0: 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]" "[74] L27-->L31: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[76] L31-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[79] $Ultimate##0-->L38-1: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" [2025-04-26 16:58:54,992 INFO L754 eck$LassoCheckResult]: Loop: "[81] L38-1-->L40: Formula: (< v_y1_1 v_x1_5) InVars {y1=v_y1_1, x1=v_x1_5} OutVars{y1=v_y1_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[83] L40-->L38-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 16:58:54,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:54,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1369000473, now seen corresponding path program 1 times [2025-04-26 16:58:54,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:54,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443241109] [2025-04-26 16:58:54,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:54,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:54,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:55,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:55,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,000 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:55,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:55,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,007 INFO L85 PathProgramCache]: Analyzing trace with hash 3555, now seen corresponding path program 1 times [2025-04-26 16:58:55,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687073572] [2025-04-26 16:58:55,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:55,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:55,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,013 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1349459383, now seen corresponding path program 1 times [2025-04-26 16:58:55,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485428288] [2025-04-26 16:58:55,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:55,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:55,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,021 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:58:55,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:58:55,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,028 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,041 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:55,041 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:55,042 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:55,042 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:55,042 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:55,042 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,042 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:55,042 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:55,042 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:55,042 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:55,042 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:55,042 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:55,058 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:55,058 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:55,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,060 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:55,062 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:55,063 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:55,063 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:55,079 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:55,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,081 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:55,081 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:55,083 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:55,083 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:55,151 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:55,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:58:55,155 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:55,155 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:55,155 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:55,155 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:55,155 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:55,155 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,155 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:55,155 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:55,155 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:55,156 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:55,156 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:55,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:55,175 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:55,175 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:55,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,177 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:55,178 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:55,178 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:55,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:55,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:55,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:55,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:55,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:55,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:55,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:55,192 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:55,198 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:55,198 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:55,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,201 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:55,202 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:55,202 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:55,205 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:55,205 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:55,205 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:55,205 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y1, x1) = -1*y1 + 1*x1 Supporting invariants [] [2025-04-26 16:58:55,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:58:55,211 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:55,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:58:55,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:58:55,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:55,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:55,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:55,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:55,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:55,242 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:55,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:55,260 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:55,260 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:55,260 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1183 states and 2855 transitions. cyclomatic complexity: 1885 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:55,369 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1183 states and 2855 transitions. cyclomatic complexity: 1885. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3339 states and 7927 transitions. Complement of second has 7 states. [2025-04-26 16:58:55,369 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:55,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-04-26 16:58:55,370 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:58:55,370 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,370 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:58:55,371 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,371 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:58:55,371 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3339 states and 7927 transitions. [2025-04-26 16:58:55,395 INFO L131 ngComponentsAnalysis]: Automaton has 220 accepting balls. 598 [2025-04-26 16:58:55,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3339 states to 2578 states and 6110 transitions. [2025-04-26 16:58:55,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1349 [2025-04-26 16:58:55,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1597 [2025-04-26 16:58:55,421 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2578 states and 6110 transitions. [2025-04-26 16:58:55,421 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:55,421 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2578 states and 6110 transitions. [2025-04-26 16:58:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states and 6110 transitions. [2025-04-26 16:58:55,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 1800. [2025-04-26 16:58:55,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1800 states, 1800 states have (on average 2.5033333333333334) internal successors, (in total 4506), 1799 states have internal predecessors, (4506), 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:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1800 states to 1800 states and 4506 transitions. [2025-04-26 16:58:55,471 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1800 states and 4506 transitions. [2025-04-26 16:58:55,471 INFO L438 stractBuchiCegarLoop]: Abstraction has 1800 states and 4506 transitions. [2025-04-26 16:58:55,471 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:58:55,471 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1800 states and 4506 transitions. [2025-04-26 16:58:55,478 INFO L131 ngComponentsAnalysis]: Automaton has 188 accepting balls. 532 [2025-04-26 16:58:55,479 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:55,479 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:55,479 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:55,479 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:55,479 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-1-->$Ultimate##0: 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]" "[79] $Ultimate##0-->L38-1: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[81] L38-1-->L40: Formula: (< v_y1_1 v_x1_5) InVars {y1=v_y1_1, x1=v_x1_5} OutVars{y1=v_y1_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[83] L40-->L38-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" "[80] L38-1-->thread2FINAL: Formula: (<= v_x1_8 v_y1_2) InVars {y1=v_y1_2, x1=v_x1_8} OutVars{y1=v_y1_2, x1=v_x1_8} AuxVars[] AssignedVars[]" [2025-04-26 16:58:55,479 INFO L754 eck$LassoCheckResult]: Loop: "[75] L27-->L29: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[77] L29-->L27: 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:55,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,480 INFO L85 PathProgramCache]: Analyzing trace with hash 510812261, now seen corresponding path program 1 times [2025-04-26 16:58:55,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380837487] [2025-04-26 16:58:55,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:55,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:55,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:55,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:58:55,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:55,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380837487] [2025-04-26 16:58:55,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380837487] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:55,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:55,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:58:55,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381392099] [2025-04-26 16:58:55,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:55,521 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:58:55,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,521 INFO L85 PathProgramCache]: Analyzing trace with hash 3363, now seen corresponding path program 2 times [2025-04-26 16:58:55,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48414036] [2025-04-26 16:58:55,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:58:55,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:55,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:58:55,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,529 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:55,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,549 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:55,550 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:55,550 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:55,550 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:55,550 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:55,550 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,550 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:55,550 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:55,550 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:55,550 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:55,550 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:55,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:55,567 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:55,568 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:55,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,571 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:55,572 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:55,573 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:55,573 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:55,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:55,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,592 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:55,593 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:55,594 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:55,594 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:55,661 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:55,665 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:55,666 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:55,666 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:55,666 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:55,666 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:55,666 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:55,666 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,666 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:55,666 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:55,666 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:55,666 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:55,666 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:55,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:55,686 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:55,686 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:55,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,688 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:55,690 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:55,691 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:55,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:55,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:55,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:55,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:55,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:55,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:55,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:55,708 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:55,710 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:55,711 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:55,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,713 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:55,715 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:55,716 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:55,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:58:55,720 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:55,720 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:55,720 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z1) = -1*x1 + 1*z1 Supporting invariants [] [2025-04-26 16:58:55,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:58:55,727 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:55,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:55,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:58:55,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:55,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:55,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:55,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:55,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:55,756 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:55,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:55,767 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:55,767 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:55,767 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1800 states and 4506 transitions. cyclomatic complexity: 3005 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:55,840 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1800 states and 4506 transitions. cyclomatic complexity: 3005. 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 2752 states and 6853 transitions. Complement of second has 6 states. [2025-04-26 16:58:55,840 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:55,841 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:55,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-04-26 16:58:55,841 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:58:55,841 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,841 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:58:55,841 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,841 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 78 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:58:55,842 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2752 states and 6853 transitions. [2025-04-26 16:58:55,860 INFO L131 ngComponentsAnalysis]: Automaton has 150 accepting balls. 416 [2025-04-26 16:58:55,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2752 states to 2233 states and 5399 transitions. [2025-04-26 16:58:55,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1128 [2025-04-26 16:58:55,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1345 [2025-04-26 16:58:55,878 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2233 states and 5399 transitions. [2025-04-26 16:58:55,878 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:55,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2233 states and 5399 transitions. [2025-04-26 16:58:55,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states and 5399 transitions. [2025-04-26 16:58:55,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 1768. [2025-04-26 16:58:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1768 states have (on average 2.535633484162896) internal successors, (in total 4483), 1767 states have internal predecessors, (4483), 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:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 4483 transitions. [2025-04-26 16:58:55,920 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1768 states and 4483 transitions. [2025-04-26 16:58:55,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:55,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:55,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:55,922 INFO L87 Difference]: Start difference. First operand 1768 states and 4483 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:55,943 INFO L93 Difference]: Finished difference Result 514 states and 1137 transitions. [2025-04-26 16:58:55,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 514 states and 1137 transitions. [2025-04-26 16:58:55,945 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 82 [2025-04-26 16:58:55,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 514 states to 477 states and 1063 transitions. [2025-04-26 16:58:55,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 248 [2025-04-26 16:58:55,950 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 248 [2025-04-26 16:58:55,950 INFO L74 IsDeterministic]: Start isDeterministic. Operand 477 states and 1063 transitions. [2025-04-26 16:58:55,950 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:55,950 INFO L218 hiAutomatonCegarLoop]: Abstraction has 477 states and 1063 transitions. [2025-04-26 16:58:55,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states and 1063 transitions. [2025-04-26 16:58:55,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2025-04-26 16:58:55,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 477 states have (on average 2.2285115303983227) internal successors, (in total 1063), 476 states have internal predecessors, (1063), 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:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 1063 transitions. [2025-04-26 16:58:55,961 INFO L240 hiAutomatonCegarLoop]: Abstraction has 477 states and 1063 transitions. [2025-04-26 16:58:55,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:58:55,965 INFO L438 stractBuchiCegarLoop]: Abstraction has 477 states and 1063 transitions. [2025-04-26 16:58:55,965 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:58:55,965 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 477 states and 1063 transitions. [2025-04-26 16:58:55,967 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 82 [2025-04-26 16:58:55,967 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:55,967 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:55,968 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:55,968 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:55,968 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-1-->$Ultimate##0: 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]" "[102] L15-->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]" "[74] L27-->L31: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[76] L31-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" "[79] $Ultimate##0-->L38-1: Formula: (< 0 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[80] L38-1-->thread2FINAL: Formula: (<= v_x1_8 v_y1_2) InVars {y1=v_y1_2, x1=v_x1_8} OutVars{y1=v_y1_2, x1=v_x1_8} AuxVars[] AssignedVars[]" "[78] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[82] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:58:55,969 INFO L754 eck$LassoCheckResult]: Loop: "[85] L47-->L49: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[87] L49-->L47: 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:55,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,969 INFO L85 PathProgramCache]: Analyzing trace with hash -730133209, now seen corresponding path program 1 times [2025-04-26 16:58:55,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71839763] [2025-04-26 16:58:55,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:55,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:55,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:55,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:55,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,992 INFO L85 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2025-04-26 16:58:55,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464384239] [2025-04-26 16:58:55,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:55,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,995 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:55,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1578341879, now seen corresponding path program 1 times [2025-04-26 16:58:55,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116130577] [2025-04-26 16:58:55,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:56,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:56,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:56,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:56,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:56,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:56,028 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:56,028 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:56,028 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:56,028 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:56,028 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:56,028 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,028 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:56,028 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:56,028 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:56,028 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:56,028 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:56,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,043 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:56,043 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:56,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,045 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:56,047 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:56,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:56,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:56,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,067 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:56,069 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:56,070 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:56,070 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,137 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:56,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:56,143 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:56,143 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:56,143 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:56,143 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:56,143 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:56,143 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,143 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:56,143 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:56,143 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:56,143 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:56,143 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:56,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,162 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:56,162 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:56,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,167 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:56,168 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:56,169 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:56,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:56,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:56,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:56,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:56,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:56,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:56,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:56,183 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:56,186 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:56,186 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:56,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,188 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:56,191 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:56,191 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:56,194 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:56,197 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:56,197 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:56,197 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:56,197 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 16:58:56,204 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:56,204 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:56,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:56,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:56,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:56,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:56,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:56,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,246 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:56,257 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:56,257 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:56,257 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 477 states and 1063 transitions. cyclomatic complexity: 670 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:56,301 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 477 states and 1063 transitions. cyclomatic complexity: 670. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 613 states and 1315 transitions. Complement of second has 7 states. [2025-04-26 16:58:56,301 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:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-04-26 16:58:56,302 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:58:56,302 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,302 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:58:56,302 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,302 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:58:56,302 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 613 states and 1315 transitions. [2025-04-26 16:58:56,305 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 66 [2025-04-26 16:58:56,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 613 states to 541 states and 1178 transitions. [2025-04-26 16:58:56,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 264 [2025-04-26 16:58:56,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 291 [2025-04-26 16:58:56,308 INFO L74 IsDeterministic]: Start isDeterministic. Operand 541 states and 1178 transitions. [2025-04-26 16:58:56,309 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:56,309 INFO L218 hiAutomatonCegarLoop]: Abstraction has 541 states and 1178 transitions. [2025-04-26 16:58:56,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states and 1178 transitions. [2025-04-26 16:58:56,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 499. [2025-04-26 16:58:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 499 states have (on average 2.2284569138276553) internal successors, (in total 1112), 498 states have internal predecessors, (1112), 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:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 1112 transitions. [2025-04-26 16:58:56,326 INFO L240 hiAutomatonCegarLoop]: Abstraction has 499 states and 1112 transitions. [2025-04-26 16:58:56,326 INFO L438 stractBuchiCegarLoop]: Abstraction has 499 states and 1112 transitions. [2025-04-26 16:58:56,326 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:58:56,326 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 499 states and 1112 transitions. [2025-04-26 16:58:56,329 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 66 [2025-04-26 16:58:56,329 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:56,329 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:56,329 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:56,329 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:56,329 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-1-->$Ultimate##0: 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]" "[102] L15-->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]" "[75] L27-->L29: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[105] L16-->$Ultimate##0: 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]" "[77] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[84] L47-->L51: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[86] L51-->thread3FINAL: Formula: (= v_g_1 (+ v_g_2 1)) InVars {g=v_g_2} OutVars{g=v_g_1} AuxVars[] AssignedVars[g]" "[89] $Ultimate##0-->L58-1: Formula: (< 0 v_g_4) InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" [2025-04-26 16:58:56,329 INFO L754 eck$LassoCheckResult]: Loop: "[91] L58-1-->L60: Formula: (< v_y2_1 v_x2_5) InVars {y2=v_y2_1, x2=v_x2_5} OutVars{y2=v_y2_1, x2=v_x2_5} AuxVars[] AssignedVars[]" "[93] L60-->L58-1: Formula: (= v_x2_7 (+ v_x2_6 1)) InVars {x2=v_x2_7} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[x2]" [2025-04-26 16:58:56,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash -674777432, now seen corresponding path program 1 times [2025-04-26 16:58:56,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096042566] [2025-04-26 16:58:56,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:56,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:56,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,337 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:56,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:56,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:56,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:56,344 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,346 INFO L85 PathProgramCache]: Analyzing trace with hash 3875, now seen corresponding path program 1 times [2025-04-26 16:58:56,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522892750] [2025-04-26 16:58:56,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:56,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:56,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,348 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:56,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:56,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:56,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,352 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:56,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,352 INFO L85 PathProgramCache]: Analyzing trace with hash 78952458, now seen corresponding path program 1 times [2025-04-26 16:58:56,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88592820] [2025-04-26 16:58:56,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:56,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:56,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,357 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:56,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:58:56,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:58:56,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:56,373 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:56,373 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:56,373 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:56,373 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:56,373 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:56,373 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,373 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:56,373 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:56,373 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:58:56,373 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:56,373 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:56,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,390 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:56,390 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:56,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,392 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:56,393 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:56,394 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:56,394 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,410 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:56,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,412 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:56,413 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:56,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:56,416 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,483 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:56,487 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:56,488 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:56,488 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:56,488 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:56,488 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:56,488 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:56,488 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,488 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:56,488 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:56,488 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:58:56,488 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:56,488 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:56,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,504 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:56,504 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:56,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,506 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:56,508 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:56,510 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:56,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:56,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:56,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:56,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:56,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:56,521 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:56,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:56,523 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:56,525 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:56,525 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:56,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,527 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:56,528 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:56,531 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:56,533 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:56,534 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:56,534 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:56,534 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:56,534 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y2, x2) = -1*y2 + 1*x2 Supporting invariants [] [2025-04-26 16:58:56,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:58:56,540 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:56,550 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:56,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:56,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:56,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:56,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:56,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,574 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:56,587 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:56,587 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:56,588 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 499 states and 1112 transitions. cyclomatic complexity: 693 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:56,632 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 499 states and 1112 transitions. cyclomatic complexity: 693. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1393 states and 3127 transitions. Complement of second has 7 states. [2025-04-26 16:58:56,632 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:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-04-26 16:58:56,633 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:58:56,633 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,633 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:58:56,633 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,633 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 75 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:58:56,633 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1393 states and 3127 transitions. [2025-04-26 16:58:56,639 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 66 [2025-04-26 16:58:56,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1393 states to 770 states and 1722 transitions. [2025-04-26 16:58:56,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2025-04-26 16:58:56,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 329 [2025-04-26 16:58:56,644 INFO L74 IsDeterministic]: Start isDeterministic. Operand 770 states and 1722 transitions. [2025-04-26 16:58:56,644 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:56,644 INFO L218 hiAutomatonCegarLoop]: Abstraction has 770 states and 1722 transitions. [2025-04-26 16:58:56,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states and 1722 transitions. [2025-04-26 16:58:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 671. [2025-04-26 16:58:56,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 671 states have (on average 2.217585692995529) internal successors, (in total 1488), 670 states have internal predecessors, (1488), 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:56,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 1488 transitions. [2025-04-26 16:58:56,653 INFO L240 hiAutomatonCegarLoop]: Abstraction has 671 states and 1488 transitions. [2025-04-26 16:58:56,653 INFO L438 stractBuchiCegarLoop]: Abstraction has 671 states and 1488 transitions. [2025-04-26 16:58:56,653 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:58:56,653 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 671 states and 1488 transitions. [2025-04-26 16:58:56,655 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 66 [2025-04-26 16:58:56,655 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:56,655 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:56,656 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:56,656 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:56,656 INFO L752 eck$LassoCheckResult]: Stem: "[68] $Ultimate##0-->L14: Formula: (and (= v_f_4 0) (= v_g_3 0)) InVars {g=v_g_3, f=v_f_4} OutVars{g=v_g_3, f=v_f_4} AuxVars[] AssignedVars[]" "[96] L14-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L14-1-->$Ultimate##0: 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]" "[102] L15-->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]" "[75] L27-->L29: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[105] L16-->$Ultimate##0: 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]" "[77] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" "[89] $Ultimate##0-->L58-1: Formula: (< 0 v_g_4) InVars {g=v_g_4} OutVars{g=v_g_4} AuxVars[] AssignedVars[]" "[75] L27-->L29: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[90] L58-1-->thread4FINAL: Formula: (<= v_x2_8 v_y2_2) InVars {y2=v_y2_2, x2=v_x2_8} OutVars{y2=v_y2_2, x2=v_x2_8} AuxVars[] AssignedVars[]" [2025-04-26 16:58:56,656 INFO L754 eck$LassoCheckResult]: Loop: "[85] L47-->L49: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[87] L49-->L47: 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:56,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,656 INFO L85 PathProgramCache]: Analyzing trace with hash -674772967, now seen corresponding path program 1 times [2025-04-26 16:58:56,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155566120] [2025-04-26 16:58:56,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:56,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:56,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,680 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:56,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:56,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155566120] [2025-04-26 16:58:56,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155566120] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:56,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:56,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:58:56,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850857345] [2025-04-26 16:58:56,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:56,681 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:58:56,681 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,681 INFO L85 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 2 times [2025-04-26 16:58:56,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865683149] [2025-04-26 16:58:56,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:58:56,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:56,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:56,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:58:56,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,685 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:56,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:56,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:56,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:56,699 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:56,699 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:56,699 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:56,699 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:56,699 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:56,699 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,699 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:56,699 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:56,699 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:58:56,699 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:56,699 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:56,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,714 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:56,714 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:56,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,716 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:56,718 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:56,719 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:56,719 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,737 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:56,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,739 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:56,741 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:56,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:56,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,810 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:56,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:56,815 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:56,815 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:56,815 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:56,815 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:56,815 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:56,815 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,815 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:56,815 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:56,815 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:58:56,815 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:56,815 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:56,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,837 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:56,837 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:56,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,841 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:56,842 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:56,844 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:56,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:56,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:56,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:56,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:56,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:56,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:56,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:56,856 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:56,863 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:56,863 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:56,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,865 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:56,865 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:56,868 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:56,870 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:56,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:58:56,871 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:56,871 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:56,871 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 16:58:56,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:58:56,880 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:56,895 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:58:56,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:58:56,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:56,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:56,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:56,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,915 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:56,927 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:56,927 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:56,928 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 671 states and 1488 transitions. cyclomatic complexity: 919 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:56,955 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 671 states and 1488 transitions. cyclomatic complexity: 919. 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 929 states and 2038 transitions. Complement of second has 6 states. [2025-04-26 16:58:56,956 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:56,956 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:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-04-26 16:58:56,956 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:58:56,956 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,956 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:58:56,956 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,956 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 62 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:58:56,956 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:56,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 929 states and 2038 transitions. [2025-04-26 16:58:56,961 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 42 [2025-04-26 16:58:56,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 929 states to 590 states and 1282 transitions. [2025-04-26 16:58:56,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 252 [2025-04-26 16:58:56,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 252 [2025-04-26 16:58:56,965 INFO L74 IsDeterministic]: Start isDeterministic. Operand 590 states and 1282 transitions. [2025-04-26 16:58:56,965 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:56,965 INFO L218 hiAutomatonCegarLoop]: Abstraction has 590 states and 1282 transitions. [2025-04-26 16:58:56,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 1282 transitions. [2025-04-26 16:58:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2025-04-26 16:58:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 590 states have (on average 2.1728813559322036) internal successors, (in total 1282), 589 states have internal predecessors, (1282), 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:56,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 1282 transitions. [2025-04-26 16:58:56,974 INFO L240 hiAutomatonCegarLoop]: Abstraction has 590 states and 1282 transitions. [2025-04-26 16:58:56,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:56,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:56,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:56,975 INFO L87 Difference]: Start difference. First operand 590 states and 1282 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:56,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:56,981 INFO L93 Difference]: Finished difference Result 120 states and 229 transitions. [2025-04-26 16:58:56,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 229 transitions. [2025-04-26 16:58:56,982 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:56,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 0 states and 0 transitions. [2025-04-26 16:58:56,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:58:56,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:58:56,982 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:58:56,982 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:58:56,983 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:56,983 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:56,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:58:56,983 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:56,983 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:58:56,983 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:58:56,983 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:56,983 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:58:56,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:58:56,997 INFO L201 PluginConnector]: Adding new model me1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:58:56 BoogieIcfgContainer [2025-04-26 16:58:56,997 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:58:56,998 INFO L158 Benchmark]: Toolchain (without parser) took 3662.32ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 83.6MB in the beginning and 36.5MB in the end (delta: 47.2MB). Peak memory consumption was 32.9MB. Max. memory is 8.0GB. [2025-04-26 16:58:56,998 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:56,998 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.62ms. Allocated memory is still 155.2MB. Free memory was 83.6MB in the beginning and 81.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:56,999 INFO L158 Benchmark]: Boogie Preprocessor took 19.72ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 80.5MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:58:56,999 INFO L158 Benchmark]: RCFGBuilder took 185.64ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 71.3MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:58:56,999 INFO L158 Benchmark]: BuchiAutomizer took 3415.22ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.3MB in the beginning and 36.5MB in the end (delta: 34.9MB). Peak memory consumption was 20.3MB. Max. memory is 8.0GB. [2025-04-26 16:58:57,000 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.13ms. Allocated memory is still 155.2MB. Free memory is still 84.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.62ms. Allocated memory is still 155.2MB. Free memory was 83.6MB in the beginning and 81.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 19.72ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 80.5MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 185.64ms. Allocated memory is still 155.2MB. Free memory was 80.5MB in the beginning and 71.3MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3415.22ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.3MB in the beginning and 36.5MB in the end (delta: 34.9MB). Peak memory consumption was 20.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 1.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 1909 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 346 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 340 mSDsluCounter, 435 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 195 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 263 IncrementalHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 240 mSDtfsCounter, 263 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 61ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 433, Number of transitions in reduction automaton: 1657, Number of states in reduction automaton: 769, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (2 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * y1 + x1 and consists of 4 locations. One deterministic module has affine ranking function -1 * x1 + z1 and consists of 4 locations. One deterministic module has affine ranking function z2 + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * y2 + x2 and consists of 4 locations. One deterministic module has affine ranking function z2 + -1 * x2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 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:57,015 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...