/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/4_plus_thr/me1-5.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:44:05,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:44:05,401 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:44:05,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:44:05,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:44:05,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:44:05,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:44:05,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:44:05,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:44:05,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:44:05,433 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:44:05,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:44:05,433 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:44:05,433 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:44:05,433 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:44:05,433 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:44:05,433 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:44:05,433 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:44:05,433 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:44:05,433 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:44:05,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:44:05,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:44:05,434 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:44:05,434 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:44:05,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:44:05,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:44:05,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:44:05,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:44:05,434 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:44:05,434 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:44:05,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:44:05,434 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:44:05,434 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:44:05,434 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:44:05,434 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:44:05,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:44:05,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:44:05,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:44:05,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:44:05,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:44:05,435 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:44:05,435 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:44:05,435 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:44:05,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:44:05,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:44:05,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:44:05,634 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:44:05,635 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:44:05,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/4_plus_thr/me1-5.c.bpl [2025-04-26 18:44:05,636 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/4_plus_thr/me1-5.c.bpl' [2025-04-26 18:44:05,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:44:05,652 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:44:05,652 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:44:05,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:44:05,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:44:05,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:05" (1/1) ... [2025-04-26 18:44:05,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:05" (1/1) ... [2025-04-26 18:44:05,683 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:44:05,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:44:05,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:44:05,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:44:05,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:44:05,690 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:05" (1/1) ... [2025-04-26 18:44:05,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:05" (1/1) ... [2025-04-26 18:44:05,691 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:05" (1/1) ... [2025-04-26 18:44:05,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:05" (1/1) ... [2025-04-26 18:44:05,692 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:05" (1/1) ... [2025-04-26 18:44:05,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:05" (1/1) ... [2025-04-26 18:44:05,695 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:05" (1/1) ... [2025-04-26 18:44:05,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:05" (1/1) ... [2025-04-26 18:44:05,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:05" (1/1) ... [2025-04-26 18:44:05,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:44:05,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:44:05,703 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:44:05,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:44:05,708 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:05" (1/1) ... [2025-04-26 18:44:05,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:44:05,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:05,736 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:44:05,738 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:44:05,761 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:44:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:44:05,761 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:44:05,761 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:44:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:44:05,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:44:05,762 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:44:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:44:05,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:44:05,762 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:44:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:44:05,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:44:05,762 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:44:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:44:05,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:44:05,762 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 18:44:05,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 18:44:05,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 18:44:05,763 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:44:05,809 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:44:05,810 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:44:05,902 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:44:05,902 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:44:05,911 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:44:05,911 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:44:05,912 INFO L201 PluginConnector]: Adding new model me1-5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:44:05 BoogieIcfgContainer [2025-04-26 18:44:05,912 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:44:05,912 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:44:05,912 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:44:05,923 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:44:05,923 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:44:05,923 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:44:05" (1/2) ... [2025-04-26 18:44:05,924 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68d367a and model type me1-5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:44:05, skipping insertion in model container [2025-04-26 18:44:05,924 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:44:05,924 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "me1-5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:44:05" (2/2) ... [2025-04-26 18:44:05,925 INFO L376 chiAutomizerObserver]: Analyzing ICFG me1-5.c.bpl [2025-04-26 18:44:05,999 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 18:44:06,031 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:44:06,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:44:06,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:06,034 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:44:06,035 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:44:06,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 127 flow [2025-04-26 18:44:06,102 INFO L116 PetriNetUnfolderBase]: 5/36 cut-off events. [2025-04-26 18:44:06,107 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 18:44:06,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 36 events. 5/36 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 76 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-04-26 18:44:06,112 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 46 transitions, 127 flow [2025-04-26 18:44:06,115 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 36 transitions, 102 flow [2025-04-26 18:44:06,115 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 47 places, 36 transitions, 102 flow [2025-04-26 18:44:06,116 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 36 transitions, 102 flow [2025-04-26 18:44:06,329 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3908 states, 3907 states have (on average 4.909649347325313) internal successors, (in total 19182), 3907 states have internal predecessors, (19182), 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:44:06,345 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 3908 states, 3907 states have (on average 4.909649347325313) internal successors, (in total 19182), 3907 states have internal predecessors, (19182), 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:44:06,349 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:44:06,905 WARN L140 AmpleReduction]: Number of pruned transitions: 7856 [2025-04-26 18:44:06,906 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:44:06,906 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1178 [2025-04-26 18:44:06,906 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:45 [2025-04-26 18:44:06,906 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:2153 [2025-04-26 18:44:06,906 WARN L145 AmpleReduction]: Times succ was already a loop node:2767 [2025-04-26 18:44:06,907 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:598 [2025-04-26 18:44:06,907 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:44:06,918 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 3377 states, 3376 states have (on average 2.6522511848341233) internal successors, (in total 8954), 3376 states have internal predecessors, (8954), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:06,927 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:44:06,927 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:44:06,928 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:44:06,928 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:44:06,928 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:44:06,928 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:44:06,928 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:44:06,928 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:44:06,953 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3377 states, 3376 states have (on average 2.6522511848341233) internal successors, (in total 8954), 3376 states have internal predecessors, (8954), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:07,057 INFO L131 ngComponentsAnalysis]: Automaton has 594 accepting balls. 2382 [2025-04-26 18:44:07,057 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:07,057 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:07,061 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:44:07,061 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:07,061 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:44:07,073 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3377 states, 3376 states have (on average 2.6522511848341233) internal successors, (in total 8954), 3376 states have internal predecessors, (8954), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:07,121 INFO L131 ngComponentsAnalysis]: Automaton has 594 accepting balls. 2382 [2025-04-26 18:44:07,121 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:07,121 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:07,122 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:44:07,122 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:07,126 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:44:07,127 INFO L754 eck$LassoCheckResult]: Loop: "[90] L33-->L35: Formula: (< v_x1_1 v_z1_1) InVars {x1=v_x1_1, z1=v_z1_1} OutVars{x1=v_x1_1, z1=v_z1_1} AuxVars[] AssignedVars[]" "[92] L35-->L33: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:44:07,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:07,131 INFO L85 PathProgramCache]: Analyzing trace with hash 3680, now seen corresponding path program 1 times [2025-04-26 18:44:07,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:07,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412762109] [2025-04-26 18:44:07,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:07,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:07,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:07,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:07,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:07,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:07,210 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:07,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:07,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:07,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:07,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:07,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:07,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:07,230 INFO L85 PathProgramCache]: Analyzing trace with hash 3843, now seen corresponding path program 1 times [2025-04-26 18:44:07,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:07,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178204987] [2025-04-26 18:44:07,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:07,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:07,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:07,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:07,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:07,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:07,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:07,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:07,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:07,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:07,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:07,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:07,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:07,248 INFO L85 PathProgramCache]: Analyzing trace with hash 3539362, now seen corresponding path program 1 times [2025-04-26 18:44:07,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:07,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356756544] [2025-04-26 18:44:07,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:07,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:07,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:44:07,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:44:07,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:07,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:07,254 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:07,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:44:07,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:44:07,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:07,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:07,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:07,306 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:07,307 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:07,307 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:07,307 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:07,307 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:07,307 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:07,307 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:07,307 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:07,307 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:44:07,307 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:07,307 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:07,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:07,380 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:07,381 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:07,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:07,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:07,384 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:44:07,386 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:44:07,389 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:07,390 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:07,414 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:44:07,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:07,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:07,417 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:44:07,418 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:44:07,420 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:07,421 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:07,508 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:07,513 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:44:07,514 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:07,514 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:07,514 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:07,514 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:07,514 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:07,514 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:07,514 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:07,514 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:07,514 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:44:07,514 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:07,514 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:07,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:07,542 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:07,546 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:07,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:07,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:07,556 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:44:07,559 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:44:07,560 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:44:07,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:07,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:07,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:07,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:07,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:07,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:07,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:07,582 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:07,587 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:07,588 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:07,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:07,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:07,591 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:44:07,593 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:44:07,594 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:07,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:07,597 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:07,598 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:07,598 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1, x1) = 1*z1 - 1*x1 Supporting invariants [] [2025-04-26 18:44:07,604 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:44:07,607 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:07,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:07,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:07,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:07,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:07,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:07,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:07,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:07,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:07,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:07,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:07,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:07,659 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:07,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:07,677 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:44:07,696 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:44:07,703 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 3377 states, 3376 states have (on average 2.6522511848341233) internal successors, (in total 8954), 3376 states have internal predecessors, (8954), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:07,945 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 3377 states, 3376 states have (on average 2.6522511848341233) internal successors, (in total 8954), 3376 states have internal predecessors, (8954), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 8395 states and 22791 transitions. Complement of second has 6 states. [2025-04-26 18:44:07,946 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:44:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-04-26 18:44:07,955 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:44:07,956 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:07,956 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:44:07,956 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:07,956 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:44:07,957 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:07,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8395 states and 22791 transitions. [2025-04-26 18:44:08,034 INFO L131 ngComponentsAnalysis]: Automaton has 323 accepting balls. 1036 [2025-04-26 18:44:08,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8395 states to 4747 states and 12671 transitions. [2025-04-26 18:44:08,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1914 [2025-04-26 18:44:08,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2993 [2025-04-26 18:44:08,112 INFO L74 IsDeterministic]: Start isDeterministic. Operand 4747 states and 12671 transitions. [2025-04-26 18:44:08,113 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:08,113 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4747 states and 12671 transitions. [2025-04-26 18:44:08,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4747 states and 12671 transitions. [2025-04-26 18:44:08,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4747 to 4022. [2025-04-26 18:44:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4022 states, 4022 states have (on average 2.798607657881651) internal successors, (in total 11256), 4021 states have internal predecessors, (11256), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:08,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4022 states to 4022 states and 11256 transitions. [2025-04-26 18:44:08,331 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4022 states and 11256 transitions. [2025-04-26 18:44:08,331 INFO L438 stractBuchiCegarLoop]: Abstraction has 4022 states and 11256 transitions. [2025-04-26 18:44:08,331 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:44:08,331 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4022 states and 11256 transitions. [2025-04-26 18:44:08,350 INFO L131 ngComponentsAnalysis]: Automaton has 323 accepting balls. 1036 [2025-04-26 18:44:08,350 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:08,350 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:08,350 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:44:08,350 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:08,352 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[89] L33-->thread1FINAL: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[91] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[118] L18-1-->L42: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:44:08,352 INFO L754 eck$LassoCheckResult]: Loop: "[94] L42-->L44: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[96] L44-->L42: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 18:44:08,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:08,353 INFO L85 PathProgramCache]: Analyzing trace with hash 109719348, now seen corresponding path program 1 times [2025-04-26 18:44:08,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:08,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404689456] [2025-04-26 18:44:08,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:08,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:08,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:44:08,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:44:08,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:08,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:44:08,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:44:08,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:08,369 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:08,369 INFO L85 PathProgramCache]: Analyzing trace with hash 3971, now seen corresponding path program 1 times [2025-04-26 18:44:08,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:08,369 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321074099] [2025-04-26 18:44:08,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:08,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:08,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:08,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:08,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,374 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:08,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:08,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:08,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:08,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:08,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1933885962, now seen corresponding path program 1 times [2025-04-26 18:44:08,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:08,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805588321] [2025-04-26 18:44:08,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:08,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:08,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:44:08,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:44:08,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,393 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:08,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:44:08,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:44:08,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:08,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:08,419 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:08,420 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:08,420 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:08,420 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:08,420 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:08,420 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:08,420 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:08,420 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:08,420 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:44:08,420 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:08,420 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:08,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:08,444 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:08,444 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:08,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:08,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:08,448 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:44:08,449 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:44:08,451 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:08,451 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:08,469 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:44:08,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:08,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:08,471 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:44:08,472 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:44:08,475 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:08,475 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:08,550 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:08,555 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:44:08,555 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:08,555 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:08,555 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:08,555 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:08,555 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:08,555 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:08,555 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:08,555 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:08,555 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:44:08,555 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:08,555 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:08,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:08,580 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:08,580 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:08,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:08,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:08,582 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:44:08,584 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:44:08,585 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:44:08,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:08,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:08,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:08,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:08,596 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:08,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:08,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:08,600 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:08,604 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:08,604 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:08,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:08,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:08,607 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:44:08,609 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:44:08,610 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:08,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:08,615 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:08,615 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:08,615 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2, x2) = 1*z2 - 1*x2 Supporting invariants [] [2025-04-26 18:44:08,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:08,624 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:08,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:08,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:44:08,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:44:08,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:08,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:08,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:08,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:08,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:08,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:08,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:08,662 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:08,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:08,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:44:08,681 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:44:08,681 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4022 states and 11256 transitions. cyclomatic complexity: 7792 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:08,902 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4022 states and 11256 transitions. cyclomatic complexity: 7792. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 13164 states and 35681 transitions. Complement of second has 7 states. [2025-04-26 18:44:08,902 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:44:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-04-26 18:44:08,903 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:44:08,903 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:08,903 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:44:08,903 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:08,903 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:44:08,903 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:08,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13164 states and 35681 transitions. [2025-04-26 18:44:08,998 INFO L131 ngComponentsAnalysis]: Automaton has 440 accepting balls. 1238 [2025-04-26 18:44:09,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13164 states to 9640 states and 26368 transitions. [2025-04-26 18:44:09,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4391 [2025-04-26 18:44:09,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4837 [2025-04-26 18:44:09,139 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9640 states and 26368 transitions. [2025-04-26 18:44:09,139 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:09,139 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9640 states and 26368 transitions. [2025-04-26 18:44:09,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9640 states and 26368 transitions. [2025-04-26 18:44:09,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9640 to 7229. [2025-04-26 18:44:09,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7229 states, 7229 states have (on average 2.781989210125882) internal successors, (in total 20111), 7228 states have internal predecessors, (20111), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:09,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7229 states to 7229 states and 20111 transitions. [2025-04-26 18:44:09,345 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7229 states and 20111 transitions. [2025-04-26 18:44:09,345 INFO L438 stractBuchiCegarLoop]: Abstraction has 7229 states and 20111 transitions. [2025-04-26 18:44:09,345 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:44:09,345 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7229 states and 20111 transitions. [2025-04-26 18:44:09,380 INFO L131 ngComponentsAnalysis]: Automaton has 376 accepting balls. 1108 [2025-04-26 18:44:09,380 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:09,380 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:09,381 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:09,381 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:09,382 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[89] L33-->thread1FINAL: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[91] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[118] L18-1-->L42: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[121] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[98] $Ultimate##0-->L53-1: Formula: (< 0 v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" "[100] L53-1-->L55: Formula: (< v_y2_1 v_x2_5) InVars {y2=v_y2_1, x2=v_x2_5} OutVars{y2=v_y2_1, x2=v_x2_5} AuxVars[] AssignedVars[]" "[102] L55-->L53-1: Formula: (= v_x2_7 (+ v_x2_6 1)) InVars {x2=v_x2_7} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[x2]" [2025-04-26 18:44:09,382 INFO L754 eck$LassoCheckResult]: Loop: "[100] L53-1-->L55: Formula: (< v_y2_1 v_x2_5) InVars {y2=v_y2_1, x2=v_x2_5} OutVars{y2=v_y2_1, x2=v_x2_5} AuxVars[] AssignedVars[]" "[102] L55-->L53-1: Formula: (= v_x2_7 (+ v_x2_6 1)) InVars {x2=v_x2_7} OutVars{x2=v_x2_6} AuxVars[] AssignedVars[x2]" [2025-04-26 18:44:09,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:09,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1257239167, now seen corresponding path program 1 times [2025-04-26 18:44:09,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:09,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098474287] [2025-04-26 18:44:09,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:09,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:09,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:44:09,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:44:09,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:09,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:09,424 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:44:09,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:44:09,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098474287] [2025-04-26 18:44:09,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098474287] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:44:09,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:44:09,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:44:09,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248194923] [2025-04-26 18:44:09,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:44:09,428 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:44:09,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:09,428 INFO L85 PathProgramCache]: Analyzing trace with hash 4163, now seen corresponding path program 1 times [2025-04-26 18:44:09,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:09,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773289605] [2025-04-26 18:44:09,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:09,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:09,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:09,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:09,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:09,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:09,431 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:09,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:09,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:09,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:09,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:09,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:09,456 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:09,456 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:09,456 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:09,456 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:09,456 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:09,456 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,456 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:09,456 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:09,456 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:09,456 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:09,456 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:09,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:09,476 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:09,476 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:09,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:09,478 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:44:09,480 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:44:09,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:09,481 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:09,500 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:44:09,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:09,504 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:44:09,506 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:44:09,507 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:09,507 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:09,589 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:09,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:09,594 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:09,594 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:09,594 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:09,594 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:09,594 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:09,594 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,594 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:09,594 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:09,594 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:44:09,594 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:09,594 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:09,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:09,616 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:09,616 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:09,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:09,619 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:44:09,620 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:44:09,622 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:44:09,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:09,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:09,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:09,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:09,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:09,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:09,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:09,637 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:09,640 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:09,640 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:09,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:09,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:09,642 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:44:09,644 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:44:09,645 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:09,652 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:44:09,652 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:09,652 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:09,652 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y2, x2) = -1*y2 + 1*x2 Supporting invariants [] [2025-04-26 18:44:09,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:09,659 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:09,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:09,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:44:09,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:44:09,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:09,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:09,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:09,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:09,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:09,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:09,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:09,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:09,701 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:09,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:09,714 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:44:09,715 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:44:09,715 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7229 states and 20111 transitions. cyclomatic complexity: 13822 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:09,929 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7229 states and 20111 transitions. cyclomatic complexity: 13822. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 17902 states and 49798 transitions. Complement of second has 7 states. [2025-04-26 18:44:09,930 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:44:09,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-04-26 18:44:09,930 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:44:09,930 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:09,930 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:44:09,931 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:09,931 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 18:44:09,931 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:09,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17902 states and 49798 transitions. [2025-04-26 18:44:10,055 INFO L131 ngComponentsAnalysis]: Automaton has 552 accepting balls. 1464 [2025-04-26 18:44:10,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17902 states to 14471 states and 39891 transitions. [2025-04-26 18:44:10,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6461 [2025-04-26 18:44:10,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6878 [2025-04-26 18:44:10,252 INFO L74 IsDeterministic]: Start isDeterministic. Operand 14471 states and 39891 transitions. [2025-04-26 18:44:10,252 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:10,252 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14471 states and 39891 transitions. [2025-04-26 18:44:10,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states and 39891 transitions. [2025-04-26 18:44:10,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11545. [2025-04-26 18:44:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11545 states, 11545 states have (on average 2.840450411433521) internal successors, (in total 32793), 11544 states have internal predecessors, (32793), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:10,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11545 states to 11545 states and 32793 transitions. [2025-04-26 18:44:10,619 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11545 states and 32793 transitions. [2025-04-26 18:44:10,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:44:10,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:44:10,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:44:10,625 INFO L87 Difference]: Start difference. First operand 11545 states and 32793 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:44:10,704 INFO L93 Difference]: Finished difference Result 3508 states and 9447 transitions. [2025-04-26 18:44:10,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3508 states and 9447 transitions. [2025-04-26 18:44:10,787 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 178 [2025-04-26 18:44:10,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3508 states to 3296 states and 8965 transitions. [2025-04-26 18:44:10,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1476 [2025-04-26 18:44:10,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1476 [2025-04-26 18:44:10,805 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3296 states and 8965 transitions. [2025-04-26 18:44:10,805 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:10,805 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3296 states and 8965 transitions. [2025-04-26 18:44:10,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3296 states and 8965 transitions. [2025-04-26 18:44:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3296 to 3291. [2025-04-26 18:44:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3291 states, 3291 states have (on average 2.7225767243998784) internal successors, (in total 8960), 3290 states have internal predecessors, (8960), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 8960 transitions. [2025-04-26 18:44:10,856 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3291 states and 8960 transitions. [2025-04-26 18:44:10,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:44:10,857 INFO L438 stractBuchiCegarLoop]: Abstraction has 3291 states and 8960 transitions. [2025-04-26 18:44:10,858 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:44:10,858 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3291 states and 8960 transitions. [2025-04-26 18:44:10,868 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 178 [2025-04-26 18:44:10,869 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:10,869 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:10,869 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:10,869 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:10,870 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[89] L33-->thread1FINAL: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[91] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[118] L18-1-->L42: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[121] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[124] L20-->L62: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[93] L42-->L46: Formula: (<= v_z2_2 v_x2_4) InVars {z2=v_z2_2, x2=v_x2_4} OutVars{z2=v_z2_2, x2=v_x2_4} AuxVars[] AssignedVars[]" "[95] L46-->thread2FINAL: Formula: (= v_g_1 (+ v_g_2 1)) InVars {g=v_g_2} OutVars{g=v_g_1} AuxVars[] AssignedVars[g]" "[98] $Ultimate##0-->L53-1: Formula: (< 0 v_g_3) InVars {g=v_g_3} OutVars{g=v_g_3} AuxVars[] AssignedVars[]" "[97] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[99] L53-1-->thread3FINAL: Formula: (<= v_x2_8 v_y2_2) InVars {y2=v_y2_2, x2=v_x2_8} OutVars{y2=v_y2_2, x2=v_x2_8} AuxVars[] AssignedVars[]" "[101] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 18:44:10,870 INFO L754 eck$LassoCheckResult]: Loop: "[104] L62-->L64: Formula: (< v_x3_1 v_z3_1) InVars {z3=v_z3_1, x3=v_x3_1} OutVars{z3=v_z3_1, x3=v_x3_1} AuxVars[] AssignedVars[]" "[106] L64-->L62: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 18:44:10,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:10,870 INFO L85 PathProgramCache]: Analyzing trace with hash -404745318, now seen corresponding path program 1 times [2025-04-26 18:44:10,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:10,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961235027] [2025-04-26 18:44:10,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:10,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:10,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:44:10,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:44:10,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,877 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:10,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:44:10,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:44:10,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:10,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash 4291, now seen corresponding path program 1 times [2025-04-26 18:44:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:10,887 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485511459] [2025-04-26 18:44:10,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:10,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:10,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:10,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:10,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,892 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:10,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:10,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:10,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:10,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:10,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1881776668, now seen corresponding path program 1 times [2025-04-26 18:44:10,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:10,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434051402] [2025-04-26 18:44:10,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:10,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:10,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:44:10,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:44:10,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,901 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:10,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:44:10,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:44:10,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:10,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:10,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:10,921 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:10,921 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:10,921 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:10,921 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:10,921 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:10,921 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:10,921 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:10,921 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:10,921 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:10,921 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:10,921 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:10,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:10,939 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:10,939 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:10,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:10,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:10,942 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:44:10,943 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:44:10,945 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:10,945 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:10,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:44:10,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:10,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:10,966 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:44:10,969 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:44:10,969 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:10,969 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:11,041 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:11,045 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:44:11,046 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:11,046 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:11,046 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:11,046 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:11,046 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:11,046 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,046 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:11,046 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:11,046 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:44:11,046 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:11,046 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:11,047 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:11,068 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:11,069 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:11,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:11,072 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:44:11,073 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:44:11,074 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:44:11,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:11,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:11,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:11,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:11,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:11,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:11,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:11,089 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:11,094 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:11,094 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:11,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:11,097 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:44:11,098 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:44:11,099 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:11,102 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:44:11,103 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:11,103 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:11,103 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z3, x3) = 1*z3 - 1*x3 Supporting invariants [] [2025-04-26 18:44:11,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:44:11,117 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:11,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:11,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:44:11,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:44:11,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:11,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:11,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:11,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:11,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:11,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:11,159 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:11,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:11,204 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:44:11,205 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:44:11,205 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3291 states and 8960 transitions. cyclomatic complexity: 6066 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:11,281 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3291 states and 8960 transitions. cyclomatic complexity: 6066. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 4167 states and 10633 transitions. Complement of second has 7 states. [2025-04-26 18:44:11,281 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:44:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-04-26 18:44:11,282 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:44:11,282 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:11,282 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 18:44:11,282 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:11,282 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 83 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 18:44:11,283 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:11,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4167 states and 10633 transitions. [2025-04-26 18:44:11,310 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 174 [2025-04-26 18:44:11,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4167 states to 3785 states and 9807 transitions. [2025-04-26 18:44:11,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1665 [2025-04-26 18:44:11,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1720 [2025-04-26 18:44:11,334 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3785 states and 9807 transitions. [2025-04-26 18:44:11,334 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:11,334 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3785 states and 9807 transitions. [2025-04-26 18:44:11,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3785 states and 9807 transitions. [2025-04-26 18:44:11,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3785 to 3610. [2025-04-26 18:44:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3610 states, 3610 states have (on average 2.6329639889196677) internal successors, (in total 9505), 3609 states have internal predecessors, (9505), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 9505 transitions. [2025-04-26 18:44:11,393 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3610 states and 9505 transitions. [2025-04-26 18:44:11,393 INFO L438 stractBuchiCegarLoop]: Abstraction has 3610 states and 9505 transitions. [2025-04-26 18:44:11,393 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:44:11,393 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3610 states and 9505 transitions. [2025-04-26 18:44:11,406 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 174 [2025-04-26 18:44:11,406 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:11,407 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:11,407 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:11,407 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:11,408 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[89] L33-->thread1FINAL: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[91] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[118] L18-1-->L42: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[121] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[124] L20-->L62: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[94] L42-->L44: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[103] L62-->L66: Formula: (<= v_z3_2 v_x3_4) InVars {z3=v_z3_2, x3=v_x3_4} OutVars{z3=v_z3_2, x3=v_x3_4} AuxVars[] AssignedVars[]" "[105] L66-->thread4FINAL: Formula: (= v_h_2 (+ v_h_3 1)) InVars {h=v_h_3} OutVars{h=v_h_2} AuxVars[] AssignedVars[h]" "[107] thread4FINAL-->thread4EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[96] L44-->L42: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[127] L21-->$Ultimate##0: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[108] $Ultimate##0-->L73-1: Formula: (< 0 v_h_4) InVars {h=v_h_4} OutVars{h=v_h_4} AuxVars[] AssignedVars[]" [2025-04-26 18:44:11,408 INFO L754 eck$LassoCheckResult]: Loop: "[110] L73-1-->L75: Formula: (< v_y3_1 v_x3_5) InVars {y3=v_y3_1, x3=v_x3_5} OutVars{y3=v_y3_1, x3=v_x3_5} AuxVars[] AssignedVars[]" "[112] L75-->L73-1: Formula: (= (+ v_x3_6 1) v_x3_7) InVars {x3=v_x3_7} OutVars{x3=v_x3_6} AuxVars[] AssignedVars[x3]" [2025-04-26 18:44:11,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:11,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1461094507, now seen corresponding path program 1 times [2025-04-26 18:44:11,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:11,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559356251] [2025-04-26 18:44:11,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:11,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:11,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:44:11,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:44:11,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:11,414 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:11,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:44:11,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:44:11,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:11,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:11,425 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:11,425 INFO L85 PathProgramCache]: Analyzing trace with hash 4483, now seen corresponding path program 1 times [2025-04-26 18:44:11,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:11,425 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64129118] [2025-04-26 18:44:11,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:11,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:11,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:11,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:11,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:11,434 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:11,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:11,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:11,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:11,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:11,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:11,438 INFO L85 PathProgramCache]: Analyzing trace with hash -342481043, now seen corresponding path program 1 times [2025-04-26 18:44:11,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:11,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740852027] [2025-04-26 18:44:11,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:11,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:11,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:44:11,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:44:11,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:11,448 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:11,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 18:44:11,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 18:44:11,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:11,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:11,480 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:11,480 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:11,480 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:11,480 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:11,480 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:11,480 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,480 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:11,480 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:11,480 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:11,480 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:11,480 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:11,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:11,497 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:11,497 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:11,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:11,499 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:11,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:44:11,501 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:11,502 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:11,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:11,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:11,553 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:11,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:44:11,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:11,556 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:11,631 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:11,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:44:11,636 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:11,636 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:11,636 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:11,636 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:11,636 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:11,636 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,636 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:11,636 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:11,636 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration5_Loop [2025-04-26 18:44:11,636 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:11,636 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:11,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:11,655 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:11,655 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:11,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:11,658 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:11,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:44:11,661 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:44:11,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:11,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:11,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:11,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:11,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:11,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:11,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:11,675 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:11,680 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:44:11,680 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:44:11,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:11,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:11,683 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:11,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:44:11,686 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:11,689 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:44:11,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:44:11,689 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:11,689 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:11,689 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y3, x3) = -1*y3 + 1*x3 Supporting invariants [] [2025-04-26 18:44:11,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:11,696 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:11,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:11,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:44:11,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:44:11,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:11,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:11,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:11,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:11,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:11,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:11,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:11,749 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:11,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:11,761 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:44:11,762 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:44:11,762 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3610 states and 9505 transitions. cyclomatic complexity: 6332 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:11,862 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3610 states and 9505 transitions. cyclomatic complexity: 6332. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 9294 states and 24147 transitions. Complement of second has 7 states. [2025-04-26 18:44:11,863 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:44:11,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (in total 16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 96 transitions. [2025-04-26 18:44:11,864 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:44:11,864 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:11,864 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 18:44:11,864 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:11,864 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 96 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 18:44:11,865 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:11,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9294 states and 24147 transitions. [2025-04-26 18:44:11,925 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 174 [2025-04-26 18:44:11,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9294 states to 5359 states and 13822 transitions. [2025-04-26 18:44:11,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2134 [2025-04-26 18:44:11,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2169 [2025-04-26 18:44:11,957 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5359 states and 13822 transitions. [2025-04-26 18:44:11,957 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:11,957 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5359 states and 13822 transitions. [2025-04-26 18:44:11,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5359 states and 13822 transitions. [2025-04-26 18:44:12,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5359 to 4435. [2025-04-26 18:44:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4435 states, 4435 states have (on average 2.5970687711386695) internal successors, (in total 11518), 4434 states have internal predecessors, (11518), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:12,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4435 states to 4435 states and 11518 transitions. [2025-04-26 18:44:12,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4435 states and 11518 transitions. [2025-04-26 18:44:12,040 INFO L438 stractBuchiCegarLoop]: Abstraction has 4435 states and 11518 transitions. [2025-04-26 18:44:12,040 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:44:12,041 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4435 states and 11518 transitions. [2025-04-26 18:44:12,061 INFO L131 ngComponentsAnalysis]: Automaton has 86 accepting balls. 174 [2025-04-26 18:44:12,061 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:44:12,061 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:44:12,062 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:44:12,062 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:44:12,062 INFO L752 eck$LassoCheckResult]: Stem: "[84] $Ultimate##0-->L18: Formula: (and (= v_g_4 0) (= v_h_1 0)) InVars {h=v_h_1, g=v_g_4} OutVars{h=v_h_1, g=v_g_4} AuxVars[] AssignedVars[]" "[115] L18-->L33: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[89] L33-->thread1FINAL: Formula: (<= v_z1_2 v_x1_4) InVars {x1=v_x1_4, z1=v_z1_2} OutVars{x1=v_x1_4, z1=v_z1_2} AuxVars[] AssignedVars[]" "[91] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[118] L18-1-->L42: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[121] L19-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[124] L20-->L62: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[94] L42-->L44: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[127] L21-->$Ultimate##0: Formula: (and (= v_thread5Thread1of1ForFork4_thidvar4_2 5) (= v_thread5Thread1of1ForFork4_thidvar1_2 5) (= v_thread5Thread1of1ForFork4_thidvar0_2 5) (= v_thread5Thread1of1ForFork4_thidvar3_2 5) (= v_thread5Thread1of1ForFork4_thidvar2_2 5)) InVars {} OutVars{thread5Thread1of1ForFork4_thidvar0=v_thread5Thread1of1ForFork4_thidvar0_2, thread5Thread1of1ForFork4_thidvar1=v_thread5Thread1of1ForFork4_thidvar1_2, thread5Thread1of1ForFork4_thidvar2=v_thread5Thread1of1ForFork4_thidvar2_2, thread5Thread1of1ForFork4_thidvar3=v_thread5Thread1of1ForFork4_thidvar3_2, thread5Thread1of1ForFork4_thidvar4=v_thread5Thread1of1ForFork4_thidvar4_2} AuxVars[] AssignedVars[thread5Thread1of1ForFork4_thidvar0, thread5Thread1of1ForFork4_thidvar1, thread5Thread1of1ForFork4_thidvar2, thread5Thread1of1ForFork4_thidvar3, thread5Thread1of1ForFork4_thidvar4]" "[128] thread1EXIT-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" "[96] L44-->L42: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" "[108] $Ultimate##0-->L73-1: Formula: (< 0 v_h_4) InVars {h=v_h_4} OutVars{h=v_h_4} AuxVars[] AssignedVars[]" "[94] L42-->L44: Formula: (< v_x2_1 v_z2_1) InVars {z2=v_z2_1, x2=v_x2_1} OutVars{z2=v_z2_1, x2=v_x2_1} AuxVars[] AssignedVars[]" "[109] L73-1-->thread5FINAL: Formula: (<= v_x3_8 v_y3_2) InVars {y3=v_y3_2, x3=v_x3_8} OutVars{y3=v_y3_2, x3=v_x3_8} AuxVars[] AssignedVars[]" [2025-04-26 18:44:12,062 INFO L754 eck$LassoCheckResult]: Loop: "[104] L62-->L64: Formula: (< v_x3_1 v_z3_1) InVars {z3=v_z3_1, x3=v_x3_1} OutVars{z3=v_z3_1, x3=v_x3_1} AuxVars[] AssignedVars[]" "[106] L64-->L62: Formula: (= v_x3_2 (+ v_x3_3 1)) InVars {x3=v_x3_3} OutVars{x3=v_x3_2} AuxVars[] AssignedVars[x3]" [2025-04-26 18:44:12,063 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:12,063 INFO L85 PathProgramCache]: Analyzing trace with hash -2125849373, now seen corresponding path program 1 times [2025-04-26 18:44:12,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:12,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693462829] [2025-04-26 18:44:12,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:44:12,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:12,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:44:12,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:44:12,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:12,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:12,108 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:44:12,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:44:12,108 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693462829] [2025-04-26 18:44:12,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693462829] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:44:12,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:44:12,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:44:12,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863734583] [2025-04-26 18:44:12,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:44:12,108 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:44:12,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:12,109 INFO L85 PathProgramCache]: Analyzing trace with hash 4291, now seen corresponding path program 2 times [2025-04-26 18:44:12,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:44:12,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297436554] [2025-04-26 18:44:12,109 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:44:12,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:44:12,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:12,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:12,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:44:12,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:12,113 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:44:12,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:12,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:12,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:12,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:44:12,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:44:12,142 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:12,142 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:12,142 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:12,142 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:12,142 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:44:12,142 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:12,142 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:12,142 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:12,142 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:44:12,142 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:12,142 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:12,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:12,159 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:12,160 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:44:12,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:12,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:12,162 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:12,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:44:12,166 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:44:12,166 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:12,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:12,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:12,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:12,184 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:12,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:44:12,190 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:44:12,190 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:44:12,256 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:44:12,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:44:12,261 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:44:12,261 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:44:12,261 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:44:12,261 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:44:12,261 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:44:12,262 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:12,262 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:44:12,262 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:44:12,262 INFO L132 ssoRankerPreferences]: Filename of dumped script: me1-5.c.bpl_petrified1_Iteration6_Loop [2025-04-26 18:44:12,262 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:44:12,262 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:44:12,262 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:44:12,281 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:44:12,282 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:44:12,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:12,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:12,284 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:12,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:44:12,287 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:44:12,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:44:12,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:44:12,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:44:12,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:44:12,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:44:12,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:44:12,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:44:12,302 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:44:12,305 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:44:12,305 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:44:12,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:44:12,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:44:12,309 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:44:12,311 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:44:12,314 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 18:44:12,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:44:12,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 18:44:12,315 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:44:12,315 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:44:12,315 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z3, x3) = 1*z3 - 1*x3 Supporting invariants [] [2025-04-26 18:44:12,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 18:44:12,322 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:44:12,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:44:12,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 18:44:12,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 18:44:12,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:12,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:12,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:44:12,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:12,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:44:12,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:44:12,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:44:12,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:44:12,376 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:44:12,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:44:12,387 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:44:12,388 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:44:12,388 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4435 states and 11518 transitions. cyclomatic complexity: 7602 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:12,449 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4435 states and 11518 transitions. cyclomatic complexity: 7602. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 6186 states and 15888 transitions. Complement of second has 6 states. [2025-04-26 18:44:12,450 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:44:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:12,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-26 18:44:12,451 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 14 letters. Loop has 2 letters. [2025-04-26 18:44:12,451 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:12,451 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 16 letters. Loop has 2 letters. [2025-04-26 18:44:12,451 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:12,451 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 18:44:12,451 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:44:12,451 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6186 states and 15888 transitions. [2025-04-26 18:44:12,487 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 90 [2025-04-26 18:44:12,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6186 states to 3841 states and 9724 transitions. [2025-04-26 18:44:12,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1550 [2025-04-26 18:44:12,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1550 [2025-04-26 18:44:12,509 INFO L74 IsDeterministic]: Start isDeterministic. Operand 3841 states and 9724 transitions. [2025-04-26 18:44:12,509 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:44:12,509 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3841 states and 9724 transitions. [2025-04-26 18:44:12,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states and 9724 transitions. [2025-04-26 18:44:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3840. [2025-04-26 18:44:12,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3840 states, 3840 states have (on average 2.53203125) internal successors, (in total 9723), 3839 states have internal predecessors, (9723), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3840 states to 3840 states and 9723 transitions. [2025-04-26 18:44:12,572 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3840 states and 9723 transitions. [2025-04-26 18:44:12,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:44:12,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:44:12,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:44:12,573 INFO L87 Difference]: Start difference. First operand 3840 states and 9723 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:44:12,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:44:12,588 INFO L93 Difference]: Finished difference Result 789 states and 1799 transitions. [2025-04-26 18:44:12,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 789 states and 1799 transitions. [2025-04-26 18:44:12,591 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:44:12,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 789 states to 0 states and 0 transitions. [2025-04-26 18:44:12,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:44:12,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:44:12,592 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:44:12,592 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:44:12,592 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:12,592 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:12,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:44:12,593 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:44:12,593 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:44:12,593 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:44:12,593 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:44:12,593 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:44:12,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:44:12,605 INFO L201 PluginConnector]: Adding new model me1-5.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:44:12 BoogieIcfgContainer [2025-04-26 18:44:12,605 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:44:12,606 INFO L158 Benchmark]: Toolchain (without parser) took 6954.20ms. Allocated memory was 155.2MB in the beginning and 1.1GB in the end (delta: 926.9MB). Free memory was 84.5MB in the beginning and 564.4MB in the end (delta: -479.9MB). Peak memory consumption was 452.7MB. Max. memory is 8.0GB. [2025-04-26 18:44:12,606 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:44:12,606 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.08ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 82.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:44:12,606 INFO L158 Benchmark]: Boogie Preprocessor took 17.34ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 81.5MB in the end (delta: 983.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:44:12,607 INFO L158 Benchmark]: RCFGBuilder took 208.54ms. Allocated memory is still 155.2MB. Free memory was 81.4MB in the beginning and 71.9MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:44:12,607 INFO L158 Benchmark]: BuchiAutomizer took 6692.82ms. Allocated memory was 155.2MB in the beginning and 1.1GB in the end (delta: 926.9MB). Free memory was 71.9MB in the beginning and 564.4MB in the end (delta: -492.5MB). Peak memory consumption was 440.2MB. Max. memory is 8.0GB. [2025-04-26 18:44:12,608 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.16ms. Allocated memory is still 155.2MB. Free memory is still 85.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.08ms. Allocated memory is still 155.2MB. Free memory was 84.5MB in the beginning and 82.6MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.34ms. Allocated memory is still 155.2MB. Free memory was 82.5MB in the beginning and 81.5MB in the end (delta: 983.6kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 208.54ms. Allocated memory is still 155.2MB. Free memory was 81.4MB in the beginning and 71.9MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 6692.82ms. Allocated memory was 155.2MB in the beginning and 1.1GB in the end (delta: 926.9MB). Free memory was 71.9MB in the beginning and 564.4MB in the end (delta: -492.5MB). Peak memory consumption was 440.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 1.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 1.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 7167 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.9s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 442 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 436 mSDsluCounter, 612 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 293 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 308 IncrementalHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 319 mSDtfsCounter, 308 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 49ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s InitialAbstractionConstructionTime: 0.8s InitialAbstraction: Time to compute Ample Reduction [ms]: 880, Number of transitions in reduction automaton: 8954, Number of states in reduction automaton: 3377, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (2 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z1 and consists of 4 locations. One deterministic module has affine ranking function z2 + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * y2 + x2 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z3 and consists of 4 locations. One deterministic module has affine ranking function x3 + -1 * y3 and consists of 4 locations. One deterministic module has affine ranking function -1 * x3 + z3 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:44:12,620 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...