/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/3_thr/m4.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:42:33,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:42:33,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:42:33,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:42:33,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:42:33,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:42:33,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:42:33,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:42:33,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:42:33,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:42:33,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:42:33,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:42:33,537 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:42:33,537 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:42:33,537 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:42:33,537 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:42:33,537 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:42:33,537 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:42:33,538 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:42:33,538 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:42:33,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:42:33,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:42:33,538 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:42:33,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:42:33,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:42:33,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:42:33,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:42:33,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:42:33,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:42:33,538 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:42:33,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:42:33,538 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:42:33,538 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:42:33,538 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:42:33,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:42:33,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:33,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:42:33,539 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:42:33,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:42:33,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:42:33,539 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:42:33,539 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:42:33,539 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:42:33,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:42:33,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:42:33,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:42:33,773 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:42:33,774 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:42:33,775 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/m4.c.bpl [2025-04-26 18:42:33,776 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/m4.c.bpl' [2025-04-26 18:42:33,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:42:33,789 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:42:33,791 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:33,791 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:42:33,791 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:42:33,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,816 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,822 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:42:33,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:42:33,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:42:33,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:42:33,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:42:33,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,831 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,831 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,834 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,834 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:42:33,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:42:33,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:42:33,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:42:33,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/1) ... [2025-04-26 18:42:33,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:42:33,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:33,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:33,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:42:33,897 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:42:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:42:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:42:33,897 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:42:33,897 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:42:33,897 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:42:33,898 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:42:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:42:33,898 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:42:33,898 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:42:33,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:42:33,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:42:33,899 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:42:33,933 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:42:33,935 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:42:34,012 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:42:34,013 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:42:34,020 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:42:34,020 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:42:34,021 INFO L201 PluginConnector]: Adding new model m4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:34 BoogieIcfgContainer [2025-04-26 18:42:34,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:42:34,021 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:42:34,021 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:42:34,029 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:42:34,029 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:34,029 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m4.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:42:33" (1/2) ... [2025-04-26 18:42:34,030 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2566ad5 and model type m4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:42:34, skipping insertion in model container [2025-04-26 18:42:34,030 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:42:34,030 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "m4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:42:34" (2/2) ... [2025-04-26 18:42:34,033 INFO L376 chiAutomizerObserver]: Analyzing ICFG m4.c.bpl [2025-04-26 18:42:34,086 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:42:34,128 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:42:34,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:42:34,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:34,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:34,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:42:34,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 79 flow [2025-04-26 18:42:34,192 INFO L116 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-04-26 18:42:34,194 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:42:34,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 3/23 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 18:42:34,200 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 79 flow [2025-04-26 18:42:34,203 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 23 transitions, 64 flow [2025-04-26 18:42:34,203 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 23 transitions, 64 flow [2025-04-26 18:42:34,204 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 30 places, 23 transitions, 64 flow [2025-04-26 18:42:34,228 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 189 states, 188 states have (on average 2.9202127659574466) internal successors, (in total 549), 188 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:34,229 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 189 states, 188 states have (on average 2.9202127659574466) internal successors, (in total 549), 188 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:34,231 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:42:34,325 WARN L140 AmpleReduction]: Number of pruned transitions: 186 [2025-04-26 18:42:34,326 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:42:34,326 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 44 [2025-04-26 18:42:34,326 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:30 [2025-04-26 18:42:34,326 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:103 [2025-04-26 18:42:34,326 WARN L145 AmpleReduction]: Times succ was already a loop node:78 [2025-04-26 18:42:34,326 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:3 [2025-04-26 18:42:34,326 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:42:34,327 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 178 states, 177 states have (on average 1.8531073446327684) internal successors, (in total 328), 177 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:34,333 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:42:34,333 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:42:34,333 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:42:34,333 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:42:34,333 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:42:34,333 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:42:34,333 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:42:34,333 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:42:34,335 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 178 states, 177 states have (on average 1.8531073446327684) internal successors, (in total 328), 177 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:34,347 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 104 [2025-04-26 18:42:34,347 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:34,347 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:34,349 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:34,349 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:34,349 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:42:34,350 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 178 states, 177 states have (on average 1.8531073446327684) internal successors, (in total 328), 177 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:34,356 INFO L131 ngComponentsAnalysis]: Automaton has 41 accepting balls. 104 [2025-04-26 18:42:34,356 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:34,356 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:34,356 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:42:34,356 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:34,359 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L12: Formula: (= v_f_6 0) InVars {} OutVars{f=v_f_6} AuxVars[] AssignedVars[f]" "[73] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:42:34,359 INFO L754 eck$LassoCheckResult]: Loop: "[57] L23-->L25: Formula: (< v_x1_1 v_z_1) InVars {x1=v_x1_1, z=v_z_1} OutVars{x1=v_x1_1, z=v_z_1} AuxVars[] AssignedVars[]" "[59] L25-->L23: Formula: (= v_x1_2 (+ v_x1_3 1)) InVars {x1=v_x1_3} OutVars{x1=v_x1_2} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:34,362 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:34,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2522, now seen corresponding path program 1 times [2025-04-26 18:42:34,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:34,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990085049] [2025-04-26 18:42:34,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:34,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:34,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:34,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:34,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:34,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:34,417 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:34,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:34,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:34,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:34,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:34,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:34,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:34,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2787, now seen corresponding path program 1 times [2025-04-26 18:42:34,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:34,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109608455] [2025-04-26 18:42:34,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:34,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:34,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:34,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:34,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:34,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:34,438 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:34,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:34,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:34,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:34,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:34,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:34,443 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:34,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2425468, now seen corresponding path program 1 times [2025-04-26 18:42:34,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:34,443 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355186400] [2025-04-26 18:42:34,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:34,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:34,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:34,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:34,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:34,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:34,448 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:34,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:34,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:34,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:34,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:34,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:34,501 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:34,501 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:34,501 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:34,502 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:34,502 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:34,502 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:34,502 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:34,502 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:34,502 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:34,502 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:34,502 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:34,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:34,581 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:34,582 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:34,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:34,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:34,586 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:34,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:42:34,589 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:34,589 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:34,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:42:34,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:34,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:34,616 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:34,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:34,619 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:34,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:42:34,705 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:34,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:42:34,710 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:34,710 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:34,710 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:34,710 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:34,711 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:34,711 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:34,711 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:34,711 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:34,711 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration1_Loop [2025-04-26 18:42:34,711 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:34,711 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:34,712 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:34,742 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:34,761 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:34,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:34,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:34,764 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:34,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:42:34,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:34,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:34,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:34,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:34,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:34,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:34,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:34,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:34,789 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:34,795 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:34,795 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:34,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:34,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:34,798 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:34,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:42:34,801 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:34,805 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:42:34,805 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:34,806 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:34,806 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z, x1) = 1*z - 1*x1 Supporting invariants [] [2025-04-26 18:42:34,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:42:34,815 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:34,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:34,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:34,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:34,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:34,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:34,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:34,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:34,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:34,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:34,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:34,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:34,906 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:34,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:34,945 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:34,947 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 178 states, 177 states have (on average 1.8531073446327684) internal successors, (in total 328), 177 states have internal predecessors, (328), 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:42:35,063 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 178 states, 177 states have (on average 1.8531073446327684) internal successors, (in total 328), 177 states have internal predecessors, (328), 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 552 states and 1041 transitions. Complement of second has 7 states. [2025-04-26 18:42:35,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:35,069 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:42:35,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-04-26 18:42:35,075 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:42:35,075 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:35,075 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:35,075 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:35,075 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:42:35,076 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:35,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 552 states and 1041 transitions. [2025-04-26 18:42:35,090 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 120 [2025-04-26 18:42:35,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 552 states to 333 states and 654 transitions. [2025-04-26 18:42:35,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 232 [2025-04-26 18:42:35,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2025-04-26 18:42:35,099 INFO L74 IsDeterministic]: Start isDeterministic. Operand 333 states and 654 transitions. [2025-04-26 18:42:35,099 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:35,099 INFO L218 hiAutomatonCegarLoop]: Abstraction has 333 states and 654 transitions. [2025-04-26 18:42:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states and 654 transitions. [2025-04-26 18:42:35,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 240. [2025-04-26 18:42:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 240 states have (on average 2.029166666666667) internal successors, (in total 487), 239 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 487 transitions. [2025-04-26 18:42:35,136 INFO L240 hiAutomatonCegarLoop]: Abstraction has 240 states and 487 transitions. [2025-04-26 18:42:35,136 INFO L438 stractBuchiCegarLoop]: Abstraction has 240 states and 487 transitions. [2025-04-26 18:42:35,136 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:42:35,136 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 240 states and 487 transitions. [2025-04-26 18:42:35,140 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 106 [2025-04-26 18:42:35,140 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:35,140 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:35,141 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:42:35,141 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:35,144 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L12: Formula: (= v_f_6 0) InVars {} OutVars{f=v_f_6} AuxVars[] AssignedVars[f]" "[73] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[76] L12-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[79] L13-->L43: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:42:35,144 INFO L754 eck$LassoCheckResult]: Loop: "[67] L43-->L45: Formula: (< v_x2_1 v_w_1) InVars {x2=v_x2_1, w=v_w_1} OutVars{x2=v_x2_1, w=v_w_1} AuxVars[] AssignedVars[]" "[69] L45-->L43: 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:42:35,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2426077, now seen corresponding path program 1 times [2025-04-26 18:42:35,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:35,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630867430] [2025-04-26 18:42:35,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:35,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:35,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:35,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:35,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,152 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:35,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:35,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:35,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:35,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,159 INFO L85 PathProgramCache]: Analyzing trace with hash 3107, now seen corresponding path program 1 times [2025-04-26 18:42:35,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:35,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243904711] [2025-04-26 18:42:35,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:35,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:35,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:35,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:35,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,163 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:35,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:35,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:35,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:35,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1963505153, now seen corresponding path program 1 times [2025-04-26 18:42:35,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:35,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792459994] [2025-04-26 18:42:35,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:35,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:35,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:35,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:35,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,178 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:35,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:35,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:35,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:35,203 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:35,204 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:35,204 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:35,204 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:35,204 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:35,204 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,204 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:35,204 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:35,204 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:35,204 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:35,204 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:35,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:35,223 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:35,223 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:35,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,257 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:35,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:42:35,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:35,262 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:35,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:35,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,281 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:35,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:42:35,285 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:35,285 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:35,356 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:35,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:35,362 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:35,362 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:35,362 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:35,362 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:35,362 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:35,362 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,362 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:35,362 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:35,362 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration2_Loop [2025-04-26 18:42:35,362 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:35,362 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:35,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:35,383 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:35,383 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:35,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,385 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:35,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:42:35,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:35,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:35,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:35,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:35,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:35,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:35,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:35,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:35,402 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:35,407 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:35,407 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:35,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,409 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:35,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:42:35,412 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:35,416 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:42:35,416 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:35,416 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:35,416 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(w, x2) = 1*w - 1*x2 Supporting invariants [] [2025-04-26 18:42:35,423 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:42:35,424 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:35,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:42:35,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:42:35,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:35,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:35,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:35,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:35,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:35,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:35,460 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:35,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:35,474 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:35,474 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 240 states and 487 transitions. cyclomatic complexity: 304 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:35,518 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 240 states and 487 transitions. cyclomatic complexity: 304. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 503 states and 1014 transitions. Complement of second has 6 states. [2025-04-26 18:42:35,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:35,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:35,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-04-26 18:42:35,519 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:42:35,519 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:35,519 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:42:35,520 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:35,520 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 18:42:35,520 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:35,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 503 states and 1014 transitions. [2025-04-26 18:42:35,524 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 66 [2025-04-26 18:42:35,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 503 states to 274 states and 552 transitions. [2025-04-26 18:42:35,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 [2025-04-26 18:42:35,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2025-04-26 18:42:35,527 INFO L74 IsDeterministic]: Start isDeterministic. Operand 274 states and 552 transitions. [2025-04-26 18:42:35,527 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:35,527 INFO L218 hiAutomatonCegarLoop]: Abstraction has 274 states and 552 transitions. [2025-04-26 18:42:35,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states and 552 transitions. [2025-04-26 18:42:35,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 256. [2025-04-26 18:42:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 256 states have (on average 2.03515625) internal successors, (in total 521), 255 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 521 transitions. [2025-04-26 18:42:35,535 INFO L240 hiAutomatonCegarLoop]: Abstraction has 256 states and 521 transitions. [2025-04-26 18:42:35,535 INFO L438 stractBuchiCegarLoop]: Abstraction has 256 states and 521 transitions. [2025-04-26 18:42:35,535 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:35,535 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 256 states and 521 transitions. [2025-04-26 18:42:35,536 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 66 [2025-04-26 18:42:35,536 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:35,536 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:35,536 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:42:35,536 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:35,537 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L12: Formula: (= v_f_6 0) InVars {} OutVars{f=v_f_6} AuxVars[] AssignedVars[f]" "[73] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[76] L12-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[61] $Ultimate##0-->L34-1: Formula: (< 1 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[56] L23-->L27: Formula: (<= v_z_2 v_x1_4) InVars {x1=v_x1_4, z=v_z_2} OutVars{x1=v_x1_4, z=v_z_2} AuxVars[] AssignedVars[]" "[58] L27-->thread1FINAL: Formula: (= (+ v_f_2 1) v_f_1) InVars {f=v_f_2} OutVars{f=v_f_1} AuxVars[] AssignedVars[f]" [2025-04-26 18:42:35,537 INFO L754 eck$LassoCheckResult]: Loop: "[63] L34-1-->L36: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[65] L36-->L34-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:35,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1963522803, now seen corresponding path program 1 times [2025-04-26 18:42:35,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:35,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116524519] [2025-04-26 18:42:35,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:35,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:35,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:35,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:35,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:35,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:35,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116524519] [2025-04-26 18:42:35,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116524519] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:35,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:35,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:42:35,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752493414] [2025-04-26 18:42:35,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:35,579 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:35,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,579 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 1 times [2025-04-26 18:42:35,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:35,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027273621] [2025-04-26 18:42:35,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:35,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:35,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:35,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:35,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:35,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:35,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:35,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:35,601 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:35,601 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:35,601 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:35,601 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:35,601 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:35,601 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,601 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:35,601 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:35,601 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:35,601 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:35,601 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:35,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:35,619 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:35,619 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:35,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,621 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:35,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:42:35,624 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:35,624 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:35,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:35,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,650 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:35,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:42:35,655 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:35,655 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:35,730 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:35,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:42:35,735 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:35,735 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:35,735 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:35,735 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:35,735 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:35,735 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,735 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:35,735 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:35,735 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration3_Loop [2025-04-26 18:42:35,735 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:35,735 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:35,736 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:35,759 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:35,760 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:35,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,762 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:35,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:42:35,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:35,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:35,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:35,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:35,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:35,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:35,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:35,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:35,776 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:35,777 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:35,777 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:35,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:35,779 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:35,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:42:35,780 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:35,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:42:35,783 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:35,783 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:35,783 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, x1) = -1*y + 1*x1 Supporting invariants [] [2025-04-26 18:42:35,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:42:35,790 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:35,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:35,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:35,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:35,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:35,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:35,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:35,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:35,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:35,824 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:35,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:35,838 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:35,838 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 256 states and 521 transitions. cyclomatic complexity: 321 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:35,883 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 256 states and 521 transitions. cyclomatic complexity: 321. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 447 states and 892 transitions. Complement of second has 6 states. [2025-04-26 18:42:35,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:35,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:35,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2025-04-26 18:42:35,886 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:42:35,886 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:35,886 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:42:35,886 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:35,886 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:42:35,886 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:35,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 447 states and 892 transitions. [2025-04-26 18:42:35,891 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 32 [2025-04-26 18:42:35,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 447 states to 171 states and 344 transitions. [2025-04-26 18:42:35,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2025-04-26 18:42:35,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2025-04-26 18:42:35,894 INFO L74 IsDeterministic]: Start isDeterministic. Operand 171 states and 344 transitions. [2025-04-26 18:42:35,894 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:35,894 INFO L218 hiAutomatonCegarLoop]: Abstraction has 171 states and 344 transitions. [2025-04-26 18:42:35,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 344 transitions. [2025-04-26 18:42:35,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-04-26 18:42:35,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 171 states have (on average 2.0116959064327484) internal successors, (in total 344), 170 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:35,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 344 transitions. [2025-04-26 18:42:35,902 INFO L240 hiAutomatonCegarLoop]: Abstraction has 171 states and 344 transitions. [2025-04-26 18:42:35,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:35,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:35,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:35,904 INFO L87 Difference]: Start difference. First operand 171 states and 344 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:35,917 INFO L93 Difference]: Finished difference Result 55 states and 103 transitions. [2025-04-26 18:42:35,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 103 transitions. [2025-04-26 18:42:35,918 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2025-04-26 18:42:35,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 103 transitions. [2025-04-26 18:42:35,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-04-26 18:42:35,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-04-26 18:42:35,918 INFO L74 IsDeterministic]: Start isDeterministic. Operand 55 states and 103 transitions. [2025-04-26 18:42:35,919 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:35,919 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 103 transitions. [2025-04-26 18:42:35,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 103 transitions. [2025-04-26 18:42:35,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-04-26 18:42:35,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.8727272727272728) internal successors, (in total 103), 54 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 103 transitions. [2025-04-26 18:42:35,921 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 103 transitions. [2025-04-26 18:42:35,922 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:35,922 INFO L438 stractBuchiCegarLoop]: Abstraction has 55 states and 103 transitions. [2025-04-26 18:42:35,922 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:35,922 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 103 transitions. [2025-04-26 18:42:35,922 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2025-04-26 18:42:35,922 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:35,922 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:35,923 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:35,923 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:35,923 INFO L752 eck$LassoCheckResult]: Stem: "[48] $Ultimate##0-->L12: Formula: (= v_f_6 0) InVars {} OutVars{f=v_f_6} AuxVars[] AssignedVars[f]" "[73] L12-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[76] L12-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[79] L13-->L43: 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]" "[66] L43-->L47: Formula: (<= v_w_2 v_x2_4) InVars {x2=v_x2_4, w=v_w_2} OutVars{x2=v_x2_4, w=v_w_2} AuxVars[] AssignedVars[]" "[68] L47-->thread3FINAL: Formula: (= v_f_4 (+ v_f_5 1)) InVars {f=v_f_5} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[70] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[61] $Ultimate##0-->L34-1: Formula: (< 1 v_f_3) InVars {f=v_f_3} OutVars{f=v_f_3} AuxVars[] AssignedVars[]" "[63] L34-1-->L36: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[65] L36-->L34-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:35,923 INFO L754 eck$LassoCheckResult]: Loop: "[63] L34-1-->L36: Formula: (< v_y_1 v_x1_5) InVars {y=v_y_1, x1=v_x1_5} OutVars{y=v_y_1, x1=v_x1_5} AuxVars[] AssignedVars[]" "[65] L36-->L34-1: Formula: (= v_x1_7 (+ v_x1_6 1)) InVars {x1=v_x1_7} OutVars{x1=v_x1_6} AuxVars[] AssignedVars[x1]" [2025-04-26 18:42:35,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1217528120, now seen corresponding path program 1 times [2025-04-26 18:42:35,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:35,924 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017801711] [2025-04-26 18:42:35,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:35,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:35,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:35,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:35,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:35,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:35,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:35,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017801711] [2025-04-26 18:42:35,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017801711] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:35,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:35,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:42:35,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004525619] [2025-04-26 18:42:35,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:35,971 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:35,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:35,971 INFO L85 PathProgramCache]: Analyzing trace with hash 2979, now seen corresponding path program 2 times [2025-04-26 18:42:35,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:35,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595031833] [2025-04-26 18:42:35,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:35,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:35,973 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:35,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:35,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:35,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,974 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:35,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:35,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:35,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:35,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:35,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:35,992 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:35,992 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:35,992 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:35,992 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:35,992 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:35,992 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:35,992 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:35,992 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:35,992 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:35,992 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:35,992 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:35,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:36,010 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:36,010 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:36,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:36,012 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:36,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:42:36,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:36,018 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:36,041 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:42:36,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:36,044 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:36,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:42:36,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:36,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:36,120 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:36,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:36,125 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:36,125 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:36,125 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:36,125 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:36,125 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:36,125 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,125 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:36,125 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:36,125 INFO L132 ssoRankerPreferences]: Filename of dumped script: m4.c.bpl_petrified1_Iteration4_Loop [2025-04-26 18:42:36,126 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:36,126 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:36,126 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:36,150 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:36,150 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:36,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:36,153 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:36,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:42:36,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:42:36,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:36,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:36,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:36,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:36,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:36,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:36,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:36,167 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:36,171 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:36,171 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:36,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:36,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:36,174 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:36,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:42:36,175 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:36,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:36,180 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:36,181 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:36,181 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, y) = 1*x1 - 1*y Supporting invariants [] [2025-04-26 18:42:36,187 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:42:36,188 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:36,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:36,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:42:36,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:42:36,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:36,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:36,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:36,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:36,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:36,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:36,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:36,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:36,229 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:36,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:36,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:42:36,242 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:42:36,242 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 103 transitions. cyclomatic complexity: 59 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:36,276 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 103 transitions. cyclomatic complexity: 59. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 76 states and 148 transitions. Complement of second has 7 states. [2025-04-26 18:42:36,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:42:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:36,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2025-04-26 18:42:36,277 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:42:36,277 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:36,277 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 18:42:36,278 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:36,278 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 18:42:36,278 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:36,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 148 transitions. [2025-04-26 18:42:36,278 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2025-04-26 18:42:36,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 72 states and 140 transitions. [2025-04-26 18:42:36,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2025-04-26 18:42:36,279 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2025-04-26 18:42:36,279 INFO L74 IsDeterministic]: Start isDeterministic. Operand 72 states and 140 transitions. [2025-04-26 18:42:36,279 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:36,279 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 140 transitions. [2025-04-26 18:42:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 140 transitions. [2025-04-26 18:42:36,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2025-04-26 18:42:36,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.0) internal successors, (in total 130), 64 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:36,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 130 transitions. [2025-04-26 18:42:36,281 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 130 transitions. [2025-04-26 18:42:36,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:36,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:42:36,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:42:36,282 INFO L87 Difference]: Start difference. First operand 65 states and 130 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:36,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:36,290 INFO L93 Difference]: Finished difference Result 37 states and 63 transitions. [2025-04-26 18:42:36,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 63 transitions. [2025-04-26 18:42:36,291 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:36,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2025-04-26 18:42:36,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:36,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:36,291 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:36,291 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:36,291 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:36,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:36,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:42:36,292 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:36,292 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:36,292 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:36,292 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:36,292 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:36,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:42:36,308 INFO L201 PluginConnector]: Adding new model m4.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:36 BoogieIcfgContainer [2025-04-26 18:42:36,308 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:36,309 INFO L158 Benchmark]: Toolchain (without parser) took 2519.27ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 87.6MB in the beginning and 33.3MB in the end (delta: 54.3MB). Peak memory consumption was 52.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:36,309 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.74ms. Allocated memory is still 159.4MB. Free memory was 88.5MB in the beginning and 88.4MB in the end (delta: 107.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:36,309 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.13ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 85.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:36,309 INFO L158 Benchmark]: Boogie Preprocessor took 22.02ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.9MB in the end (delta: 986.7kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:36,310 INFO L158 Benchmark]: RCFGBuilder took 173.58ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 75.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:42:36,310 INFO L158 Benchmark]: BuchiAutomizer took 2286.56ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.9MB in the beginning and 33.3MB in the end (delta: 41.7MB). Peak memory consumption was 39.6MB. Max. memory is 8.0GB. [2025-04-26 18:42:36,311 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.74ms. Allocated memory is still 159.4MB. Free memory was 88.5MB in the beginning and 88.4MB in the end (delta: 107.9kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.13ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 85.0MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.02ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 83.9MB in the end (delta: 986.7kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 173.58ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 75.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2286.56ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.9MB in the beginning and 33.3MB in the end (delta: 41.7MB). Peak memory consumption was 39.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 118 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 151 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 147 mSDsluCounter, 191 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 104 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 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: 44ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 204, Number of transitions in reduction automaton: 328, Number of states in reduction automaton: 178, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x1 + z and consists of 4 locations. One deterministic module has affine ranking function w + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * y and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * y and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:36,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...