/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/3_thr/me1-3.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:57:02,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:57:02,086 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:57:02,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:57:02,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:57:02,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:57:02,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:57:02,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:57:02,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:57:02,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:57:02,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:57:02,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:57:02,111 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:57:02,112 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:57:02,112 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:57:02,112 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:57:02,112 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:57:02,112 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:57:02,112 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:57:02,113 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:57:02,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:57:02,113 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:57:02,113 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:57:02,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:57:02,113 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:57:02,113 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:57:02,113 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:57:02,113 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:57:02,113 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:57:02,113 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:57:02,113 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:57:02,113 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:57:02,113 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:57:02,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:57:02,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:57:02,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:57:02,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:57:02,114 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:57:02,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:57:02,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:57:02,114 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:57:02,114 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:57:02,114 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:57:02,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:57:02,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:57:02,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:57:02,328 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:57:02,328 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:57:02,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/me1-3.c.bpl [2025-04-26 16:57:02,330 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/me1-3.c.bpl' [2025-04-26 16:57:02,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:57:02,347 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:57:02,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:57:02,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:57:02,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:57:02,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "me1-3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "me1-3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,377 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:57:02,379 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:57:02,379 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:57:02,379 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:57:02,379 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:57:02,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "me1-3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "me1-3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "me1-3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "me1-3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,387 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "me1-3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,388 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "me1-3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "me1-3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "me1-3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "me1-3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:57:02,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:57:02,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:57:02,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:57:02,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "me1-3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/1) ... [2025-04-26 16:57:02,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:57:02,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,427 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:02,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:57:02,451 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:57:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:57:02,451 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:57:02,451 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:57:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:57:02,451 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:57:02,451 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:57:02,451 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:57:02,451 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:57:02,451 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:57:02,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:57:02,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:57:02,452 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:57:02,488 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:57:02,490 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:57:02,553 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:57:02,553 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:57:02,561 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:57:02,561 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:57:02,563 INFO L201 PluginConnector]: Adding new model me1-3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:57:02 BoogieIcfgContainer [2025-04-26 16:57:02,563 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:57:02,564 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:57:02,564 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:57:02,568 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:57:02,568 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:57:02,568 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1-3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:57:02" (1/2) ... [2025-04-26 16:57:02,570 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16566dac and model type me1-3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:57:02, skipping insertion in model container [2025-04-26 16:57:02,570 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:57:02,570 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1-3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:57:02" (2/2) ... [2025-04-26 16:57:02,571 INFO L376 chiAutomizerObserver]: Analyzing ICFG me1-3.c.bpl [2025-04-26 16:57:02,623 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:57:02,667 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:57:02,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:57:02,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:02,673 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:02,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:57:02,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 16:57:02,750 INFO L116 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-04-26 16:57:02,752 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:57:02,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-04-26 16:57:02,757 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 16:57:02,760 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2025-04-26 16:57:02,760 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 22 transitions, 62 flow [2025-04-26 16:57:02,766 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:57:02,903 WARN L140 AmpleReduction]: Number of pruned transitions: 156 [2025-04-26 16:57:02,904 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:57:02,904 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 39 [2025-04-26 16:57:02,904 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:26 [2025-04-26 16:57:02,904 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:83 [2025-04-26 16:57:02,905 WARN L145 AmpleReduction]: Times succ was already a loop node:70 [2025-04-26 16:57:02,906 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:5 [2025-04-26 16:57:02,906 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:57:02,908 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 149 states, 148 states have (on average 1.8716216216216217) internal successors, (in total 277), 148 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:02,913 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:57:02,914 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:57:02,914 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:57:02,914 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:57:02,914 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:57:02,914 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:57:02,914 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:57:02,914 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:57:02,915 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 149 states, 148 states have (on average 1.8716216216216217) internal successors, (in total 277), 148 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:02,933 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 92 [2025-04-26 16:57:02,933 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:02,933 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:02,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:57:02,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:02,936 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:57:02,936 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 149 states, 148 states have (on average 1.8716216216216217) internal successors, (in total 277), 148 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:02,941 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 92 [2025-04-26 16:57:02,942 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:02,942 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:02,942 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:57:02,942 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:02,945 INFO L752 eck$LassoCheckResult]: Stem: "[49] $Ultimate##0-->L16: Formula: (and (= v_g_4 0) (= v_f_1 0)) InVars {g=v_g_4, f=v_f_1} OutVars{g=v_g_4, f=v_f_1} AuxVars[] AssignedVars[]" "[70] L16-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:57:02,946 INFO L754 eck$LassoCheckResult]: Loop: "[55] L27-->L29: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[57] L29-->L27: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 16:57:02,949 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:02,949 INFO L85 PathProgramCache]: Analyzing trace with hash 2550, now seen corresponding path program 1 times [2025-04-26 16:57:02,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:02,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124072878] [2025-04-26 16:57:02,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:02,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:02,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:02,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:02,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:02,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:02,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:02,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:03,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2723, now seen corresponding path program 1 times [2025-04-26 16:57:03,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:03,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591181646] [2025-04-26 16:57:03,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:03,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:03,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:03,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,021 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:03,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2452312, now seen corresponding path program 1 times [2025-04-26 16:57:03,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:03,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014055222] [2025-04-26 16:57:03,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:03,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:03,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:03,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:03,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:03,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:57:03,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:57:03,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:03,090 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:03,091 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:03,091 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:03,091 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:03,091 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:03,091 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,091 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:03,091 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:03,091 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:57:03,091 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:03,091 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:03,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:03,153 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:03,154 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:03,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:03,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:57:03,161 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:03,161 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:03,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:57:03,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,183 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:03,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:57:03,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:03,186 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:03,253 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:03,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:57:03,258 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:03,258 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:03,258 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:03,258 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:03,258 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:03,258 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,258 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:03,258 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:03,258 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-3.c.bpl_petrified1_Iteration1_Loop [2025-04-26 16:57:03,261 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:03,261 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:03,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:03,290 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:03,303 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:03,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,308 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:03,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:57:03,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:03,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:03,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:03,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:03,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:03,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:03,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:03,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:03,344 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:03,348 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:03,349 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:03,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,365 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:03,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:57:03,368 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:03,370 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:57:03,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:03,372 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:03,372 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:03,373 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-04-26 16:57:03,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:57:03,381 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:03,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:03,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:03,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:03,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:03,423 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:03,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:03,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:03,465 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:57:03,466 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 149 states, 148 states have (on average 1.8716216216216217) internal successors, (in total 277), 148 states have internal predecessors, (277), 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:57:03,544 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 149 states, 148 states have (on average 1.8716216216216217) internal successors, (in total 277), 148 states have internal predecessors, (277), 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 353 states and 666 transitions. Complement of second has 6 states. [2025-04-26 16:57:03,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:03,548 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:57:03,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-04-26 16:57:03,552 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:57:03,552 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,553 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:57:03,553 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,553 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:57:03,553 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 353 states and 666 transitions. [2025-04-26 16:57:03,561 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 34 [2025-04-26 16:57:03,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 353 states to 159 states and 291 transitions. [2025-04-26 16:57:03,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2025-04-26 16:57:03,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2025-04-26 16:57:03,569 INFO L74 IsDeterministic]: Start isDeterministic. Operand 159 states and 291 transitions. [2025-04-26 16:57:03,569 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:03,569 INFO L218 hiAutomatonCegarLoop]: Abstraction has 159 states and 291 transitions. [2025-04-26 16:57:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 291 transitions. [2025-04-26 16:57:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 141. [2025-04-26 16:57:03,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 141 states have (on average 1.8936170212765957) internal successors, (in total 267), 140 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 267 transitions. [2025-04-26 16:57:03,591 INFO L240 hiAutomatonCegarLoop]: Abstraction has 141 states and 267 transitions. [2025-04-26 16:57:03,591 INFO L438 stractBuchiCegarLoop]: Abstraction has 141 states and 267 transitions. [2025-04-26 16:57:03,591 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:57:03,591 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 267 transitions. [2025-04-26 16:57:03,594 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 34 [2025-04-26 16:57:03,594 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:03,594 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:03,594 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:57:03,594 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:03,594 INFO L752 eck$LassoCheckResult]: Stem: "[49] $Ultimate##0-->L16: Formula: (and (= v_g_4 0) (= v_f_1 0)) InVars {g=v_g_4, f=v_f_1} OutVars{g=v_g_4, f=v_f_1} AuxVars[] AssignedVars[]" "[70] L16-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[54] L27-->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[]" "[56] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[73] L16-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:57:03,594 INFO L754 eck$LassoCheckResult]: Loop: "[59] L36-->L38: 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[]" "[61] L38-->L36: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:57:03,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,595 INFO L85 PathProgramCache]: Analyzing trace with hash 76020753, now seen corresponding path program 1 times [2025-04-26 16:57:03,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:03,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063663651] [2025-04-26 16:57:03,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:03,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:03,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:03,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:03,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,605 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:03,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:03,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:03,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:03,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 1 times [2025-04-26 16:57:03,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:03,609 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267199500] [2025-04-26 16:57:03,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:03,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:03,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,611 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:03,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:03,615 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,616 INFO L85 PathProgramCache]: Analyzing trace with hash 41501491, now seen corresponding path program 1 times [2025-04-26 16:57:03,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:03,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339885708] [2025-04-26 16:57:03,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:03,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:03,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:57:03,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:57:03,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,620 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:03,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:57:03,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:57:03,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:03,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:03,637 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:03,637 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:03,637 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:03,637 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:03,637 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:03,637 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,638 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:03,638 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:03,638 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:57:03,638 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:03,638 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:03,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:03,663 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:03,663 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:03,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,667 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:03,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:57:03,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:03,669 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:03,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:57:03,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,699 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:03,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:57:03,702 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:03,702 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:03,766 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:03,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:03,786 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:03,786 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:03,786 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:03,786 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:03,786 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:03,786 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,786 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:03,786 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:03,786 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-3.c.bpl_petrified1_Iteration2_Loop [2025-04-26 16:57:03,786 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:03,786 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:03,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:03,806 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:03,807 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:03,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,809 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:03,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:57:03,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:03,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:03,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:03,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:03,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:03,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:03,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:03,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:03,823 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:03,826 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:03,826 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:03,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:03,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:03,852 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:03,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:57:03,855 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:03,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:03,858 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:03,858 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:03,858 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 16:57:03,863 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:57:03,864 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:03,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:57:03,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:57:03,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:03,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:03,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:03,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:03,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:03,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:03,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:03,898 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:03,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:03,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:03,911 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:57:03,911 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 141 states and 267 transitions. cyclomatic complexity: 155 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:57:03,965 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 141 states and 267 transitions. cyclomatic complexity: 155. 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 412 states and 761 transitions. Complement of second has 7 states. [2025-04-26 16:57:03,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:03,966 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:57:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-04-26 16:57:03,966 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:57:03,966 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,966 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:57:03,966 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,966 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:57:03,967 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:03,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 412 states and 761 transitions. [2025-04-26 16:57:03,971 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 30 [2025-04-26 16:57:03,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 412 states to 274 states and 512 transitions. [2025-04-26 16:57:03,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 128 [2025-04-26 16:57:03,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 142 [2025-04-26 16:57:03,976 INFO L74 IsDeterministic]: Start isDeterministic. Operand 274 states and 512 transitions. [2025-04-26 16:57:03,976 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:03,976 INFO L218 hiAutomatonCegarLoop]: Abstraction has 274 states and 512 transitions. [2025-04-26 16:57:03,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states and 512 transitions. [2025-04-26 16:57:03,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 226. [2025-04-26 16:57:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 226 states have (on average 1.8893805309734513) internal successors, (in total 427), 225 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:03,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 427 transitions. [2025-04-26 16:57:03,992 INFO L240 hiAutomatonCegarLoop]: Abstraction has 226 states and 427 transitions. [2025-04-26 16:57:03,992 INFO L438 stractBuchiCegarLoop]: Abstraction has 226 states and 427 transitions. [2025-04-26 16:57:03,992 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:57:03,992 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 427 transitions. [2025-04-26 16:57:03,994 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 30 [2025-04-26 16:57:03,994 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:03,994 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:03,994 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:03,994 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:03,995 INFO L752 eck$LassoCheckResult]: Stem: "[49] $Ultimate##0-->L16: Formula: (and (= v_g_4 0) (= v_f_1 0)) InVars {g=v_g_4, f=v_f_1} OutVars{g=v_g_4, f=v_f_1} AuxVars[] AssignedVars[]" "[70] L16-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[54] L27-->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[]" "[56] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[73] L16-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[58] L36-->L40: 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[]" "[60] L40-->thread2FINAL: Formula: (= v_g_1 (+ v_g_2 1)) InVars {g=v_g_2} OutVars{g=v_g_1} AuxVars[] AssignedVars[g]" "[62] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[76] L17-->$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]" "[63] $Ultimate##0-->L47-1: Formula: (< 0 v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" [2025-04-26 16:57:03,995 INFO L754 eck$LassoCheckResult]: Loop: "[65] L47-1-->L49: 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[]" "[67] L49-->L47-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:57:03,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash -580554178, now seen corresponding path program 1 times [2025-04-26 16:57:03,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:03,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328663054] [2025-04-26 16:57:03,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:03,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:03,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:57:04,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:57:04,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,000 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:04,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:57:04,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:57:04,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:04,005 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:04,005 INFO L85 PathProgramCache]: Analyzing trace with hash 3043, now seen corresponding path program 1 times [2025-04-26 16:57:04,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:04,005 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346776000] [2025-04-26 16:57:04,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:04,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:04,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:04,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:04,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:04,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:04,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:04,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:04,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:04,014 INFO L85 PathProgramCache]: Analyzing trace with hash 433185504, now seen corresponding path program 1 times [2025-04-26 16:57:04,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:04,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230279967] [2025-04-26 16:57:04,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:04,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:04,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:57:04,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:57:04,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,025 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:04,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:57:04,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:57:04,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:04,044 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:04,044 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:04,044 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:04,044 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:04,044 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:04,044 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,044 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:04,044 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:04,044 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:04,044 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:04,044 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:04,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:04,063 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:04,063 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:04,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,065 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:04,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:57:04,068 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:04,068 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:04,085 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:57:04,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,087 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:04,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:57:04,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:04,090 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:04,161 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:04,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:04,165 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:04,165 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:04,165 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:04,165 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:04,166 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:04,166 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,166 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:04,166 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:04,166 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-3.c.bpl_petrified1_Iteration3_Loop [2025-04-26 16:57:04,166 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:04,166 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:04,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:04,188 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:04,188 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:04,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,190 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:04,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:57:04,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:04,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:04,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:04,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:04,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:04,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:04,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:04,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:04,205 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:04,209 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:57:04,210 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:04,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,212 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:04,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:57:04,216 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:04,218 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:57:04,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:04,219 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:04,220 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:04,220 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y2, x2) = -1*y2 + 1*x2 Supporting invariants [] [2025-04-26 16:57:04,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:57:04,226 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:04,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:04,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:57:04,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:57:04,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:04,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:04,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:04,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:04,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:04,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:04,267 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:04,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:04,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:04,284 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:57:04,284 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 427 transitions. cyclomatic complexity: 242 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:04,349 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 427 transitions. cyclomatic complexity: 242. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 558 states and 1005 transitions. Complement of second has 7 states. [2025-04-26 16:57:04,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-04-26 16:57:04,352 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:57:04,352 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,352 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:57:04,352 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,352 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:57:04,352 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 558 states and 1005 transitions. [2025-04-26 16:57:04,356 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 30 [2025-04-26 16:57:04,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 558 states to 348 states and 629 transitions. [2025-04-26 16:57:04,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 146 [2025-04-26 16:57:04,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2025-04-26 16:57:04,361 INFO L74 IsDeterministic]: Start isDeterministic. Operand 348 states and 629 transitions. [2025-04-26 16:57:04,361 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:04,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 348 states and 629 transitions. [2025-04-26 16:57:04,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states and 629 transitions. [2025-04-26 16:57:04,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 257. [2025-04-26 16:57:04,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 257 states have (on average 1.8715953307392996) internal successors, (in total 481), 256 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:04,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 481 transitions. [2025-04-26 16:57:04,375 INFO L240 hiAutomatonCegarLoop]: Abstraction has 257 states and 481 transitions. [2025-04-26 16:57:04,375 INFO L438 stractBuchiCegarLoop]: Abstraction has 257 states and 481 transitions. [2025-04-26 16:57:04,375 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:57:04,375 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 257 states and 481 transitions. [2025-04-26 16:57:04,378 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 30 [2025-04-26 16:57:04,379 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:57:04,379 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:57:04,379 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:57:04,379 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:57:04,379 INFO L752 eck$LassoCheckResult]: Stem: "[49] $Ultimate##0-->L16: Formula: (and (= v_g_4 0) (= v_f_1 0)) InVars {g=v_g_4, f=v_f_1} OutVars{g=v_g_4, f=v_f_1} AuxVars[] AssignedVars[]" "[70] L16-->L27: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[54] L27-->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[]" "[56] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[73] L16-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[76] L17-->$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]" "[77] thread1EXIT-->L19: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" "[63] $Ultimate##0-->L47-1: Formula: (< 0 v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" "[65] L47-1-->L49: 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[]" "[67] L49-->L47-1: Formula: (= v_x2_7 (+ v_x2_6 1)) InVars {x2=v_x2_7} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[x2]" "[64] L47-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[]" [2025-04-26 16:57:04,380 INFO L754 eck$LassoCheckResult]: Loop: "[59] L36-->L38: 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[]" "[61] L38-->L36: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:57:04,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash -286266351, now seen corresponding path program 1 times [2025-04-26 16:57:04,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:04,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046906801] [2025-04-26 16:57:04,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:57:04,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:04,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:04,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:04,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:57:04,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:57:04,427 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046906801] [2025-04-26 16:57:04,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046906801] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:57:04,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:57:04,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:57:04,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932554163] [2025-04-26 16:57:04,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:57:04,432 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:57:04,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:04,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2851, now seen corresponding path program 2 times [2025-04-26 16:57:04,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:57:04,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788512872] [2025-04-26 16:57:04,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:57:04,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:57:04,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:04,445 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:04,445 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:57:04,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:57:04,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:04,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:04,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:57:04,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:57:04,460 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:04,460 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:04,460 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:04,460 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:04,460 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:57:04,460 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,460 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:04,461 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:04,461 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-3.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:57:04,461 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:04,461 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:04,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:04,475 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:04,475 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:57:04,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,477 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:04,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:57:04,480 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:57:04,480 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:04,497 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:57:04,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,499 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:04,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:57:04,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:57:04,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:57:04,564 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:57:04,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:57:04,568 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:57:04,568 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:57:04,568 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:57:04,569 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:57:04,569 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:57:04,569 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,569 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:57:04,569 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:57:04,569 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-3.c.bpl_petrified1_Iteration4_Loop [2025-04-26 16:57:04,569 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:57:04,569 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:57:04,569 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:57:04,587 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:57:04,587 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:57:04,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,589 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:04,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:57:04,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:57:04,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:57:04,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:57:04,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:57:04,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:57:04,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:57:04,601 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:57:04,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:57:04,603 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:57:04,606 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:57:04,606 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:57:04,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:57:04,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:57:04,608 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:57:04,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:57:04,611 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:57:04,614 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:57:04,614 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:57:04,614 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:57:04,615 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 16:57:04,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:57:04,621 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:57:04,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:57:04,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:57:04,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:57:04,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:04,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:57:04,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:04,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:57:04,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:57:04,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:57:04,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:57:04,660 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:57:04,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:57:04,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:57:04,672 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:57:04,673 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 257 states and 481 transitions. cyclomatic complexity: 269 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:04,701 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 257 states and 481 transitions. cyclomatic complexity: 269. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 326 states and 602 transitions. Complement of second has 6 states. [2025-04-26 16:57:04,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:57:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2025-04-26 16:57:04,702 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:57:04,702 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,702 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 16:57:04,702 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,702 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:57:04,702 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:57:04,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 326 states and 602 transitions. [2025-04-26 16:57:04,704 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 18 [2025-04-26 16:57:04,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 326 states to 233 states and 425 transitions. [2025-04-26 16:57:04,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2025-04-26 16:57:04,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2025-04-26 16:57:04,706 INFO L74 IsDeterministic]: Start isDeterministic. Operand 233 states and 425 transitions. [2025-04-26 16:57:04,706 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:57:04,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 233 states and 425 transitions. [2025-04-26 16:57:04,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 425 transitions. [2025-04-26 16:57:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2025-04-26 16:57:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 233 states have (on average 1.8240343347639485) internal successors, (in total 425), 232 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:04,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 425 transitions. [2025-04-26 16:57:04,719 INFO L240 hiAutomatonCegarLoop]: Abstraction has 233 states and 425 transitions. [2025-04-26 16:57:04,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:57:04,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:57:04,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:57:04,721 INFO L87 Difference]: Start difference. First operand 233 states and 425 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:57:04,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:57:04,728 INFO L93 Difference]: Finished difference Result 59 states and 97 transitions. [2025-04-26 16:57:04,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 97 transitions. [2025-04-26 16:57:04,728 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:04,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 0 states and 0 transitions. [2025-04-26 16:57:04,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:57:04,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:57:04,729 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:57:04,729 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:57:04,729 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:04,729 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:04,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:57:04,730 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:57:04,730 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:57:04,730 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:57:04,730 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:57:04,730 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:57:04,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:57:04,744 INFO L201 PluginConnector]: Adding new model me1-3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:57:04 BoogieIcfgContainer [2025-04-26 16:57:04,744 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:57:04,745 INFO L158 Benchmark]: Toolchain (without parser) took 2398.03ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 84.7MB in the beginning and 69.5MB in the end (delta: 15.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:04,745 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:04,746 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.15ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 81.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:04,746 INFO L158 Benchmark]: Boogie Preprocessor took 18.09ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 80.9MB in the end (delta: 987.5kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:04,747 INFO L158 Benchmark]: RCFGBuilder took 164.39ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 72.0MB in the end (delta: 8.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:57:04,748 INFO L158 Benchmark]: BuchiAutomizer took 2180.02ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 71.9MB in the beginning and 69.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:57:04,748 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.17ms. Allocated memory is still 155.2MB. Free memory is still 85.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.15ms. Allocated memory is still 155.2MB. Free memory was 84.7MB in the beginning and 81.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 18.09ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 80.9MB in the end (delta: 987.5kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 164.39ms. Allocated memory is still 155.2MB. Free memory was 80.9MB in the beginning and 72.0MB in the end (delta: 8.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2180.02ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 71.9MB in the beginning and 69.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 157 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 138 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 186 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 110 IncrementalHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 96 mSDtfsCounter, 110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 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: 69ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 243, Number of transitions in reduction automaton: 277, Number of states in reduction automaton: 149, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 4 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 z2 + -1 * x2 and consists of 4 locations. 1 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:57:04,760 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...