/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-5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:58:52,413 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:58:52,470 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:58:52,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:58:52,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:58:52,473 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:52,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:58:52,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:58:52,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:58:52,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:58:52,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:58:52,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:58:52,500 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:58:52,501 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:58:52,501 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:58:52,501 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:58:52,501 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:58:52,501 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:58:52,502 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:58:52,502 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:58:52,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:58:52,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:58:52,502 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:58:52,502 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:58:52,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:58:52,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:58:52,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:58:52,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:58:52,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:58:52,502 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:58:52,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:58:52,503 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:58:52,503 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:58:52,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:58:52,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:58:52,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:52,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:58:52,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:58:52,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:58:52,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:58:52,503 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:58:52,503 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:58:52,503 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:58:52,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:58:52,747 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:58:52,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:58:52,750 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:58:52,750 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:58:52,752 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/me1-5.c.bpl [2025-04-26 16:58:52,752 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/me1-5.c.bpl' [2025-04-26 16:58:52,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:58:52,773 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:58:52,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:52,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:58:52,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:58:52,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,802 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:58:52,803 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:58:52,804 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:58:52,804 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:58:52,804 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:58:52,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,811 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,815 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:58:52,822 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:58:52,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:58:52,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:58:52,823 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/1) ... [2025-04-26 16:58:52,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:58:52,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:52,846 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:52,850 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:52,868 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:58:52,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:58:52,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:58:52,869 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:58:52,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:58:52,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:58:52,869 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:58:52,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:58:52,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:58:52,869 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:58:52,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:58:52,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:58:52,870 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:58:52,870 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:58:52,870 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:58:52,870 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:58:52,870 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:58:52,870 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:58:52,870 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:52,905 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:58:52,906 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:58:52,991 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:58:52,992 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:58:52,999 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:58:52,999 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:58:52,999 INFO L201 PluginConnector]: Adding new model me1-5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:52 BoogieIcfgContainer [2025-04-26 16:58:52,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:58:53,000 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:58:53,000 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:58:53,004 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:58:53,005 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:53,005 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:58:52" (1/2) ... [2025-04-26 16:58:53,006 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5feac13e and model type me1-5.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,006 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:58:53,006 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:58:52" (2/2) ... [2025-04-26 16:58:53,007 INFO L376 chiAutomizerObserver]: Analyzing ICFG me1-5.c.bpl [2025-04-26 16:58:53,068 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 16:58:53,108 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:58:53,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:58:53,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:53,111 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,113 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,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 127 flow [2025-04-26 16:58:53,190 INFO L116 PetriNetUnfolderBase]: 5/36 cut-off events. [2025-04-26 16:58:53,191 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 16:58:53,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 36 events. 5/36 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-04-26 16:58:53,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 46 transitions, 127 flow [2025-04-26 16:58:53,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 36 transitions, 102 flow [2025-04-26 16:58:53,197 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 47 places, 36 transitions, 102 flow [2025-04-26 16:58:53,202 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:58:53,952 WARN L140 AmpleReduction]: Number of pruned transitions: 7856 [2025-04-26 16:58:53,953 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:58:53,953 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1178 [2025-04-26 16:58:53,953 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:45 [2025-04-26 16:58:53,954 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:2153 [2025-04-26 16:58:53,954 WARN L145 AmpleReduction]: Times succ was already a loop node:2767 [2025-04-26 16:58:53,954 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:551 [2025-04-26 16:58:53,954 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:58:53,970 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 3377 states, 3376 states have (on average 2.6522511848341233) internal successors, (in total 8954), 3376 states have internal predecessors, (8954), 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:53,977 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:58:53,977 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:58:53,977 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:58:53,977 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:58:53,977 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:58:53,977 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:58:53,977 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:58:53,977 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:58:53,986 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3377 states, 3376 states have (on average 2.6522511848341233) internal successors, (in total 8954), 3376 states have internal predecessors, (8954), 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,072 INFO L131 ngComponentsAnalysis]: Automaton has 594 accepting balls. 2382 [2025-04-26 16:58:54,072 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:54,072 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:54,075 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:54,075 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:54,075 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:58:54,082 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3377 states, 3376 states have (on average 2.6522511848341233) internal successors, (in total 8954), 3376 states have internal predecessors, (8954), 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,127 INFO L131 ngComponentsAnalysis]: Automaton has 594 accepting balls. 2382 [2025-04-26 16:58:54,128 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:54,128 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:54,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:58:54,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:54,134 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:58:54,134 INFO L754 eck$LassoCheckResult]: Loop: "[90] L33-->L35: 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[]" "[92] L35-->L33: 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,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:54,138 INFO L85 PathProgramCache]: Analyzing trace with hash 3680, now seen corresponding path program 1 times [2025-04-26 16:58:54,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:54,143 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775580391] [2025-04-26 16:58:54,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:54,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:54,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:54,198 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,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,199 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:54,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:54,205 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,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:54,222 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:54,222 INFO L85 PathProgramCache]: Analyzing trace with hash 3843, now seen corresponding path program 1 times [2025-04-26 16:58:54,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:54,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563101331] [2025-04-26 16:58:54,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:54,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:54,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:54,233 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,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,233 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:54,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:54,235 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,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:54,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:54,244 INFO L85 PathProgramCache]: Analyzing trace with hash 3539362, now seen corresponding path program 1 times [2025-04-26 16:58:54,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:54,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049655977] [2025-04-26 16:58:54,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:54,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:54,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:54,249 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,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,249 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:54,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:58:54,260 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,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:54,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:54,340 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:54,341 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:54,341 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:54,341 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:54,341 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:54,342 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,342 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:54,342 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:54,342 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:54,342 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:54,342 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:54,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:54,421 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:54,422 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:54,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:54,426 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,428 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,429 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:54,429 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:54,449 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,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:54,453 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,454 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,456 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:54,456 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:54,528 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:54,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:54,533 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:54,533 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:54,533 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:54,533 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:54,533 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:54,533 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,533 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:54,533 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:54,533 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:58:54,533 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:54,533 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:54,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:54,560 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:54,562 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:54,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:54,566 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,571 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,573 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,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:54,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:54,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:54,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:54,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:54,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:54,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:54,596 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:54,601 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:54,601 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:54,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:54,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:54,605 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,607 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,607 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:54,610 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:54,611 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,612 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:54,612 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:54,612 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-04-26 16:58:54,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:54,620 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:54,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:54,659 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,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:54,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:54,676 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,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:54,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:54,677 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:54,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:54,695 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,715 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,722 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 3377 states, 3376 states have (on average 2.6522511848341233) internal successors, (in total 8954), 3376 states have internal predecessors, (8954), 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,968 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 3377 states, 3376 states have (on average 2.6522511848341233) internal successors, (in total 8954), 3376 states have internal predecessors, (8954), 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 8395 states and 22791 transitions. Complement of second has 6 states. [2025-04-26 16:58:54,970 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,973 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,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-04-26 16:58:54,977 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:58:54,979 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:54,979 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:58:54,979 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:54,979 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:58:54,980 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:54,980 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8395 states and 22791 transitions. [2025-04-26 16:58:55,061 INFO L131 ngComponentsAnalysis]: Automaton has 323 accepting balls. 1036 [2025-04-26 16:58:55,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8395 states to 4747 states and 12671 transitions. [2025-04-26 16:58:55,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1914 [2025-04-26 16:58:55,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2993 [2025-04-26 16:58:55,146 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4747 states and 12671 transitions. [2025-04-26 16:58:55,146 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:55,146 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4747 states and 12671 transitions. [2025-04-26 16:58:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4747 states and 12671 transitions. [2025-04-26 16:58:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4747 to 4022. [2025-04-26 16:58:55,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4022 states, 4022 states have (on average 2.798607657881651) internal successors, (in total 11256), 4021 states have internal predecessors, (11256), 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,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 11256 transitions. [2025-04-26 16:58:55,293 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4022 states and 11256 transitions. [2025-04-26 16:58:55,293 INFO L438 stractBuchiCegarLoop]: Abstraction has 4022 states and 11256 transitions. [2025-04-26 16:58:55,293 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:58:55,293 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4022 states and 11256 transitions. [2025-04-26 16:58:55,312 INFO L131 ngComponentsAnalysis]: Automaton has 323 accepting balls. 1036 [2025-04-26 16:58:55,312 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:55,312 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:55,313 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:58:55,313 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:55,314 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[89] L33-->thread1FINAL: 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[]" "[91] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[118] L18-1-->L42: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:58:55,314 INFO L754 eck$LassoCheckResult]: Loop: "[94] L42-->L44: 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[]" "[96] L44-->L42: 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,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,315 INFO L85 PathProgramCache]: Analyzing trace with hash 109719348, now seen corresponding path program 1 times [2025-04-26 16:58:55,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90654276] [2025-04-26 16:58:55,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:55,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:55,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,320 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:55,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:55,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,325 INFO L85 PathProgramCache]: Analyzing trace with hash 3971, now seen corresponding path program 1 times [2025-04-26 16:58:55,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110496270] [2025-04-26 16:58:55,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,330 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,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,331 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,332 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,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1933885962, now seen corresponding path program 1 times [2025-04-26 16:58:55,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:55,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013663103] [2025-04-26 16:58:55,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:55,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:55,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:55,342 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,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:55,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:58:55,348 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,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:55,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:55,369 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:55,370 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:55,370 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:55,370 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:55,371 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:55,371 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,371 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:55,371 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:55,371 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:55,371 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:55,371 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:55,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:55,396 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:55,397 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:55,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,399 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,400 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,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:55,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:55,418 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,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,422 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,423 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,424 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:55,424 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:55,493 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:55,498 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,498 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:55,498 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:55,498 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:55,498 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:55,498 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:55,498 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,498 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:55,498 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:55,498 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:58:55,498 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:55,498 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:55,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:55,518 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:55,518 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:55,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,520 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,522 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,524 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,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:55,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:55,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:55,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:55,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:55,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:55,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:55,541 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:55,545 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:55,545 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:55,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:55,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:55,547 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,548 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,550 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:55,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:55,554 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:55,554 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:55,554 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 16:58:55,560 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,561 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:55,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:55,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:58:55,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:58:55,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:55,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:55,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:55,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:55,591 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,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:55,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:55,591 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:55,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:55,604 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,604 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,605 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4022 states and 11256 transitions. cyclomatic complexity: 7792 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:55,804 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4022 states and 11256 transitions. cyclomatic complexity: 7792. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 13164 states and 35681 transitions. Complement of second has 7 states. [2025-04-26 16:58:55,805 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,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-04-26 16:58:55,805 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:58:55,805 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,805 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:58:55,805 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,806 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:58:55,806 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:55,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13164 states and 35681 transitions. [2025-04-26 16:58:55,955 INFO L131 ngComponentsAnalysis]: Automaton has 440 accepting balls. 1238 [2025-04-26 16:58:56,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13164 states to 9640 states and 26368 transitions. [2025-04-26 16:58:56,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4391 [2025-04-26 16:58:56,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4837 [2025-04-26 16:58:56,091 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9640 states and 26368 transitions. [2025-04-26 16:58:56,091 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:56,091 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9640 states and 26368 transitions. [2025-04-26 16:58:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9640 states and 26368 transitions. [2025-04-26 16:58:56,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9640 to 7229. [2025-04-26 16:58:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7229 states, 7229 states have (on average 2.781989210125882) internal successors, (in total 20111), 7228 states have internal predecessors, (20111), 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,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7229 states to 7229 states and 20111 transitions. [2025-04-26 16:58:56,402 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7229 states and 20111 transitions. [2025-04-26 16:58:56,402 INFO L438 stractBuchiCegarLoop]: Abstraction has 7229 states and 20111 transitions. [2025-04-26 16:58:56,402 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:58:56,402 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7229 states and 20111 transitions. [2025-04-26 16:58:56,441 INFO L131 ngComponentsAnalysis]: Automaton has 376 accepting balls. 1108 [2025-04-26 16:58:56,441 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:56,441 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:56,441 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:56,441 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:56,442 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[89] L33-->thread1FINAL: 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[]" "[91] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[118] L18-1-->L42: 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]" "[121] L19-->$Ultimate##0: 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]" "[98] $Ultimate##0-->L53-1: Formula: (< 0 v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" "[100] L53-1-->L55: 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[]" "[102] L55-->L53-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,442 INFO L754 eck$LassoCheckResult]: Loop: "[100] L53-1-->L55: 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[]" "[102] L55-->L53-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,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1257239167, now seen corresponding path program 1 times [2025-04-26 16:58:56,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642388837] [2025-04-26 16:58:56,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:56,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:56,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,491 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,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:56,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642388837] [2025-04-26 16:58:56,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642388837] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:56,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:56,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:58:56,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754502546] [2025-04-26 16:58:56,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:56,500 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:58:56,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,501 INFO L85 PathProgramCache]: Analyzing trace with hash 4163, now seen corresponding path program 1 times [2025-04-26 16:58:56,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:56,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020462662] [2025-04-26 16:58:56,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:56,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:56,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:56,506 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,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,506 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:56,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:56,508 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,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:56,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:56,523 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:56,524 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:56,524 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:56,524 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:56,524 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:56,524 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,524 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:56,524 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:56,524 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:56,524 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:56,524 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:56,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,540 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:56,540 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:56,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,542 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:56,544 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:56,545 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:56,546 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,563 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:56,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,565 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:56,566 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:56,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:56,568 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:56,640 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:56,645 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:56,645 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:56,645 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:56,645 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:56,645 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:56,645 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:56,645 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,645 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:56,645 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:56,645 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:58:56,646 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:56,646 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:56,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:56,665 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:56,665 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:56,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,667 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:56,669 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:56,671 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,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:56,681 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:56,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:56,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:56,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:56,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:56,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:56,685 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:56,690 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:56,690 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:56,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:56,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:56,692 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:56,694 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:56,695 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:56,698 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:58:56,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:56,699 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:56,699 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:56,699 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y2, x2) = -1*y2 + 1*x2 Supporting invariants [] [2025-04-26 16:58:56,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:56,706 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:56,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:56,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:58:56,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:58:56,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:56,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:56,744 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,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:56,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:56,744 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:56,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:56,757 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,757 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,758 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7229 states and 20111 transitions. cyclomatic complexity: 13822 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:57,006 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7229 states and 20111 transitions. cyclomatic complexity: 13822. 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 17902 states and 49798 transitions. Complement of second has 7 states. [2025-04-26 16:58:57,006 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:57,007 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:57,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-04-26 16:58:57,008 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:58:57,008 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:57,008 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:58:57,008 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:57,008 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:58:57,008 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:57,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17902 states and 49798 transitions. [2025-04-26 16:58:57,145 INFO L131 ngComponentsAnalysis]: Automaton has 552 accepting balls. 1464 [2025-04-26 16:58:57,308 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17902 states to 14471 states and 39891 transitions. [2025-04-26 16:58:57,308 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6461 [2025-04-26 16:58:57,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6878 [2025-04-26 16:58:57,323 INFO L74 IsDeterministic]: Start isDeterministic. Operand 14471 states and 39891 transitions. [2025-04-26 16:58:57,323 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:57,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14471 states and 39891 transitions. [2025-04-26 16:58:57,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states and 39891 transitions. [2025-04-26 16:58:57,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11545. [2025-04-26 16:58:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11545 states, 11545 states have (on average 2.840450411433521) internal successors, (in total 32793), 11544 states have internal predecessors, (32793), 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:57,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11545 states to 11545 states and 32793 transitions. [2025-04-26 16:58:57,665 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11545 states and 32793 transitions. [2025-04-26 16:58:57,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:57,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:57,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:57,669 INFO L87 Difference]: Start difference. First operand 11545 states and 32793 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 2 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:57,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:57,708 INFO L93 Difference]: Finished difference Result 3508 states and 9447 transitions. [2025-04-26 16:58:57,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3508 states and 9447 transitions. [2025-04-26 16:58:57,724 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 178 [2025-04-26 16:58:57,738 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3508 states to 3296 states and 8965 transitions. [2025-04-26 16:58:57,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1476 [2025-04-26 16:58:57,741 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1476 [2025-04-26 16:58:57,741 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3296 states and 8965 transitions. [2025-04-26 16:58:57,741 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:57,741 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3296 states and 8965 transitions. [2025-04-26 16:58:57,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3296 states and 8965 transitions. [2025-04-26 16:58:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3296 to 3291. [2025-04-26 16:58:57,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3291 states, 3291 states have (on average 2.7225767243998784) internal successors, (in total 8960), 3290 states have internal predecessors, (8960), 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:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 8960 transitions. [2025-04-26 16:58:57,794 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3291 states and 8960 transitions. [2025-04-26 16:58:57,795 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:58:57,795 INFO L438 stractBuchiCegarLoop]: Abstraction has 3291 states and 8960 transitions. [2025-04-26 16:58:57,795 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:58:57,795 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3291 states and 8960 transitions. [2025-04-26 16:58:57,805 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 178 [2025-04-26 16:58:57,805 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:57,805 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:57,806 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:57,806 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:57,806 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[89] L33-->thread1FINAL: 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[]" "[91] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[118] L18-1-->L42: 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]" "[121] L19-->$Ultimate##0: 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]" "[124] L20-->L62: 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]" "[93] L42-->L46: 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[]" "[95] L46-->thread2FINAL: Formula: (= v_g_1 (+ v_g_2 1)) InVars {g=v_g_2} OutVars{g=v_g_1} AuxVars[] AssignedVars[g]" "[98] $Ultimate##0-->L53-1: Formula: (< 0 v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" "[97] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[99] L53-1-->thread3FINAL: 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[]" "[101] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:58:57,806 INFO L754 eck$LassoCheckResult]: Loop: "[104] L62-->L64: Formula: (< v_x3_1 v_z3_1) InVars {z3=v_z3_1, x3=v_x3_1} OutVars{z3=v_z3_1, x3=v_x3_1} AuxVars[] AssignedVars[]" "[106] L64-->L62: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:58:57,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:57,807 INFO L85 PathProgramCache]: Analyzing trace with hash -404745318, now seen corresponding path program 1 times [2025-04-26 16:58:57,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:57,807 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922143832] [2025-04-26 16:58:57,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:57,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:57,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:58:57,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:58:57,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,813 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:57,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:58:57,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:58:57,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:57,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:57,827 INFO L85 PathProgramCache]: Analyzing trace with hash 4291, now seen corresponding path program 1 times [2025-04-26 16:58:57,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:57,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425471114] [2025-04-26 16:58:57,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:57,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:57,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:57,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:57,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,832 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:57,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:57,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:57,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:57,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:57,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1881776668, now seen corresponding path program 1 times [2025-04-26 16:58:57,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:57,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633735488] [2025-04-26 16:58:57,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:57,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:57,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:58:57,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:58:57,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,843 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:57,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:58:57,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:58:57,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:57,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:57,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:57,900 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:57,900 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:57,900 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:57,900 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:57,900 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:57,900 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,900 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:57,900 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:57,900 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:57,900 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:57,900 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:57,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:57,924 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:57,924 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:57,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:57,926 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:57,928 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:57,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:57,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:57,961 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:57,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:57,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:57,967 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:57,972 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:57,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:57,973 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:58,059 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:58,063 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:58,064 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:58,064 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:58,064 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:58,064 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:58,064 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:58,064 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,064 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:58,064 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:58,064 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:58:58,064 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:58,064 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:58,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:58,112 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:58,112 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:58,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:58,117 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:58,124 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:58,125 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:58,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:58,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:58,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:58,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:58,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:58,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:58,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:58,138 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:58,141 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:58,142 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:58,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:58,143 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:58,147 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:58,147 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:58,152 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:58,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:58,153 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:58,153 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:58,153 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z3, x3) = 1*z3 - 1*x3 Supporting invariants [] [2025-04-26 16:58:58,163 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:58,164 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:58,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:58,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:58:58,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:58:58,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:58,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:58,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:58,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:58,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:58,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:58,225 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:58,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:58,236 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:58,237 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:58,237 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3291 states and 8960 transitions. cyclomatic complexity: 6066 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:58,294 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3291 states and 8960 transitions. cyclomatic complexity: 6066. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 4167 states and 10633 transitions. Complement of second has 7 states. [2025-04-26 16:58:58,295 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:58,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-04-26 16:58:58,295 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:58:58,295 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:58,295 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 16:58:58,295 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:58,295 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 16:58:58,296 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:58,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4167 states and 10633 transitions. [2025-04-26 16:58:58,311 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 174 [2025-04-26 16:58:58,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4167 states to 3785 states and 9807 transitions. [2025-04-26 16:58:58,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1665 [2025-04-26 16:58:58,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1720 [2025-04-26 16:58:58,326 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3785 states and 9807 transitions. [2025-04-26 16:58:58,326 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:58,326 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3785 states and 9807 transitions. [2025-04-26 16:58:58,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3785 states and 9807 transitions. [2025-04-26 16:58:58,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3785 to 3610. [2025-04-26 16:58:58,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3610 states, 3610 states have (on average 2.6329639889196677) internal successors, (in total 9505), 3609 states have internal predecessors, (9505), 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:58,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 9505 transitions. [2025-04-26 16:58:58,399 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3610 states and 9505 transitions. [2025-04-26 16:58:58,399 INFO L438 stractBuchiCegarLoop]: Abstraction has 3610 states and 9505 transitions. [2025-04-26 16:58:58,400 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:58:58,400 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3610 states and 9505 transitions. [2025-04-26 16:58:58,408 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 174 [2025-04-26 16:58:58,408 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:58,408 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:58,409 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:58,409 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:58,410 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[89] L33-->thread1FINAL: 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[]" "[91] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[118] L18-1-->L42: 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]" "[121] L19-->$Ultimate##0: 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]" "[124] L20-->L62: 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]" "[94] L42-->L44: 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[]" "[103] L62-->L66: Formula: (<= v_z3_2 v_x3_4) InVars {z3=v_z3_2, x3=v_x3_4} OutVars{z3=v_z3_2, x3=v_x3_4} AuxVars[] AssignedVars[]" "[105] L66-->thread4FINAL: Formula: (= v_h_2 (+ v_h_3 1)) InVars {h=v_h_3} OutVars{h=v_h_2} AuxVars[] AssignedVars[h]" "[107] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[96] L44-->L42: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[127] L21-->$Ultimate##0: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[108] $Ultimate##0-->L73-1: Formula: (< 0 v_h_4) InVars {h=v_h_4} OutVars{h=v_h_4} AuxVars[] AssignedVars[]" [2025-04-26 16:58:58,411 INFO L754 eck$LassoCheckResult]: Loop: "[110] L73-1-->L75: Formula: (< v_y3_1 v_x3_5) InVars {y3=v_y3_1, x3=v_x3_5} OutVars{y3=v_y3_1, x3=v_x3_5} AuxVars[] AssignedVars[]" "[112] L75-->L73-1: Formula: (= (+ v_x3_6 1) v_x3_7) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-04-26 16:58:58,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:58,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1461094507, now seen corresponding path program 1 times [2025-04-26 16:58:58,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:58,411 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943934759] [2025-04-26 16:58:58,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:58,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:58,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:58:58,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:58:58,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:58,421 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:58,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:58:58,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:58:58,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:58,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:58,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash 4483, now seen corresponding path program 1 times [2025-04-26 16:58:58,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:58,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349461898] [2025-04-26 16:58:58,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:58,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:58,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:58,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:58,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:58,434 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:58,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:58,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:58,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:58,437 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:58,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:58,437 INFO L85 PathProgramCache]: Analyzing trace with hash -342481043, now seen corresponding path program 1 times [2025-04-26 16:58:58,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:58,437 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788710405] [2025-04-26 16:58:58,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:58,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:58,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:58:58,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:58:58,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:58,444 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:58,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:58:58,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:58:58,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:58,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:58,470 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:58,470 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:58,470 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:58,470 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:58,470 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:58,470 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,470 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:58,470 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:58,470 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:58:58,470 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:58,470 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:58,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:58,484 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:58,484 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:58,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:58,505 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:58,507 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:58,508 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:58,508 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:58,524 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:58,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:58,526 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:58,529 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:58,529 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:58,529 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:58,601 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:58,605 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:58,606 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:58,606 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:58,606 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:58,606 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:58,606 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:58,606 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,606 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:58,606 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:58,606 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 16:58:58,606 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:58,606 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:58,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:58,625 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:58,626 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:58,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:58,628 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:58,629 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:58,630 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:58,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:58,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:58,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:58,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:58,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:58,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:58,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:58,643 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:58,647 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:58:58,647 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:58:58,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:58,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:58,649 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:58,651 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:58,652 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:58,654 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:58,655 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:58,655 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:58,655 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:58,655 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y3, x3) = -1*y3 + 1*x3 Supporting invariants [] [2025-04-26 16:58:58,661 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:58,661 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:58,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:58,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:58:58,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:58:58,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:58,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:58,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:58,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:58,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:58,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:58,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:58,702 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:58,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:58:58,712 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:58:58,713 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3610 states and 9505 transitions. cyclomatic complexity: 6332 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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:58,804 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3610 states and 9505 transitions. cyclomatic complexity: 6332. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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 9294 states and 24147 transitions. Complement of second has 7 states. [2025-04-26 16:58:58,805 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:58,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 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:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-04-26 16:58:58,806 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 16:58:58,806 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:58,806 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 16:58:58,806 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:58,806 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:58:58,806 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:58,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9294 states and 24147 transitions. [2025-04-26 16:58:58,899 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 174 [2025-04-26 16:58:58,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9294 states to 5359 states and 13822 transitions. [2025-04-26 16:58:58,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2134 [2025-04-26 16:58:58,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2169 [2025-04-26 16:58:58,930 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5359 states and 13822 transitions. [2025-04-26 16:58:58,930 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:58,930 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5359 states and 13822 transitions. [2025-04-26 16:58:58,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5359 states and 13822 transitions. [2025-04-26 16:58:58,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5359 to 4435. [2025-04-26 16:58:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4435 states, 4435 states have (on average 2.5970687711386695) internal successors, (in total 11518), 4434 states have internal predecessors, (11518), 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:59,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4435 states to 4435 states and 11518 transitions. [2025-04-26 16:58:59,012 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4435 states and 11518 transitions. [2025-04-26 16:58:59,012 INFO L438 stractBuchiCegarLoop]: Abstraction has 4435 states and 11518 transitions. [2025-04-26 16:58:59,012 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:58:59,012 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4435 states and 11518 transitions. [2025-04-26 16:58:59,028 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 174 [2025-04-26 16:58:59,029 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:58:59,029 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:58:59,029 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:58:59,029 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:58:59,030 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[89] L33-->thread1FINAL: 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[]" "[91] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[118] L18-1-->L42: 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]" "[121] L19-->$Ultimate##0: 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]" "[124] L20-->L62: 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]" "[94] L42-->L44: 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[]" "[127] L21-->$Ultimate##0: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[128] thread1EXIT-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" "[96] L44-->L42: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[108] $Ultimate##0-->L73-1: Formula: (< 0 v_h_4) InVars {h=v_h_4} OutVars{h=v_h_4} AuxVars[] AssignedVars[]" "[94] L42-->L44: 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[]" "[109] L73-1-->thread5FINAL: Formula: (<= v_x3_8 v_y3_2) InVars {y3=v_y3_2, x3=v_x3_8} OutVars{y3=v_y3_2, x3=v_x3_8} AuxVars[] AssignedVars[]" [2025-04-26 16:58:59,030 INFO L754 eck$LassoCheckResult]: Loop: "[104] L62-->L64: Formula: (< v_x3_1 v_z3_1) InVars {z3=v_z3_1, x3=v_x3_1} OutVars{z3=v_z3_1, x3=v_x3_1} AuxVars[] AssignedVars[]" "[106] L64-->L62: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 16:58:59,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:59,030 INFO L85 PathProgramCache]: Analyzing trace with hash -2125849373, now seen corresponding path program 1 times [2025-04-26 16:58:59,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:59,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086110750] [2025-04-26 16:58:59,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:58:59,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:59,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:58:59,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:58:59,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:59,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:59,052 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:59,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:58:59,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086110750] [2025-04-26 16:58:59,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086110750] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:58:59,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:58:59,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:58:59,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924574250] [2025-04-26 16:58:59,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:58:59,054 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:58:59,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:59,055 INFO L85 PathProgramCache]: Analyzing trace with hash 4291, now seen corresponding path program 2 times [2025-04-26 16:58:59,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:58:59,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039269815] [2025-04-26 16:58:59,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:58:59,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:58:59,057 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:59,058 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:59,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:58:59,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:59,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:58:59,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:59,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:59,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:59,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:58:59,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:58:59,077 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:59,077 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:59,077 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:59,077 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:59,077 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:58:59,077 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:59,077 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:59,077 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:59,077 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:58:59,077 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:59,078 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:59,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:59,095 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:59,095 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:58:59,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:59,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:59,098 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:59,099 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:59,100 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:58:59,100 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:59,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:58:59,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:59,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:59,120 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:59,122 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:59,126 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:58:59,126 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:58:59,189 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:58:59,194 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:59,194 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:58:59,194 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:58:59,194 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:58:59,194 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:58:59,194 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:58:59,194 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:59,194 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:58:59,194 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:58:59,194 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration6_Loop [2025-04-26 16:58:59,194 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:58:59,194 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:58:59,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:58:59,213 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:58:59,213 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:58:59,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:59,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:59,215 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:59,217 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:59,218 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:59,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:58:59,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:58:59,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:58:59,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:58:59,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:58:59,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:58:59,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:58:59,231 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:58:59,233 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:58:59,233 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:58:59,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:58:59,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:58:59,235 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:59,236 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:59,236 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:58:59,239 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:59,239 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:58:59,239 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:58:59,239 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z3, x3) = 1*z3 - 1*x3 Supporting invariants [] [2025-04-26 16:58:59,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:59,245 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:58:59,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:58:59,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:58:59,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:58:59,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:59,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:59,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:58:59,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:59,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:58:59,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:58:59,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:58:59,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:58:59,297 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:58:59,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:58:59,310 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:59,310 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:59,310 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4435 states and 11518 transitions. cyclomatic complexity: 7602 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:59,375 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4435 states and 11518 transitions. cyclomatic complexity: 7602. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 6186 states and 15888 transitions. Complement of second has 6 states. [2025-04-26 16:58:59,376 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:59,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:59,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-26 16:58:59,377 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 16:58:59,377 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:59,377 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 16:58:59,377 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:59,377 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:58:59,377 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:58:59,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6186 states and 15888 transitions. [2025-04-26 16:58:59,415 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 90 [2025-04-26 16:58:59,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6186 states to 3841 states and 9724 transitions. [2025-04-26 16:58:59,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1550 [2025-04-26 16:58:59,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1550 [2025-04-26 16:58:59,437 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3841 states and 9724 transitions. [2025-04-26 16:58:59,437 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:58:59,437 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3841 states and 9724 transitions. [2025-04-26 16:58:59,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states and 9724 transitions. [2025-04-26 16:58:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3840. [2025-04-26 16:58:59,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3840 states, 3840 states have (on average 2.53203125) internal successors, (in total 9723), 3839 states have internal predecessors, (9723), 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:59,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 9723 transitions. [2025-04-26 16:58:59,499 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3840 states and 9723 transitions. [2025-04-26 16:58:59,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:58:59,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:58:59,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:58:59,500 INFO L87 Difference]: Start difference. First operand 3840 states and 9723 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:58:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:58:59,511 INFO L93 Difference]: Finished difference Result 789 states and 1799 transitions. [2025-04-26 16:58:59,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 789 states and 1799 transitions. [2025-04-26 16:58:59,514 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:59,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 789 states to 0 states and 0 transitions. [2025-04-26 16:58:59,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:58:59,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:58:59,514 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:58:59,514 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:58:59,514 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:59,514 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:59,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:58:59,515 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:58:59,515 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:58:59,515 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:58:59,515 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:58:59,515 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:58:59,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:58:59,527 INFO L201 PluginConnector]: Adding new model me1-5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:58:59 BoogieIcfgContainer [2025-04-26 16:58:59,527 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:58:59,528 INFO L158 Benchmark]: Toolchain (without parser) took 6755.36ms. Allocated memory was 159.4MB in the beginning and 792.7MB in the end (delta: 633.3MB). Free memory was 86.0MB in the beginning and 411.5MB in the end (delta: -325.4MB). Peak memory consumption was 308.1MB. Max. memory is 8.0GB. [2025-04-26 16:58:59,528 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.81ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 86.8MB in the end (delta: 199.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:59,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.68ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:58:59,528 INFO L158 Benchmark]: Boogie Preprocessor took 17.76ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 82.9MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:58:59,528 INFO L158 Benchmark]: RCFGBuilder took 177.37ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 73.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:58:59,529 INFO L158 Benchmark]: BuchiAutomizer took 6526.77ms. Allocated memory was 159.4MB in the beginning and 792.7MB in the end (delta: 633.3MB). Free memory was 73.3MB in the beginning and 411.5MB in the end (delta: -338.1MB). Peak memory consumption was 295.5MB. Max. memory is 8.0GB. [2025-04-26 16:58:59,529 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.81ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 86.8MB in the end (delta: 199.2kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.68ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 17.76ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 82.9MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 177.37ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 73.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 6526.77ms. Allocated memory was 159.4MB in the beginning and 792.7MB in the end (delta: 633.3MB). Free memory was 73.3MB in the beginning and 411.5MB in the end (delta: -338.1MB). Peak memory consumption was 295.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 1.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 1.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 7167 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.9s 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, 432 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 426 mSDsluCounter, 612 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 293 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 314 IncrementalHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 319 mSDtfsCounter, 314 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: 49ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.8s InitialAbstraction: Time to compute Ample Reduction [ms]: 851, Number of transitions in reduction automaton: 8954, Number of states in reduction automaton: 3377, 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 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 -1 * x3 + z3 and consists of 4 locations. One deterministic module has affine ranking function x3 + -1 * y3 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z3 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:59,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...