/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/4thr_2groups.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:39,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:39,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:39,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:39,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:39,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:39,643 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:39,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:39,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:39,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:39,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:39,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:39,666 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:39,666 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:39,666 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:39,666 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:39,666 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:39,666 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:39,666 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:39,667 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:39,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:39,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:39,667 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:39,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:39,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:39,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:39,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:39,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:39,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:39,667 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:39,667 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:39,667 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:39,667 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:39,667 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:39,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:39,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:39,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:39,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:39,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:39,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:39,668 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:39,668 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:39,668 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:39,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:39,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:39,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:39,914 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:39,915 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:39,915 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/4thr_2groups.c.bpl [2025-04-26 18:42:39,916 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/4thr_2groups.c.bpl' [2025-04-26 18:42:39,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:39,927 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:39,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:39,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:39,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:39,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:39" (1/1) ... [2025-04-26 18:42:39,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:39" (1/1) ... [2025-04-26 18:42:39,959 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:39,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:39,961 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:39,961 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:39,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:39,965 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:39" (1/1) ... [2025-04-26 18:42:39,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:39" (1/1) ... [2025-04-26 18:42:39,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:39" (1/1) ... [2025-04-26 18:42:39,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:39" (1/1) ... [2025-04-26 18:42:39,967 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:39" (1/1) ... [2025-04-26 18:42:39,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:39" (1/1) ... [2025-04-26 18:42:39,970 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:39" (1/1) ... [2025-04-26 18:42:39,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:39" (1/1) ... [2025-04-26 18:42:39,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:39" (1/1) ... [2025-04-26 18:42:39,981 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:39,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:39,983 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:39,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:39,984 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:39" (1/1) ... [2025-04-26 18:42:39,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:39,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,006 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:42:40,036 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:40,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:40,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:40,037 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:40,037 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:40,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:40,037 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:42:40,037 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:42:40,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:42:40,037 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:40,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:40,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:40,037 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:42:40,037 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:42:40,037 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:42:40,038 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:42:40,076 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:40,079 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:40,165 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:40,165 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:40,174 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:40,174 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:40,176 INFO L201 PluginConnector]: Adding new model 4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:40 BoogieIcfgContainer [2025-04-26 18:42:40,176 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:40,177 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:40,177 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:40,181 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:40,182 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:40,182 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:39" (1/2) ... [2025-04-26 18:42:40,183 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@78485061 and model type 4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:40, skipping insertion in model container [2025-04-26 18:42:40,183 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:40,183 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:40" (2/2) ... [2025-04-26 18:42:40,184 INFO L376 chiAutomizerObserver]: Analyzing ICFG 4thr_2groups.c.bpl [2025-04-26 18:42:40,248 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:42:40,292 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:40,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:40,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:42:40,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 35 transitions, 98 flow [2025-04-26 18:42:40,380 INFO L116 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-04-26 18:42:40,383 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:42:40,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 27 events. 4/27 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 59 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-26 18:42:40,387 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 35 transitions, 98 flow [2025-04-26 18:42:40,392 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 27 transitions, 78 flow [2025-04-26 18:42:40,393 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 36 places, 27 transitions, 78 flow [2025-04-26 18:42:40,393 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 78 flow [2025-04-26 18:42:40,479 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 632 states, 631 states have (on average 3.9001584786053884) internal successors, (in total 2461), 631 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,481 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 632 states, 631 states have (on average 3.9001584786053884) internal successors, (in total 2461), 631 states have internal predecessors, (2461), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,483 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:40,697 WARN L140 AmpleReduction]: Number of pruned transitions: 892 [2025-04-26 18:42:40,698 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:40,698 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 164 [2025-04-26 18:42:40,698 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:27 [2025-04-26 18:42:40,698 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:347 [2025-04-26 18:42:40,698 WARN L145 AmpleReduction]: Times succ was already a loop node:203 [2025-04-26 18:42:40,698 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:149 [2025-04-26 18:42:40,698 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:40,700 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 539 states, 538 states have (on average 2.1356877323420074) internal successors, (in total 1149), 538 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,708 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:40,708 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:40,708 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:40,708 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:40,708 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:40,708 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:40,708 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:40,708 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:40,717 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 539 states, 538 states have (on average 2.1356877323420074) internal successors, (in total 1149), 538 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,750 INFO L131 ngComponentsAnalysis]: Automaton has 107 accepting balls. 464 [2025-04-26 18:42:40,750 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:40,750 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:40,754 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:40,754 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:40,754 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:40,756 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 539 states, 538 states have (on average 2.1356877323420074) internal successors, (in total 1149), 538 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:40,771 INFO L131 ngComponentsAnalysis]: Automaton has 107 accepting balls. 464 [2025-04-26 18:42:40,771 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:40,771 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:40,771 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1] [2025-04-26 18:42:40,771 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:40,776 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:40,776 INFO L754 eck$LassoCheckResult]: Loop: "[67] L25-->L27: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[69] L27-->L25: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:40,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,780 INFO L85 PathProgramCache]: Analyzing trace with hash 117, now seen corresponding path program 1 times [2025-04-26 18:42:40,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959104950] [2025-04-26 18:42:40,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:40,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:40,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:40,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:40,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,853 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,853 INFO L85 PathProgramCache]: Analyzing trace with hash 3107, now seen corresponding path program 1 times [2025-04-26 18:42:40,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461949078] [2025-04-26 18:42:40,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,859 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:40,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:40,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,865 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:40,865 INFO L85 PathProgramCache]: Analyzing trace with hash 114583, now seen corresponding path program 1 times [2025-04-26 18:42:40,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:40,865 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110802663] [2025-04-26 18:42:40,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:40,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:40,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:40,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:40,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,869 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:40,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:40,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:40,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:40,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:40,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:40,915 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:40,916 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:40,916 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:40,916 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:40,916 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:40,916 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,916 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:40,916 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:40,917 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4thr_2groups.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:40,917 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:40,917 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:40,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:40,987 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:40,987 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:40,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:40,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:40,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:40,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:42:40,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:40,996 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:41,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,022 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:42:41,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:41,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:41,100 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:41,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:41,106 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:41,106 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:41,106 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:41,106 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:41,106 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:41,106 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,106 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:41,106 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:41,106 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4thr_2groups.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:41,106 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:41,106 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:41,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:41,138 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:41,141 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:41,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,145 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:42:41,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:41,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:41,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:41,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:41,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:41,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:41,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:41,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:41,167 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:41,190 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:41,190 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:41,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:42:41,200 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:41,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:42:41,207 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:41,208 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:41,208 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, z) = -1*x1 + 1*z Supporting invariants [] [2025-04-26 18:42:41,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:42:41,229 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:41,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:42:41,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:42:41,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,275 WARN L254 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,285 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:41,332 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:41,334 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 539 states, 538 states have (on average 2.1356877323420074) internal successors, (in total 1149), 538 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:41,494 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 539 states, 538 states have (on average 2.1356877323420074) internal successors, (in total 1149), 538 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 1293 states and 2891 transitions. Complement of second has 6 states. [2025-04-26 18:42:41,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.0) internal successors, (in total 3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-26 18:42:41,506 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 1 letters. Loop has 2 letters. [2025-04-26 18:42:41,507 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,507 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:42:41,507 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,507 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 59 transitions. Stem has 1 letters. Loop has 4 letters. [2025-04-26 18:42:41,507 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:41,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1293 states and 2891 transitions. [2025-04-26 18:42:41,531 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 346 [2025-04-26 18:42:41,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1293 states to 724 states and 1605 transitions. [2025-04-26 18:42:41,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 411 [2025-04-26 18:42:41,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 524 [2025-04-26 18:42:41,545 INFO L74 IsDeterministic]: Start isDeterministic. Operand 724 states and 1605 transitions. [2025-04-26 18:42:41,546 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:41,546 INFO L218 hiAutomatonCegarLoop]: Abstraction has 724 states and 1605 transitions. [2025-04-26 18:42:41,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states and 1605 transitions. [2025-04-26 18:42:41,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 619. [2025-04-26 18:42:41,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 619 states have (on average 2.2810985460420032) internal successors, (in total 1412), 618 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 1412 transitions. [2025-04-26 18:42:41,593 INFO L240 hiAutomatonCegarLoop]: Abstraction has 619 states and 1412 transitions. [2025-04-26 18:42:41,593 INFO L438 stractBuchiCegarLoop]: Abstraction has 619 states and 1412 transitions. [2025-04-26 18:42:41,593 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:41,593 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 619 states and 1412 transitions. [2025-04-26 18:42:41,600 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 346 [2025-04-26 18:42:41,600 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:41,600 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:41,600 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:41,600 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:41,601 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[89] L12-->L34: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:42:41,601 INFO L754 eck$LassoCheckResult]: Loop: "[71] L34-->L36: Formula: (< v_x2_1 v_z_3) InVars {x2=v_x2_1, z=v_z_3} OutVars{x2=v_x2_1, z=v_z_3} AuxVars[] AssignedVars[]" "[73] L36-->L37: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[74] L37-->L34: Formula: (= v_x1_5 (+ v_x1_6 1)) InVars {x1=v_x1_6} OutVars{x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:41,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,601 INFO L85 PathProgramCache]: Analyzing trace with hash 3716, now seen corresponding path program 1 times [2025-04-26 18:42:41,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534193252] [2025-04-26 18:42:41,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:41,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,607 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,610 INFO L85 PathProgramCache]: Analyzing trace with hash 100359, now seen corresponding path program 1 times [2025-04-26 18:42:41,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611850547] [2025-04-26 18:42:41,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:41,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:41,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:41,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,618 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:41,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:41,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,625 INFO L85 PathProgramCache]: Analyzing trace with hash 110773924, now seen corresponding path program 1 times [2025-04-26 18:42:41,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:41,625 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445656832] [2025-04-26 18:42:41,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:41,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:41,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:41,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:41,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,629 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:41,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:41,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:41,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:41,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:41,670 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:41,670 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:41,670 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:41,670 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:41,670 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:41,670 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,670 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:41,670 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:41,670 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4thr_2groups.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:41,670 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:41,670 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:41,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:41,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:41,709 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:41,709 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:41,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,711 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:42:41,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:41,713 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:41,732 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 18:42:41,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,735 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:42:41,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:41,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:41,803 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:41,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:42:41,808 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:41,808 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:41,808 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:41,808 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:41,808 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:41,808 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,808 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:41,808 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:41,809 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4thr_2groups.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:41,809 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:41,809 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:41,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:41,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:41,845 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:41,845 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:41,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,847 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:42:41,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:41,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:41,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:41,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:41,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:41,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:41,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:41,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:41,863 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:41,867 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:41,867 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:41,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:41,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:41,869 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:41,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:42:41,875 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:41,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:42:41,886 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:41,886 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:41,886 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x2, z) = -1*x2 + 1*z Supporting invariants [] [2025-04-26 18:42:41,892 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 18:42:41,893 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:41,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:41,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:41,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:41,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:41,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:41,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:41,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:41,930 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:41,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:41,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:41,989 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:42:41,989 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 619 states and 1412 transitions. cyclomatic complexity: 902 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:42,083 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 619 states and 1412 transitions. cyclomatic complexity: 902. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 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 1518 states and 3500 transitions. Complement of second has 6 states. [2025-04-26 18:42:42,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (in total 5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2025-04-26 18:42:42,086 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 2 letters. Loop has 3 letters. [2025-04-26 18:42:42,086 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,086 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:42:42,086 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,086 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 60 transitions. Stem has 2 letters. Loop has 6 letters. [2025-04-26 18:42:42,087 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1518 states and 3500 transitions. [2025-04-26 18:42:42,100 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 101 [2025-04-26 18:42:42,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1518 states to 976 states and 2238 transitions. [2025-04-26 18:42:42,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2025-04-26 18:42:42,113 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 443 [2025-04-26 18:42:42,114 INFO L74 IsDeterministic]: Start isDeterministic. Operand 976 states and 2238 transitions. [2025-04-26 18:42:42,114 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:42,114 INFO L218 hiAutomatonCegarLoop]: Abstraction has 976 states and 2238 transitions. [2025-04-26 18:42:42,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states and 2238 transitions. [2025-04-26 18:42:42,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 865. [2025-04-26 18:42:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 865 states have (on average 2.3710982658959536) internal successors, (in total 2051), 864 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 2051 transitions. [2025-04-26 18:42:42,148 INFO L240 hiAutomatonCegarLoop]: Abstraction has 865 states and 2051 transitions. [2025-04-26 18:42:42,148 INFO L438 stractBuchiCegarLoop]: Abstraction has 865 states and 2051 transitions. [2025-04-26 18:42:42,149 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:42,149 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 865 states and 2051 transitions. [2025-04-26 18:42:42,153 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 101 [2025-04-26 18:42:42,153 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:42,153 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:42,154 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:42,154 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:42,154 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[66] L25-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[68] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[89] L12-->L34: 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]" "[70] L34-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[72] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[92] L13-->L44: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:42:42,154 INFO L754 eck$LassoCheckResult]: Loop: "[76] L44-->L46: Formula: (< v_x3_1 v_z_5) InVars {x3=v_x3_1, z=v_z_5} OutVars{x3=v_x3_1, z=v_z_5} AuxVars[] AssignedVars[]" "[78] L46-->L44: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 18:42:42,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1581207336, now seen corresponding path program 1 times [2025-04-26 18:42:42,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:42,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217122922] [2025-04-26 18:42:42,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:42,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:42,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:42,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:42,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,163 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:42,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:42,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:42,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:42,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,168 INFO L85 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 1 times [2025-04-26 18:42:42,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:42,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719220509] [2025-04-26 18:42:42,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:42,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:42,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:42,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:42,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:42,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:42,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:42,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:42,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,174 INFO L85 PathProgramCache]: Analyzing trace with hash 878175322, now seen corresponding path program 1 times [2025-04-26 18:42:42,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:42,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434942476] [2025-04-26 18:42:42,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:42,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:42,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:42,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:42,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,185 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:42,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:42:42,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:42:42,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:42,203 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:42,203 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:42,203 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:42,203 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:42,203 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:42,203 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,203 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:42,203 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:42,203 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4thr_2groups.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:42,203 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:42,203 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:42,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:42,236 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:42,236 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:42,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:42,238 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:42,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:42:42,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:42,241 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:42,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:42,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:42,260 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:42,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:42:42,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:42,262 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:42,329 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:42,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:42:42,339 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:42,339 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:42,339 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:42,339 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:42,339 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:42,339 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,339 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:42,339 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:42,339 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4thr_2groups.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:42,339 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:42,339 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:42,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:42,365 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:42,365 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:42,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:42,372 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:42,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:42:42,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:42,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:42,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:42,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:42,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:42,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:42,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:42,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:42,393 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:42,396 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:42,397 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:42,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:42,399 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:42,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:42:42,403 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:42,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:42:42,408 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:42,408 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:42,409 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x3) = 1*z - 1*x3 Supporting invariants [] [2025-04-26 18:42:42,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:42:42,418 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:42,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:42:42,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:42:42,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:42,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:42,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:42,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:42,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:42,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:42,458 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:42,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:42,473 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:42,473 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 865 states and 2051 transitions. cyclomatic complexity: 1298 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:42,569 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 865 states and 2051 transitions. cyclomatic complexity: 1298. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 2708 states and 6230 transitions. Complement of second has 6 states. [2025-04-26 18:42:42,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-04-26 18:42:42,571 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:42:42,571 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,571 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:42:42,571 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,571 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 72 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:42:42,571 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:42,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2708 states and 6230 transitions. [2025-04-26 18:42:42,589 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 57 [2025-04-26 18:42:42,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2708 states to 1414 states and 3259 transitions. [2025-04-26 18:42:42,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 365 [2025-04-26 18:42:42,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 407 [2025-04-26 18:42:42,599 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1414 states and 3259 transitions. [2025-04-26 18:42:42,599 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:42,599 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1414 states and 3259 transitions. [2025-04-26 18:42:42,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states and 3259 transitions. [2025-04-26 18:42:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1350. [2025-04-26 18:42:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 1350 states have (on average 2.311851851851852) internal successors, (in total 3121), 1349 states have internal predecessors, (3121), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 3121 transitions. [2025-04-26 18:42:42,638 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1350 states and 3121 transitions. [2025-04-26 18:42:42,638 INFO L438 stractBuchiCegarLoop]: Abstraction has 1350 states and 3121 transitions. [2025-04-26 18:42:42,638 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:42,638 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1350 states and 3121 transitions. [2025-04-26 18:42:42,644 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 57 [2025-04-26 18:42:42,644 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:42,644 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:42,644 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:42,644 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:42,645 INFO L752 eck$LassoCheckResult]: Stem: "[86] $Ultimate##0-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[66] L25-->thread1FINAL: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[68] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[89] L12-->L34: 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]" "[70] L34-->thread2FINAL: Formula: (<= v_z_4 v_x2_4) InVars {x2=v_x2_4, z=v_z_4} OutVars{x2=v_x2_4, z=v_z_4} AuxVars[] AssignedVars[]" "[72] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[92] L13-->L44: 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]" "[95] L14-->L53: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 18:42:42,645 INFO L754 eck$LassoCheckResult]: Loop: "[80] L53-->L55: Formula: (< v_x4_1 v_z_7) InVars {x4=v_x4_1, z=v_z_7} OutVars{x4=v_x4_1, z=v_z_7} AuxVars[] AssignedVars[]" "[82] L55-->L56: Formula: (= (+ v_x4_3 1) v_x4_2) InVars {x4=v_x4_3} OutVars{x4=v_x4_2} AuxVars[] AssignedVars[x4]" "[83] L56-->L53: Formula: (= (+ v_x3_6 1) v_x3_5) InVars {x3=v_x3_6} OutVars{x3=v_x3_5} AuxVars[] AssignedVars[x3]" [2025-04-26 18:42:42,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1772787065, now seen corresponding path program 1 times [2025-04-26 18:42:42,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:42,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764928375] [2025-04-26 18:42:42,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:42,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:42,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:42,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:42,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:42,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:42,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:42,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:42,660 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,660 INFO L85 PathProgramCache]: Analyzing trace with hash 109296, now seen corresponding path program 1 times [2025-04-26 18:42:42,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:42,660 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108426977] [2025-04-26 18:42:42,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:42,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:42,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:42,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:42,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,663 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:42,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:42,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:42,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:42,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2113465002, now seen corresponding path program 1 times [2025-04-26 18:42:42,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:42,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814146721] [2025-04-26 18:42:42,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:42,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:42,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:42,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:42,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,676 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:42,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:42,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:42,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:42,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:42,701 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:42,701 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:42,701 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:42,701 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:42,701 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:42,701 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,701 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:42,701 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:42,701 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4thr_2groups.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:42,701 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:42,701 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:42,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:42,707 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:42,728 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:42,728 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:42,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:42,730 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:42,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:42:42,732 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:42,732 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:42,753 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 18:42:42,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:42,755 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:42,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:42:42,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:42,758 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:42,827 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:42,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:42:42,832 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:42,832 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:42,832 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:42,832 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:42,832 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:42,832 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,832 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:42,832 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:42,832 INFO L132 ssoRankerPreferences]: Filename of dumped script: 4thr_2groups.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:42,832 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:42,832 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:42,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:42,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:42,861 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:42,861 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:42,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:42,863 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:42,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:42:42,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:42,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:42,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:42,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:42,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:42,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:42,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:42,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:42,878 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:42,882 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:42,882 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:42,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:42,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:42,884 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:42,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:42:42,885 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:42,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:42,888 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:42,888 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:42,888 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x4) = 1*z - 1*x4 Supporting invariants [] [2025-04-26 18:42:42,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:42,895 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:42,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:42,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:42,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:42,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:42,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:42,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:42,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:42,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:42,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:42,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:42,933 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:42,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:42,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:42,965 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 18:42:42,965 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1350 states and 3121 transitions. cyclomatic complexity: 1882 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:43,051 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1350 states and 3121 transitions. cyclomatic complexity: 1882. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 3205 states and 7245 transitions. Complement of second has 6 states. [2025-04-26 18:42:43,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:43,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-04-26 18:42:43,052 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:42:43,052 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:43,052 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 18:42:43,052 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:43,052 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 8 letters. Loop has 6 letters. [2025-04-26 18:42:43,052 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:43,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3205 states and 7245 transitions. [2025-04-26 18:42:43,074 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:43,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3205 states to 0 states and 0 transitions. [2025-04-26 18:42:43,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:43,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:43,075 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:43,075 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:43,075 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:43,075 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:43,075 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:43,075 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:43,075 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:43,075 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:43,075 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:43,086 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 18:42:43,087 INFO L201 PluginConnector]: Adding new model 4thr_2groups.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:43 BoogieIcfgContainer [2025-04-26 18:42:43,087 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:43,088 INFO L158 Benchmark]: Toolchain (without parser) took 3160.58ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 84.4MB in the beginning and 84.6MB in the end (delta: -167.8kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:43,088 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 155.2MB. Free memory is still 85.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:43,088 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.62ms. Allocated memory is still 155.2MB. Free memory was 84.2MB in the beginning and 81.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:43,088 INFO L158 Benchmark]: Boogie Preprocessor took 19.94ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 80.7MB in the end (delta: 949.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:43,089 INFO L158 Benchmark]: RCFGBuilder took 193.63ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 71.8MB in the end (delta: 8.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:42:43,089 INFO L158 Benchmark]: BuchiAutomizer took 2910.63ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.6MB in the beginning and 84.6MB in the end (delta: -13.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:43,090 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.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.62ms. Allocated memory is still 155.2MB. Free memory was 84.2MB in the beginning and 81.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 19.94ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 80.7MB in the end (delta: 949.6kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 193.63ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 71.8MB in the end (delta: 8.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2910.63ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.6MB in the beginning and 84.6MB in the end (delta: -13.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 280 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 178 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 174 mSDsluCounter, 176 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 92 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 224 IncrementalHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 84 mSDtfsCounter, 224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf100 lsp85 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 66ms 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.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 411, Number of transitions in reduction automaton: 1149, Number of states in reduction automaton: 539, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function z + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z and consists of 4 locations. One deterministic module has affine ranking function -1 * x4 + z and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:43,107 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...