/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/2_thr/adfg_2_seq_1.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:57,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:57,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:57,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:57,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:57,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:57,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:57,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:57,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:57,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:57,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:57,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:57,554 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:57,554 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:57,554 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:57,554 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:57,554 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:57,555 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:57,555 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:57,555 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:57,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:57,556 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:57,556 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:57,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:57,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:57,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:57,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:57,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:57,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:57,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:57,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:57,556 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:57,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:57,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:57,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:57,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:57,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:57,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:57,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:57,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:57,557 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:57,557 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:57,557 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:57,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:57,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:57,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:57,778 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:57,778 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:57,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/adfg_2_seq_1.c.bpl [2025-04-26 18:41:57,779 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/adfg_2_seq_1.c.bpl' [2025-04-26 18:41:57,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:57,791 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:57,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:57,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:57,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:57,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:57" (1/1) ... [2025-04-26 18:41:57,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:57" (1/1) ... [2025-04-26 18:41:57,826 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:57,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:57,829 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:57,829 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:57,829 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:57,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:57" (1/1) ... [2025-04-26 18:41:57,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:57" (1/1) ... [2025-04-26 18:41:57,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:57" (1/1) ... [2025-04-26 18:41:57,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:57" (1/1) ... [2025-04-26 18:41:57,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:57" (1/1) ... [2025-04-26 18:41:57,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:57" (1/1) ... [2025-04-26 18:41:57,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:57" (1/1) ... [2025-04-26 18:41:57,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:57" (1/1) ... [2025-04-26 18:41:57,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:57" (1/1) ... [2025-04-26 18:41:57,856 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:57,857 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:57,857 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:57,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:57,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:57" (1/1) ... [2025-04-26 18:41:57,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:57,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:57,886 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:41:57,891 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:41:57,905 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:57,906 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:57,906 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:57,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:57,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:57,907 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:41:57,945 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:57,946 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:58,036 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:58,037 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:58,047 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:58,047 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:58,047 INFO L201 PluginConnector]: Adding new model adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:58 BoogieIcfgContainer [2025-04-26 18:41:58,047 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:58,048 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:58,048 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:58,052 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:58,052 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:58,052 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:57" (1/2) ... [2025-04-26 18:41:58,054 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f8dabfb and model type adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:58, skipping insertion in model container [2025-04-26 18:41:58,055 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:58,055 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:58" (2/2) ... [2025-04-26 18:41:58,056 INFO L376 chiAutomizerObserver]: Analyzing ICFG adfg_2_seq_1.c.bpl [2025-04-26 18:41:58,108 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:41:58,140 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:58,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:58,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,143 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:41:58,144 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:41:58,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 44 transitions, 102 flow [2025-04-26 18:41:58,220 INFO L116 PetriNetUnfolderBase]: 10/40 cut-off events. [2025-04-26 18:41:58,222 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:41:58,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 40 events. 10/40 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 84 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 38. Up to 4 conditions per place. [2025-04-26 18:41:58,225 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 44 transitions, 102 flow [2025-04-26 18:41:58,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 40 transitions, 92 flow [2025-04-26 18:41:58,230 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 37 places, 40 transitions, 92 flow [2025-04-26 18:41:58,231 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 40 transitions, 92 flow [2025-04-26 18:41:58,263 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 206 states, 205 states have (on average 2.5365853658536586) internal successors, (in total 520), 205 states have internal predecessors, (520), 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:41:58,264 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 206 states, 205 states have (on average 2.5365853658536586) internal successors, (in total 520), 205 states have internal predecessors, (520), 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:41:58,268 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:58,386 WARN L140 AmpleReduction]: Number of pruned transitions: 120 [2025-04-26 18:41:58,387 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:58,387 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 48 [2025-04-26 18:41:58,387 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:35 [2025-04-26 18:41:58,387 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:96 [2025-04-26 18:41:58,387 WARN L145 AmpleReduction]: Times succ was already a loop node:42 [2025-04-26 18:41:58,387 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:58 [2025-04-26 18:41:58,387 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:58,388 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 180 states, 179 states have (on average 1.8268156424581006) internal successors, (in total 327), 179 states have internal predecessors, (327), 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:41:58,395 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:58,395 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:58,395 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:58,395 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:58,395 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:58,395 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:58,395 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:58,395 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:58,399 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 180 states, 179 states have (on average 1.8268156424581006) internal successors, (in total 327), 179 states have internal predecessors, (327), 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:41:58,412 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 136 [2025-04-26 18:41:58,412 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:58,412 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:58,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:58,416 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:58,416 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:58,417 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 180 states, 179 states have (on average 1.8268156424581006) internal successors, (in total 327), 179 states have internal predecessors, (327), 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:41:58,420 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 136 [2025-04-26 18:41:58,420 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:58,420 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:58,421 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:58,421 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:58,424 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[120] L27-->L35-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" [2025-04-26 18:41:58,424 INFO L754 eck$LassoCheckResult]: Loop: "[123] L35-2-->L35: Formula: (<= v_x1_1 v_n_2) InVars {x1=v_x1_1, n=v_n_2} OutVars{x1=v_x1_1, n=v_n_2} AuxVars[] AssignedVars[]" "[125] L35-->L37: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[129] L37-->L35-2: Formula: (= (+ v_x1_3 v_t_3) v_x1_2) InVars {x1=v_x1_3, t=v_t_3} OutVars{x1=v_x1_2, t=v_t_3} AuxVars[] AssignedVars[x1]" [2025-04-26 18:41:58,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:58,428 INFO L85 PathProgramCache]: Analyzing trace with hash 182524, now seen corresponding path program 1 times [2025-04-26 18:41:58,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:58,434 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759539582] [2025-04-26 18:41:58,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:58,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:58,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:58,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:58,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:58,479 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:58,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:58,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:58,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:58,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:58,500 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:58,500 INFO L85 PathProgramCache]: Analyzing trace with hash 151998, now seen corresponding path program 1 times [2025-04-26 18:41:58,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:58,500 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836907074] [2025-04-26 18:41:58,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:58,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:58,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:58,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:58,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:58,509 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:58,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:58,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:58,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:58,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:58,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:58,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1142727395, now seen corresponding path program 1 times [2025-04-26 18:41:58,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:58,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266757641] [2025-04-26 18:41:58,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:58,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:58,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:58,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:58,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:58,525 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:58,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:58,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:58,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:58,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:58,624 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:58,624 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:58,625 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:58,625 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:58,625 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:58,625 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,625 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:58,625 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:58,625 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:41:58,625 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:58,625 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:58,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:58,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:58,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:58,748 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:58,748 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:58,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,752 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:41:58,753 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:41:58,755 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:58,755 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:58,776 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:41:58,776 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=1} Honda state: {b=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:41:58,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:58,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,787 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:41:58,789 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:41:58,790 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:58,790 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:58,800 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:41:58,800 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:41:58,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:58,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,809 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:41:58,810 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:41:58,812 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:58,812 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:58,830 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:41:58,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,832 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:41:58,834 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:41:58,836 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:58,836 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:58,982 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:58,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:41:58,988 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:58,988 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:58,988 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:58,989 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:58,989 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:58,989 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,989 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:58,990 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:58,990 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:41:58,990 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:58,990 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:58,991 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:58,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:59,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:59,038 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:59,040 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:59,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:59,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:59,062 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:41:59,065 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:41:59,066 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:41:59,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:59,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:59,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:59,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:59,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:59,085 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:59,089 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:59,095 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:41:59,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:59,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:59,100 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:41:59,101 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:41:59,101 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:41:59,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:59,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:59,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:59,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:59,118 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:59,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:59,126 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:59,130 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:41:59,130 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:41:59,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:59,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:59,209 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:41:59,211 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:41:59,212 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:59,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:41:59,229 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:41:59,229 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:59,230 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(t, x1, n) = 1*t - 2*x1 + 2*n Supporting invariants [1*t - 1 >= 0] [2025-04-26 18:41:59,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:41:59,268 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:59,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:59,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:59,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:59,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:59,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:41:59,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:59,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:59,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:59,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:59,321 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:41:59,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:59,360 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:41:59,383 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:41:59,385 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 180 states, 179 states have (on average 1.8268156424581006) internal successors, (in total 327), 179 states have internal predecessors, (327), 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 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:41:59,533 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 180 states, 179 states have (on average 1.8268156424581006) internal successors, (in total 327), 179 states have internal predecessors, (327), 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 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 679 states and 1237 transitions. Complement of second has 8 states. [2025-04-26 18:41:59,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 2 accepting loop states [2025-04-26 18:41:59,537 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:41:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2025-04-26 18:41:59,542 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 90 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:41:59,542 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:59,542 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 90 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:41:59,542 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:59,542 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 90 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:41:59,542 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:59,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 679 states and 1237 transitions. [2025-04-26 18:41:59,556 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 348 [2025-04-26 18:41:59,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 679 states to 520 states and 945 transitions. [2025-04-26 18:41:59,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 450 [2025-04-26 18:41:59,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2025-04-26 18:41:59,569 INFO L74 IsDeterministic]: Start isDeterministic. Operand 520 states and 945 transitions. [2025-04-26 18:41:59,569 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:59,569 INFO L218 hiAutomatonCegarLoop]: Abstraction has 520 states and 945 transitions. [2025-04-26 18:41:59,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states and 945 transitions. [2025-04-26 18:41:59,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 237. [2025-04-26 18:41:59,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 237 states have (on average 1.8818565400843883) internal successors, (in total 446), 236 states have internal predecessors, (446), 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:41:59,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 446 transitions. [2025-04-26 18:41:59,601 INFO L240 hiAutomatonCegarLoop]: Abstraction has 237 states and 446 transitions. [2025-04-26 18:41:59,601 INFO L438 stractBuchiCegarLoop]: Abstraction has 237 states and 446 transitions. [2025-04-26 18:41:59,601 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:59,601 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 237 states and 446 transitions. [2025-04-26 18:41:59,603 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 136 [2025-04-26 18:41:59,603 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:59,603 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:59,603 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:59,603 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:41:59,604 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[119] $Ultimate##0-->L31: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[121] L31-->L35-2: Formula: (= (+ v_t_2 1) 0) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" [2025-04-26 18:41:59,604 INFO L754 eck$LassoCheckResult]: Loop: "[123] L35-2-->L35: Formula: (<= v_x1_1 v_n_2) InVars {x1=v_x1_1, n=v_n_2} OutVars{x1=v_x1_1, n=v_n_2} AuxVars[] AssignedVars[]" "[126] L35-->L41: Formula: (< v_b_4 1) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[130] L41-->L35-2: Formula: (= (+ v_x1_4 v_t_4) v_x1_5) InVars {x1=v_x1_5, t=v_t_4} OutVars{x1=v_x1_4, t=v_t_4} AuxVars[] AssignedVars[x1]" [2025-04-26 18:41:59,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:59,604 INFO L85 PathProgramCache]: Analyzing trace with hash 182556, now seen corresponding path program 1 times [2025-04-26 18:41:59,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:59,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780051373] [2025-04-26 18:41:59,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:59,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:59,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:59,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:59,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:59,607 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:59,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:59,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:59,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:59,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:59,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:59,610 INFO L85 PathProgramCache]: Analyzing trace with hash 152030, now seen corresponding path program 1 times [2025-04-26 18:41:59,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:59,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551784923] [2025-04-26 18:41:59,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:59,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:59,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:59,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:59,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:59,612 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:59,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:59,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:59,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:59,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:59,618 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:59,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1143680739, now seen corresponding path program 1 times [2025-04-26 18:41:59,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:59,618 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447807857] [2025-04-26 18:41:59,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:59,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:59,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:59,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:59,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:59,622 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:59,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:59,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:59,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:59,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:59,629 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:59,659 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:59,659 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:59,659 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:59,659 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:59,659 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:59,659 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:59,659 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:59,659 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:59,659 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:41:59,659 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:59,659 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:59,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:59,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:59,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:59,695 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:59,696 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:59,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:59,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:59,698 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:41:59,699 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:41:59,701 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:59,701 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:59,712 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:41:59,712 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:41:59,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:41:59,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:59,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:59,719 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:41:59,720 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:41:59,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:59,723 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:59,739 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:41:59,739 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=0} Honda state: {b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:41:59,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:41:59,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:59,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:59,747 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:41:59,747 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:41:59,749 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:59,749 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:59,767 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:41:59,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:59,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:59,770 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:41:59,771 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:41:59,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:59,773 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:59,893 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:59,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:59,898 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:59,898 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:59,898 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:59,898 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:59,898 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:59,898 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:59,898 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:59,899 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:59,899 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:41:59,899 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:59,899 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:59,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:59,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:59,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:59,941 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:59,941 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:59,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:59,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:59,943 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:41:59,946 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:41:59,946 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:41:59,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:59,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:59,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:59,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:59,958 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:59,958 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:59,960 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:59,966 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:41:59,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:59,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:59,968 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:41:59,969 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:41:59,969 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:41:59,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:59,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:59,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:59,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:59,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:59,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:59,983 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:59,989 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:41:59,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:59,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:59,992 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:41:59,993 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:41:59,994 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:00,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:00,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:00,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:00,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:00,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:00,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:00,013 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:00,024 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:42:00,024 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:00,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,026 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:00,027 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:00,028 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:00,044 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:00,045 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:00,045 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:00,045 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x1) = 2*n - 2*x1 + 1 Supporting invariants [-1*t - 1 >= 0] [2025-04-26 18:42:00,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:42:00,054 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:00,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:00,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:00,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:00,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:00,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:42:00,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:00,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:00,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:00,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:00,089 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:00,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:00,114 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:00,114 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:00,114 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 237 states and 446 transitions. cyclomatic complexity: 245 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:00,212 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 237 states and 446 transitions. cyclomatic complexity: 245. 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 709 states and 1316 transitions. Complement of second has 7 states. [2025-04-26 18:42:00,212 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:00,213 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:00,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-04-26 18:42:00,213 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 18:42:00,213 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:00,213 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 18:42:00,213 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:00,213 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 18:42:00,213 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:00,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 709 states and 1316 transitions. [2025-04-26 18:42:00,218 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 348 [2025-04-26 18:42:00,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 709 states to 582 states and 1072 transitions. [2025-04-26 18:42:00,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 480 [2025-04-26 18:42:00,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 506 [2025-04-26 18:42:00,222 INFO L74 IsDeterministic]: Start isDeterministic. Operand 582 states and 1072 transitions. [2025-04-26 18:42:00,222 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:00,222 INFO L218 hiAutomatonCegarLoop]: Abstraction has 582 states and 1072 transitions. [2025-04-26 18:42:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states and 1072 transitions. [2025-04-26 18:42:00,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 299. [2025-04-26 18:42:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 299 states have (on average 1.9096989966555185) internal successors, (in total 571), 298 states have internal predecessors, (571), 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:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 571 transitions. [2025-04-26 18:42:00,231 INFO L240 hiAutomatonCegarLoop]: Abstraction has 299 states and 571 transitions. [2025-04-26 18:42:00,231 INFO L438 stractBuchiCegarLoop]: Abstraction has 299 states and 571 transitions. [2025-04-26 18:42:00,231 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:42:00,231 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 299 states and 571 transitions. [2025-04-26 18:42:00,233 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 136 [2025-04-26 18:42:00,233 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:00,233 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:00,233 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:00,233 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:00,233 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[120] L27-->L35-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[122] L35-2-->L44: Formula: (< v_n_3 v_x1_6) InVars {x1=v_x1_6, n=v_n_3} OutVars{x1=v_x1_6, n=v_n_3} AuxVars[] AssignedVars[]" "[124] L44-->L47-2: Formula: (= v_t1_2 v_t_5) InVars {t=v_t_5} OutVars{t1=v_t1_2, t=v_t_5} AuxVars[] AssignedVars[t1]" [2025-04-26 18:42:00,233 INFO L754 eck$LassoCheckResult]: Loop: "[128] L47-2-->L47: Formula: (<= v_x3_4 v_n_4) InVars {n=v_n_4, x3=v_x3_4} OutVars{n=v_n_4, x3=v_x3_4} AuxVars[] AssignedVars[]" "[133] L47-->L49: Formula: (<= 1 v_b_5) InVars {b=v_b_5} OutVars{b=v_b_5} AuxVars[] AssignedVars[]" "[137] L49-->L47-2: Formula: (= v_x3_5 (+ v_x3_6 v_t1_3)) InVars {t1=v_t1_3, x3=v_x3_6} OutVars{t1=v_t1_3, x3=v_x3_5} AuxVars[] AssignedVars[x3]" [2025-04-26 18:42:00,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:00,234 INFO L85 PathProgramCache]: Analyzing trace with hash 175409470, now seen corresponding path program 1 times [2025-04-26 18:42:00,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:00,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466187857] [2025-04-26 18:42:00,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:00,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:00,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:00,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:00,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:00,237 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:00,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:00,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:00,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:00,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:00,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash 157059, now seen corresponding path program 1 times [2025-04-26 18:42:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:00,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127292891] [2025-04-26 18:42:00,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:00,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:00,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:00,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:00,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:00,247 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:00,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:00,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:00,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:00,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:00,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:00,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1351551194, now seen corresponding path program 1 times [2025-04-26 18:42:00,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:00,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975793819] [2025-04-26 18:42:00,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:00,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:00,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:00,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:00,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:00,258 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:00,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:00,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:00,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:00,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:00,306 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:00,306 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:00,306 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:00,306 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:00,306 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:00,306 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,306 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:00,306 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:00,306 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:42:00,307 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:00,307 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:00,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,363 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:00,363 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:00,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,366 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:00,366 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:00,367 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:00,367 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:00,378 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:00,378 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:00,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:42:00,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,385 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:00,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:42:00,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:00,387 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:00,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:42:00,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,422 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:00,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:42:00,428 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:00,428 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:00,569 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:00,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:42:00,575 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:00,575 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:00,575 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:00,575 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:00,575 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:00,575 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,576 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:00,576 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:00,576 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:42:00,576 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:00,576 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:00,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:00,640 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:00,640 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:00,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,642 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:00,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:42:00,644 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:00,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:00,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:00,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:00,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:00,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:00,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:00,657 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:00,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:42:00,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,668 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:00,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:42:00,670 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:00,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:00,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:00,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:00,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:00,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:00,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:00,688 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:00,693 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:00,693 INFO L437 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:00,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:00,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:00,695 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:00,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:42:00,696 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:00,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 18:42:00,713 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:00,713 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:00,713 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x3) = 2*n - 2*x3 + 1 Supporting invariants [1*t1 - 1 >= 0] [2025-04-26 18:42:00,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:00,724 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:00,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:00,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:00,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:00,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:00,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:00,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:00,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:00,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:00,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:00,790 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:00,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:00,821 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:00,821 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 18:42:00,821 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 299 states and 571 transitions. cyclomatic complexity: 315 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 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:00,895 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 299 states and 571 transitions. cyclomatic complexity: 315. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 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 609 states and 1189 transitions. Complement of second has 9 states. [2025-04-26 18:42:00,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2025-04-26 18:42:00,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 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:00,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2025-04-26 18:42:00,896 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 93 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:42:00,896 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:00,896 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 93 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:42:00,897 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:00,897 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 93 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 18:42:00,897 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:00,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 609 states and 1189 transitions. [2025-04-26 18:42:00,900 INFO L131 ngComponentsAnalysis]: Automaton has 51 accepting balls. 228 [2025-04-26 18:42:00,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 609 states to 537 states and 1041 transitions. [2025-04-26 18:42:00,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 377 [2025-04-26 18:42:00,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 425 [2025-04-26 18:42:00,904 INFO L74 IsDeterministic]: Start isDeterministic. Operand 537 states and 1041 transitions. [2025-04-26 18:42:00,904 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:00,904 INFO L218 hiAutomatonCegarLoop]: Abstraction has 537 states and 1041 transitions. [2025-04-26 18:42:00,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states and 1041 transitions. [2025-04-26 18:42:00,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 417. [2025-04-26 18:42:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 417 states have (on average 1.9400479616306954) internal successors, (in total 809), 416 states have internal predecessors, (809), 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:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 809 transitions. [2025-04-26 18:42:00,916 INFO L240 hiAutomatonCegarLoop]: Abstraction has 417 states and 809 transitions. [2025-04-26 18:42:00,916 INFO L438 stractBuchiCegarLoop]: Abstraction has 417 states and 809 transitions. [2025-04-26 18:42:00,916 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:42:00,916 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 417 states and 809 transitions. [2025-04-26 18:42:00,918 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 180 [2025-04-26 18:42:00,918 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:00,918 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:00,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:00,918 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:00,918 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[158] L16-->$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]" "[139] $Ultimate##0-->L67: Formula: (<= 1 v_b_7) InVars {b=v_b_7} OutVars{b=v_b_7} AuxVars[] AssignedVars[]" "[141] L67-->L75-2: Formula: (= v_t_6 1) InVars {} OutVars{t=v_t_6} AuxVars[] AssignedVars[t]" [2025-04-26 18:42:00,919 INFO L754 eck$LassoCheckResult]: Loop: "[144] L75-2-->L75: Formula: (<= v_x2_2 v_n_6) InVars {x2=v_x2_2, n=v_n_6} OutVars{x2=v_x2_2, n=v_n_6} AuxVars[] AssignedVars[]" "[148] L75-->L81: Formula: (< v_b_10 1) InVars {b=v_b_10} OutVars{b=v_b_10} AuxVars[] AssignedVars[]" "[152] L81-->L75-2: Formula: (= v_x2_6 (+ v_x2_5 v_t_9)) InVars {t=v_t_9, x2=v_x2_6} OutVars{t=v_t_9, x2=v_x2_5} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:00,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:00,919 INFO L85 PathProgramCache]: Analyzing trace with hash 175446532, now seen corresponding path program 1 times [2025-04-26 18:42:00,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:00,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564469032] [2025-04-26 18:42:00,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:00,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:00,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:00,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:00,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:00,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:00,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:00,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:00,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:00,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:00,927 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:00,927 INFO L85 PathProgramCache]: Analyzing trace with hash 172915, now seen corresponding path program 1 times [2025-04-26 18:42:00,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:00,927 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118953448] [2025-04-26 18:42:00,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:00,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:00,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:00,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:00,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:00,932 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:00,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:00,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:00,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:00,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:00,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:00,934 INFO L85 PathProgramCache]: Analyzing trace with hash -247421296, now seen corresponding path program 1 times [2025-04-26 18:42:00,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:00,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563140800] [2025-04-26 18:42:00,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:00,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:00,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:00,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:00,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:00,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:00,968 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:00,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:00,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563140800] [2025-04-26 18:42:00,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563140800] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:00,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:00,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:42:00,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416600518] [2025-04-26 18:42:00,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:00,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:01,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:01,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:01,002 INFO L87 Difference]: Start difference. First operand 417 states and 809 transitions. cyclomatic complexity: 449 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:01,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:01,026 INFO L93 Difference]: Finished difference Result 427 states and 750 transitions. [2025-04-26 18:42:01,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 427 states and 750 transitions. [2025-04-26 18:42:01,028 INFO L131 ngComponentsAnalysis]: Automaton has 55 accepting balls. 193 [2025-04-26 18:42:01,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 427 states to 401 states and 698 transitions. [2025-04-26 18:42:01,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 307 [2025-04-26 18:42:01,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 309 [2025-04-26 18:42:01,031 INFO L74 IsDeterministic]: Start isDeterministic. Operand 401 states and 698 transitions. [2025-04-26 18:42:01,031 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:01,031 INFO L218 hiAutomatonCegarLoop]: Abstraction has 401 states and 698 transitions. [2025-04-26 18:42:01,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states and 698 transitions. [2025-04-26 18:42:01,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 367. [2025-04-26 18:42:01,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 367 states have (on average 1.7574931880108993) internal successors, (in total 645), 366 states have internal predecessors, (645), 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:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 645 transitions. [2025-04-26 18:42:01,038 INFO L240 hiAutomatonCegarLoop]: Abstraction has 367 states and 645 transitions. [2025-04-26 18:42:01,038 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:01,038 INFO L438 stractBuchiCegarLoop]: Abstraction has 367 states and 645 transitions. [2025-04-26 18:42:01,038 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:42:01,038 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 367 states and 645 transitions. [2025-04-26 18:42:01,040 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 179 [2025-04-26 18:42:01,040 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:01,040 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:01,040 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:01,040 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:01,040 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[158] L16-->$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]" "[139] $Ultimate##0-->L67: Formula: (<= 1 v_b_7) InVars {b=v_b_7} OutVars{b=v_b_7} AuxVars[] AssignedVars[]" "[141] L67-->L75-2: Formula: (= v_t_6 1) InVars {} OutVars{t=v_t_6} AuxVars[] AssignedVars[t]" [2025-04-26 18:42:01,040 INFO L754 eck$LassoCheckResult]: Loop: "[144] L75-2-->L75: Formula: (<= v_x2_2 v_n_6) InVars {x2=v_x2_2, n=v_n_6} OutVars{x2=v_x2_2, n=v_n_6} AuxVars[] AssignedVars[]" "[147] L75-->L77: Formula: (<= 1 v_b_9) InVars {b=v_b_9} OutVars{b=v_b_9} AuxVars[] AssignedVars[]" "[151] L77-->L75-2: Formula: (= v_x2_3 (+ v_x2_4 v_t_8)) InVars {t=v_t_8, x2=v_x2_4} OutVars{t=v_t_8, x2=v_x2_3} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:01,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:01,041 INFO L85 PathProgramCache]: Analyzing trace with hash 175446532, now seen corresponding path program 2 times [2025-04-26 18:42:01,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:01,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149073216] [2025-04-26 18:42:01,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:01,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:01,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:01,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:01,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:01,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,044 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:01,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:01,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:01,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:01,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:01,051 INFO L85 PathProgramCache]: Analyzing trace with hash 172883, now seen corresponding path program 1 times [2025-04-26 18:42:01,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:01,051 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410495272] [2025-04-26 18:42:01,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:01,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:01,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:01,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:01,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,053 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:01,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:01,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:01,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:01,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:01,055 INFO L85 PathProgramCache]: Analyzing trace with hash -247421328, now seen corresponding path program 1 times [2025-04-26 18:42:01,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:01,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781592398] [2025-04-26 18:42:01,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:01,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:01,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:01,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:01,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:01,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:01,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:01,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:01,092 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:01,092 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:01,092 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:01,092 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:01,092 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:01,092 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,092 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:01,092 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:01,092 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:42:01,092 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:01,092 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:01,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,135 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:01,135 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:01,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,137 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:01,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 18:42:01,140 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:01,140 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:01,151 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:01,151 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread2Thread1of1ForFork1_thidvar0=0} Honda state: {thread2Thread1of1ForFork1_thidvar0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:01,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 18:42:01,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,159 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:01,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 18:42:01,161 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:01,161 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:01,179 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:01,179 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=1} Honda state: {b=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:01,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:01,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,187 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:42:01,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 18:42:01,190 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:01,190 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:01,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:01,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,208 INFO L229 MonitoredProcess]: Starting monitored process 27 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:01,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 18:42:01,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:01,210 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:01,361 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:01,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 18:42:01,368 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:01,368 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:01,368 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:01,368 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:01,368 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:01,368 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,368 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:01,368 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:01,368 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:42:01,368 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:01,368 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:01,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,417 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:01,417 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:01,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,419 INFO L229 MonitoredProcess]: Starting monitored process 28 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:01,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 18:42:01,421 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:01,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:01,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:01,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:01,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:01,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:01,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:01,434 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:01,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 18:42:01,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,442 INFO L229 MonitoredProcess]: Starting monitored process 29 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:01,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 18:42:01,443 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:01,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:01,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:01,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:01,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:01,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:01,454 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:01,458 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:01,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 18:42:01,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,465 INFO L229 MonitoredProcess]: Starting monitored process 30 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:01,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 18:42:01,467 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:01,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:01,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:01,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:01,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:01,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:01,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:01,481 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:01,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:01,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,490 INFO L229 MonitoredProcess]: Starting monitored process 31 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:01,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 18:42:01,492 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:01,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:01,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:01,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:01,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:01,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:01,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:01,507 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:01,511 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:42:01,511 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:01,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,513 INFO L229 MonitoredProcess]: Starting monitored process 32 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:01,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 18:42:01,515 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:01,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 18:42:01,532 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:01,532 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:01,532 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x2) = 2*n - 2*x2 + 1 Supporting invariants [1*t - 1 >= 0] [2025-04-26 18:42:01,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 18:42:01,540 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:01,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:01,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:01,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:01,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:01,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:42:01,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:01,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:01,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:01,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:01,570 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:01,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:01,590 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:01,591 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:01,591 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 367 states and 645 transitions. cyclomatic complexity: 345 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:01,650 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 367 states and 645 transitions. cyclomatic complexity: 345. 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 738 states and 1288 transitions. Complement of second has 7 states. [2025-04-26 18:42:01,651 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:01,651 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:01,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-04-26 18:42:01,651 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:42:01,651 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:01,652 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:42:01,652 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:01,652 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 18:42:01,652 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:01,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 738 states and 1288 transitions. [2025-04-26 18:42:01,666 INFO L131 ngComponentsAnalysis]: Automaton has 83 accepting balls. 288 [2025-04-26 18:42:01,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 738 states to 614 states and 1062 transitions. [2025-04-26 18:42:01,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2025-04-26 18:42:01,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 423 [2025-04-26 18:42:01,670 INFO L74 IsDeterministic]: Start isDeterministic. Operand 614 states and 1062 transitions. [2025-04-26 18:42:01,670 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:01,670 INFO L218 hiAutomatonCegarLoop]: Abstraction has 614 states and 1062 transitions. [2025-04-26 18:42:01,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states and 1062 transitions. [2025-04-26 18:42:01,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 492. [2025-04-26 18:42:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 492 states have (on average 1.7439024390243902) internal successors, (in total 858), 491 states have internal predecessors, (858), 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:01,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 858 transitions. [2025-04-26 18:42:01,680 INFO L240 hiAutomatonCegarLoop]: Abstraction has 492 states and 858 transitions. [2025-04-26 18:42:01,680 INFO L438 stractBuchiCegarLoop]: Abstraction has 492 states and 858 transitions. [2025-04-26 18:42:01,680 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:42:01,680 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 492 states and 858 transitions. [2025-04-26 18:42:01,682 INFO L131 ngComponentsAnalysis]: Automaton has 56 accepting balls. 191 [2025-04-26 18:42:01,682 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:01,682 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:01,682 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:01,682 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:01,682 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[119] $Ultimate##0-->L31: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[121] L31-->L35-2: Formula: (= (+ v_t_2 1) 0) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" "[122] L35-2-->L44: Formula: (< v_n_3 v_x1_6) InVars {x1=v_x1_6, n=v_n_3} OutVars{x1=v_x1_6, n=v_n_3} AuxVars[] AssignedVars[]" "[124] L44-->L47-2: Formula: (= v_t1_2 v_t_5) InVars {t=v_t_5} OutVars{t1=v_t1_2, t=v_t_5} AuxVars[] AssignedVars[t1]" [2025-04-26 18:42:01,682 INFO L754 eck$LassoCheckResult]: Loop: "[128] L47-2-->L47: Formula: (<= v_x3_4 v_n_4) InVars {n=v_n_4, x3=v_x3_4} OutVars{n=v_n_4, x3=v_x3_4} AuxVars[] AssignedVars[]" "[134] L47-->L53: Formula: (< v_b_6 1) InVars {b=v_b_6} OutVars{b=v_b_6} AuxVars[] AssignedVars[]" "[138] L53-->L47-2: Formula: (= (+ v_x3_1 v_t1_1) v_x3_2) InVars {t1=v_t1_1, x3=v_x3_2} OutVars{t1=v_t1_1, x3=v_x3_1} AuxVars[] AssignedVars[x3]" [2025-04-26 18:42:01,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:01,683 INFO L85 PathProgramCache]: Analyzing trace with hash 175440222, now seen corresponding path program 1 times [2025-04-26 18:42:01,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:01,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634856443] [2025-04-26 18:42:01,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:01,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:01,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:01,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:01,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,690 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:01,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:01,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:01,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:01,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:01,693 INFO L85 PathProgramCache]: Analyzing trace with hash 157091, now seen corresponding path program 1 times [2025-04-26 18:42:01,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:01,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522632427] [2025-04-26 18:42:01,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:01,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:01,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:01,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:01,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,700 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:01,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:01,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:01,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:01,702 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:01,702 INFO L85 PathProgramCache]: Analyzing trace with hash -435418330, now seen corresponding path program 1 times [2025-04-26 18:42:01,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:01,702 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470429702] [2025-04-26 18:42:01,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:01,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:01,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:01,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:01,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,711 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:01,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:01,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:01,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:01,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:01,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:01,760 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:01,760 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:01,760 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:01,760 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:01,760 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:01,760 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,760 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:01,760 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:01,760 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:42:01,760 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:01,760 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:01,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:01,803 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:01,803 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:01,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,805 INFO L229 MonitoredProcess]: Starting monitored process 33 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:01,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 18:42:01,808 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:01,808 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:01,825 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:01,826 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {t=0} Honda state: {t=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:01,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:01,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,834 INFO L229 MonitoredProcess]: Starting monitored process 34 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:01,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 18:42:01,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:01,837 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:01,849 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:01,849 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:01,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:01,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,859 INFO L229 MonitoredProcess]: Starting monitored process 35 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:01,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 18:42:01,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:01,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:01,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:01,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:01,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:01,879 INFO L229 MonitoredProcess]: Starting monitored process 36 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:01,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 18:42:01,882 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:01,882 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:02,009 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:02,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:02,015 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:02,015 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:02,015 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:02,015 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:02,015 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:02,015 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,015 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:02,015 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:02,015 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:42:02,016 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:02,016 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:02,016 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,062 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:02,062 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:02,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,064 INFO L229 MonitoredProcess]: Starting monitored process 37 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:02,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 18:42:02,065 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:02,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:02,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:02,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:02,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:02,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:02,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:02,078 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:02,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 18:42:02,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,086 INFO L229 MonitoredProcess]: Starting monitored process 38 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:02,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 18:42:02,091 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:02,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:02,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:02,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:02,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:02,103 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:02,103 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:02,107 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:02,112 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:42:02,112 INFO L437 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:02,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,114 INFO L229 MonitoredProcess]: Starting monitored process 39 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:02,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 18:42:02,116 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:02,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:02,133 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:02,133 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:02,133 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x3) = 2*n - 2*x3 + 1 Supporting invariants [-1*t1 - 1 >= 0] [2025-04-26 18:42:02,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:02,150 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:02,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:02,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:02,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:02,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:02,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:02,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:02,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:02,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:02,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:02,192 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:02,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:02,214 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:02,215 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-04-26 18:42:02,215 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 492 states and 858 transitions. cyclomatic complexity: 456 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 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:02,290 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 492 states and 858 transitions. cyclomatic complexity: 456. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 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 819 states and 1482 transitions. Complement of second has 9 states. [2025-04-26 18:42:02,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2025-04-26 18:42:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 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:02,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2025-04-26 18:42:02,291 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 89 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:42:02,291 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:02,291 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 89 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:42:02,291 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:02,291 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 89 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 18:42:02,291 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:02,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 819 states and 1482 transitions. [2025-04-26 18:42:02,299 INFO L131 ngComponentsAnalysis]: Automaton has 67 accepting balls. 207 [2025-04-26 18:42:02,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 819 states to 680 states and 1202 transitions. [2025-04-26 18:42:02,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 378 [2025-04-26 18:42:02,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 433 [2025-04-26 18:42:02,303 INFO L74 IsDeterministic]: Start isDeterministic. Operand 680 states and 1202 transitions. [2025-04-26 18:42:02,303 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:02,303 INFO L218 hiAutomatonCegarLoop]: Abstraction has 680 states and 1202 transitions. [2025-04-26 18:42:02,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states and 1202 transitions. [2025-04-26 18:42:02,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 504. [2025-04-26 18:42:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 504 states have (on average 1.7757936507936507) internal successors, (in total 895), 503 states have internal predecessors, (895), 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:02,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 895 transitions. [2025-04-26 18:42:02,312 INFO L240 hiAutomatonCegarLoop]: Abstraction has 504 states and 895 transitions. [2025-04-26 18:42:02,312 INFO L438 stractBuchiCegarLoop]: Abstraction has 504 states and 895 transitions. [2025-04-26 18:42:02,312 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:42:02,312 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 504 states and 895 transitions. [2025-04-26 18:42:02,313 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 164 [2025-04-26 18:42:02,313 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:02,313 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:02,314 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:02,314 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:02,314 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[119] $Ultimate##0-->L31: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[121] L31-->L35-2: Formula: (= (+ v_t_2 1) 0) InVars {} OutVars{t=v_t_2} AuxVars[] AssignedVars[t]" "[123] L35-2-->L35: Formula: (<= v_x1_1 v_n_2) InVars {x1=v_x1_1, n=v_n_2} OutVars{x1=v_x1_1, n=v_n_2} AuxVars[] AssignedVars[]" "[125] L35-->L37: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" [2025-04-26 18:42:02,314 INFO L754 eck$LassoCheckResult]: Loop: "[129] L37-->L35-2: Formula: (= (+ v_x1_3 v_t_3) v_x1_2) InVars {x1=v_x1_3, t=v_t_3} OutVars{x1=v_x1_2, t=v_t_3} AuxVars[] AssignedVars[x1]" "[123] L35-2-->L35: Formula: (<= v_x1_1 v_n_2) InVars {x1=v_x1_1, n=v_n_2} OutVars{x1=v_x1_1, n=v_n_2} AuxVars[] AssignedVars[]" "[125] L35-->L37: Formula: (<= 1 v_b_3) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" [2025-04-26 18:42:02,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:02,314 INFO L85 PathProgramCache]: Analyzing trace with hash 175440254, now seen corresponding path program 1 times [2025-04-26 18:42:02,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:02,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582012247] [2025-04-26 18:42:02,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:02,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:02,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:02,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:02,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:02,325 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:02,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:42:02,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582012247] [2025-04-26 18:42:02,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582012247] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:42:02,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:42:02,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:42:02,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666184535] [2025-04-26 18:42:02,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:42:02,326 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:42:02,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:02,326 INFO L85 PathProgramCache]: Analyzing trace with hash 157698, now seen corresponding path program 2 times [2025-04-26 18:42:02,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:02,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3723044] [2025-04-26 18:42:02,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:02,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:02,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:02,328 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:02,328 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:02,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:02,328 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:02,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:02,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:02,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:02,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:02,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:42:02,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:42:02,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:42:02,350 INFO L87 Difference]: Start difference. First operand 504 states and 895 transitions. cyclomatic complexity: 481 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (in total 5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:42:02,367 INFO L93 Difference]: Finished difference Result 365 states and 628 transitions. [2025-04-26 18:42:02,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 365 states and 628 transitions. [2025-04-26 18:42:02,369 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 60 [2025-04-26 18:42:02,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 365 states to 345 states and 584 transitions. [2025-04-26 18:42:02,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2025-04-26 18:42:02,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2025-04-26 18:42:02,371 INFO L74 IsDeterministic]: Start isDeterministic. Operand 345 states and 584 transitions. [2025-04-26 18:42:02,371 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:02,371 INFO L218 hiAutomatonCegarLoop]: Abstraction has 345 states and 584 transitions. [2025-04-26 18:42:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states and 584 transitions. [2025-04-26 18:42:02,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 330. [2025-04-26 18:42:02,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 330 states have (on average 1.7) internal successors, (in total 561), 329 states have internal predecessors, (561), 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:02,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 561 transitions. [2025-04-26 18:42:02,376 INFO L240 hiAutomatonCegarLoop]: Abstraction has 330 states and 561 transitions. [2025-04-26 18:42:02,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:42:02,377 INFO L438 stractBuchiCegarLoop]: Abstraction has 330 states and 561 transitions. [2025-04-26 18:42:02,377 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:42:02,377 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 330 states and 561 transitions. [2025-04-26 18:42:02,378 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 46 [2025-04-26 18:42:02,378 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:02,378 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:02,378 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:42:02,378 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 18:42:02,378 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[119] $Ultimate##0-->L31: Formula: (< v_b_2 1) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[158] L16-->$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]" "[140] $Ultimate##0-->L71: Formula: (< v_b_8 1) InVars {b=v_b_8} OutVars{b=v_b_8} AuxVars[] AssignedVars[]" "[142] L71-->L75-2: Formula: (= (+ v_t_7 1) 0) InVars {} OutVars{t=v_t_7} AuxVars[] AssignedVars[t]" [2025-04-26 18:42:02,378 INFO L754 eck$LassoCheckResult]: Loop: "[144] L75-2-->L75: Formula: (<= v_x2_2 v_n_6) InVars {x2=v_x2_2, n=v_n_6} OutVars{x2=v_x2_2, n=v_n_6} AuxVars[] AssignedVars[]" "[148] L75-->L81: Formula: (< v_b_10 1) InVars {b=v_b_10} OutVars{b=v_b_10} AuxVars[] AssignedVars[]" "[152] L81-->L75-2: Formula: (= v_x2_6 (+ v_x2_5 v_t_9)) InVars {t=v_t_9, x2=v_x2_6} OutVars{t=v_t_9, x2=v_x2_5} AuxVars[] AssignedVars[x2]" [2025-04-26 18:42:02,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:02,378 INFO L85 PathProgramCache]: Analyzing trace with hash 175476355, now seen corresponding path program 1 times [2025-04-26 18:42:02,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:02,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043502012] [2025-04-26 18:42:02,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:02,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:02,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:02,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:02,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:02,385 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:02,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:02,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:02,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:02,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:02,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:02,387 INFO L85 PathProgramCache]: Analyzing trace with hash 172915, now seen corresponding path program 2 times [2025-04-26 18:42:02,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:02,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366315001] [2025-04-26 18:42:02,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:42:02,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:02,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:02,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:02,389 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:42:02,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:02,389 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:02,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:02,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:02,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:02,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:02,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:02,390 INFO L85 PathProgramCache]: Analyzing trace with hash 641035697, now seen corresponding path program 1 times [2025-04-26 18:42:02,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:02,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300534460] [2025-04-26 18:42:02,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:02,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:02,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:02,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:02,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:02,394 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:02,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:02,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:02,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:02,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:02,429 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:02,429 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:02,429 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:02,429 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:02,429 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:02,429 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,429 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:02,429 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:02,429 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration8_Lasso [2025-04-26 18:42:02,429 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:02,429 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:02,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,473 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:02,473 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:02,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,475 INFO L229 MonitoredProcess]: Starting monitored process 40 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:02,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 18:42:02,476 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:02,476 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:02,492 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:02,492 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=0} Honda state: {b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:02,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 18:42:02,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,499 INFO L229 MonitoredProcess]: Starting monitored process 41 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:02,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 18:42:02,501 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:02,501 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:02,511 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:42:02,511 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork0_thidvar0=0} Honda state: {thread1Thread1of1ForFork0_thidvar0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:42:02,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 18:42:02,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,518 INFO L229 MonitoredProcess]: Starting monitored process 42 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:02,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 18:42:02,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:02,520 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:02,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 18:42:02,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,538 INFO L229 MonitoredProcess]: Starting monitored process 43 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:02,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 18:42:02,539 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:02,539 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:02,655 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:02,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-04-26 18:42:02,661 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:02,661 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:02,661 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:02,662 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:02,662 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:02,662 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,662 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:02,662 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:02,662 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration8_Lasso [2025-04-26 18:42:02,662 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:02,662 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:02,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,732 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:02,732 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:02,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,735 INFO L229 MonitoredProcess]: Starting monitored process 44 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:02,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 18:42:02,737 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:02,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:02,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:02,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:02,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:02,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:02,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:02,751 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:02,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-04-26 18:42:02,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,758 INFO L229 MonitoredProcess]: Starting monitored process 45 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:02,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 18:42:02,760 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:02,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:02,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:02,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:02,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:02,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:02,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:02,772 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:42:02,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-04-26 18:42:02,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,779 INFO L229 MonitoredProcess]: Starting monitored process 46 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:02,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 18:42:02,781 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:02,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:02,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:02,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:02,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:02,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:42:02,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:42:02,796 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:02,801 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:42:02,801 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:02,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,804 INFO L229 MonitoredProcess]: Starting monitored process 47 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:02,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 18:42:02,806 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:02,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:02,822 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 18:42:02,822 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:02,822 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x2) = 2*n - 2*x2 + 1 Supporting invariants [-1*t - 1 >= 0] [2025-04-26 18:42:02,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-04-26 18:42:02,833 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:42:02,849 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:02,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:42:02,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:42:02,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:02,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:42:02,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:02,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:42:02,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:42:02,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:02,862 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 18:42:02,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:02,884 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:02,884 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:02,884 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 330 states and 561 transitions. cyclomatic complexity: 286 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:02,933 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 330 states and 561 transitions. cyclomatic complexity: 286. 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 532 states and 919 transitions. Complement of second has 6 states. [2025-04-26 18:42:02,933 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:02,934 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:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-04-26 18:42:02,934 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 5 letters. Loop has 3 letters. [2025-04-26 18:42:02,934 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:02,934 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 18:42:02,934 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:02,934 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 5 letters. Loop has 6 letters. [2025-04-26 18:42:02,934 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:02,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 532 states and 919 transitions. [2025-04-26 18:42:02,937 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 48 [2025-04-26 18:42:02,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 532 states to 433 states and 737 transitions. [2025-04-26 18:42:02,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 156 [2025-04-26 18:42:02,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 166 [2025-04-26 18:42:02,938 INFO L74 IsDeterministic]: Start isDeterministic. Operand 433 states and 737 transitions. [2025-04-26 18:42:02,938 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:02,938 INFO L218 hiAutomatonCegarLoop]: Abstraction has 433 states and 737 transitions. [2025-04-26 18:42:02,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states and 737 transitions. [2025-04-26 18:42:02,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 402. [2025-04-26 18:42:02,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 402 states have (on average 1.699004975124378) internal successors, (in total 683), 401 states have internal predecessors, (683), 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:02,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 683 transitions. [2025-04-26 18:42:02,944 INFO L240 hiAutomatonCegarLoop]: Abstraction has 402 states and 683 transitions. [2025-04-26 18:42:02,944 INFO L438 stractBuchiCegarLoop]: Abstraction has 402 states and 683 transitions. [2025-04-26 18:42:02,944 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:42:02,944 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 402 states and 683 transitions. [2025-04-26 18:42:02,945 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 34 [2025-04-26 18:42:02,945 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:02,945 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:02,945 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:42:02,945 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:02,945 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[120] L27-->L35-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[122] L35-2-->L44: Formula: (< v_n_3 v_x1_6) InVars {x1=v_x1_6, n=v_n_3} OutVars{x1=v_x1_6, n=v_n_3} AuxVars[] AssignedVars[]" "[124] L44-->L47-2: Formula: (= v_t1_2 v_t_5) InVars {t=v_t_5} OutVars{t1=v_t1_2, t=v_t_5} AuxVars[] AssignedVars[t1]" "[127] L47-2-->L56-1: Formula: (< v_n_1 v_x3_3) InVars {n=v_n_1, x3=v_x3_3} OutVars{n=v_n_1, x3=v_x3_3} AuxVars[] AssignedVars[]" [2025-04-26 18:42:02,945 INFO L754 eck$LassoCheckResult]: Loop: "[132] L56-1-->L58: Formula: (< v_z1_1 0) InVars {z1=v_z1_1} OutVars{z1=v_z1_1} AuxVars[] AssignedVars[]" "[136] L58-->L56-1: Formula: (= v_z1_2 (+ v_z1_3 1)) InVars {z1=v_z1_3} OutVars{z1=v_z1_2} AuxVars[] AssignedVars[z1]" [2025-04-26 18:42:02,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:02,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1142726401, now seen corresponding path program 1 times [2025-04-26 18:42:02,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:02,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603093380] [2025-04-26 18:42:02,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:02,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:02,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:02,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:02,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:02,948 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:02,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:02,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:02,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:02,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:02,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:02,951 INFO L85 PathProgramCache]: Analyzing trace with hash 5189, now seen corresponding path program 1 times [2025-04-26 18:42:02,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:02,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196339615] [2025-04-26 18:42:02,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:02,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:02,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:02,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:02,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:02,952 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:02,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:02,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:02,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:02,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:02,954 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:02,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1351552187, now seen corresponding path program 1 times [2025-04-26 18:42:02,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:02,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522019755] [2025-04-26 18:42:02,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:02,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:02,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:02,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:02,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:02,957 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:02,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:42:02,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:42:02,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:02,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:02,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:02,968 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:02,968 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:02,968 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:02,968 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:02,968 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:02,968 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,968 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:02,968 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:02,968 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration9_Loop [2025-04-26 18:42:02,968 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:02,968 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:02,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:02,980 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:02,980 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:02,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:02,982 INFO L229 MonitoredProcess]: Starting monitored process 48 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:02,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 18:42:02,984 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:02,984 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:02,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:02,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:02,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:03,001 INFO L229 MonitoredProcess]: Starting monitored process 49 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:03,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 18:42:03,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:03,003 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:03,049 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:03,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 18:42:03,053 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:03,053 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:03,053 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:03,053 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:03,053 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:03,053 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:03,053 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:03,053 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:03,053 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration9_Loop [2025-04-26 18:42:03,053 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:03,053 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:03,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:03,064 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:03,064 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:03,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:03,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:03,083 INFO L229 MonitoredProcess]: Starting monitored process 50 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:03,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 18:42:03,085 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:03,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:03,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:03,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:03,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:03,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:03,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:03,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:03,097 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:03,098 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:42:03,098 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:42:03,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:03,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:03,100 INFO L229 MonitoredProcess]: Starting monitored process 51 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:03,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 18:42:03,101 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:03,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-04-26 18:42:03,104 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:03,104 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:03,104 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z1) = -1*z1 Supporting invariants [] [2025-04-26 18:42:03,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-04-26 18:42:03,110 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:03,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:03,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:42:03,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:42:03,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:03,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:03,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:03,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:03,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:03,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:03,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:03,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:03,134 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:03,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:03,141 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:03,141 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:03,142 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 402 states and 683 transitions. cyclomatic complexity: 347 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:03,161 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 402 states and 683 transitions. cyclomatic complexity: 347. 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 566 states and 1012 transitions. Complement of second has 6 states. [2025-04-26 18:42:03,162 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:03,162 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:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-04-26 18:42:03,162 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:42:03,162 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:03,162 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:42:03,162 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:03,162 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 18:42:03,162 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:03,163 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 566 states and 1012 transitions. [2025-04-26 18:42:03,165 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:42:03,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 566 states to 352 states and 607 transitions. [2025-04-26 18:42:03,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2025-04-26 18:42:03,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2025-04-26 18:42:03,166 INFO L74 IsDeterministic]: Start isDeterministic. Operand 352 states and 607 transitions. [2025-04-26 18:42:03,167 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:42:03,167 INFO L218 hiAutomatonCegarLoop]: Abstraction has 352 states and 607 transitions. [2025-04-26 18:42:03,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states and 607 transitions. [2025-04-26 18:42:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 338. [2025-04-26 18:42:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 338 states have (on average 1.7366863905325445) internal successors, (in total 587), 337 states have internal predecessors, (587), 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:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 587 transitions. [2025-04-26 18:42:03,171 INFO L240 hiAutomatonCegarLoop]: Abstraction has 338 states and 587 transitions. [2025-04-26 18:42:03,171 INFO L438 stractBuchiCegarLoop]: Abstraction has 338 states and 587 transitions. [2025-04-26 18:42:03,171 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 18:42:03,171 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 338 states and 587 transitions. [2025-04-26 18:42:03,172 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-04-26 18:42:03,172 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:42:03,172 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:42:03,173 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:42:03,173 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:42:03,173 INFO L752 eck$LassoCheckResult]: Stem: "[155] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[118] $Ultimate##0-->L27: Formula: (<= 1 v_b_1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[120] L27-->L35-2: Formula: (= v_t_1 1) InVars {} OutVars{t=v_t_1} AuxVars[] AssignedVars[t]" "[122] L35-2-->L44: Formula: (< v_n_3 v_x1_6) InVars {x1=v_x1_6, n=v_n_3} OutVars{x1=v_x1_6, n=v_n_3} AuxVars[] AssignedVars[]" "[158] L16-->$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]" "[139] $Ultimate##0-->L67: Formula: (<= 1 v_b_7) InVars {b=v_b_7} OutVars{b=v_b_7} AuxVars[] AssignedVars[]" "[124] L44-->L47-2: Formula: (= v_t1_2 v_t_5) InVars {t=v_t_5} OutVars{t1=v_t1_2, t=v_t_5} AuxVars[] AssignedVars[t1]" "[127] L47-2-->L56-1: Formula: (< v_n_1 v_x3_3) InVars {n=v_n_1, x3=v_x3_3} OutVars{n=v_n_1, x3=v_x3_3} AuxVars[] AssignedVars[]" "[131] L56-1-->thread1FINAL: Formula: (<= 0 v_z1_4) InVars {z1=v_z1_4} OutVars{z1=v_z1_4} AuxVars[] AssignedVars[]" "[141] L67-->L75-2: Formula: (= v_t_6 1) InVars {} OutVars{t=v_t_6} AuxVars[] AssignedVars[t]" "[143] L75-2-->L84-1: Formula: (< v_n_5 v_x2_1) InVars {x2=v_x2_1, n=v_n_5} OutVars{x2=v_x2_1, n=v_n_5} AuxVars[] AssignedVars[]" [2025-04-26 18:42:03,173 INFO L754 eck$LassoCheckResult]: Loop: "[146] L84-1-->L86: Formula: (< v_z2_1 0) InVars {z2=v_z2_1} OutVars{z2=v_z2_1} AuxVars[] AssignedVars[]" "[150] L86-->L84-1: Formula: (= v_z2_2 (+ v_z2_3 1)) InVars {z2=v_z2_3} OutVars{z2=v_z2_2} AuxVars[] AssignedVars[z2]" [2025-04-26 18:42:03,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:03,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1673575095, now seen corresponding path program 1 times [2025-04-26 18:42:03,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:03,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299851961] [2025-04-26 18:42:03,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:03,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:03,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:03,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:03,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:03,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:03,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:03,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:03,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:03,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:03,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:03,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:03,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:03,179 INFO L85 PathProgramCache]: Analyzing trace with hash 5637, now seen corresponding path program 1 times [2025-04-26 18:42:03,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:03,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325149046] [2025-04-26 18:42:03,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:03,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:03,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:03,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:03,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:03,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:03,181 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:03,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:03,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:03,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:03,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:03,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:03,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1987902267, now seen corresponding path program 1 times [2025-04-26 18:42:03,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:42:03,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108083791] [2025-04-26 18:42:03,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:42:03,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:42:03,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:42:03,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:42:03,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:03,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:03,185 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:42:03,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:42:03,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:42:03,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:03,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:42:03,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:42:03,196 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:03,196 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:03,196 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:03,196 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:03,196 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:42:03,196 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:03,196 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:03,196 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:03,196 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration10_Loop [2025-04-26 18:42:03,196 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:03,196 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:03,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:03,209 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:03,209 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:42:03,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:03,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:03,212 INFO L229 MonitoredProcess]: Starting monitored process 52 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:03,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 18:42:03,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:42:03,215 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:03,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 18:42:03,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:03,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:03,233 INFO L229 MonitoredProcess]: Starting monitored process 53 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:03,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 18:42:03,236 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:42:03,236 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:42:03,257 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:42:03,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:03,261 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:42:03,261 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:42:03,261 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:42:03,261 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:42:03,261 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:42:03,261 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:03,261 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:42:03,261 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:42:03,261 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_seq_1.c.bpl_petrified1_Iteration10_Loop [2025-04-26 18:42:03,261 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:42:03,261 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:42:03,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:42:03,271 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:42:03,271 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:42:03,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:03,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:03,273 INFO L229 MonitoredProcess]: Starting monitored process 54 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:03,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 18:42:03,275 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:03,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:42:03,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:42:03,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:42:03,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:42:03,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:42:03,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:42:03,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:42:03,286 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:42:03,288 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 18:42:03,288 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:42:03,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:42:03,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:42:03,289 INFO L229 MonitoredProcess]: Starting monitored process 55 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:03,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 18:42:03,292 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:42:03,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:03,295 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:42:03,295 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:42:03,295 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(z2) = -1*z2 Supporting invariants [] [2025-04-26 18:42:03,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-04-26 18:42:03,301 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:42:03,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:42:03,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:42:03,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:42:03,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:03,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:03,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:42:03,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:03,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:42:03,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:42:03,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:42:03,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:42:03,341 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:42:03,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:42:03,348 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:03,348 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:03,348 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 338 states and 587 transitions. cyclomatic complexity: 294 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:03,369 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 338 states and 587 transitions. cyclomatic complexity: 294. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 455 states and 800 transitions. Complement of second has 6 states. [2025-04-26 18:42:03,369 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:03,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:42:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-04-26 18:42:03,370 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:42:03,370 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:03,370 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:42:03,370 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:03,370 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 82 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:42:03,370 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:42:03,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 455 states and 800 transitions. [2025-04-26 18:42:03,372 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:03,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 455 states to 0 states and 0 transitions. [2025-04-26 18:42:03,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:42:03,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:42:03,372 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:42:03,372 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:42:03,372 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:03,372 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:03,372 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:42:03,372 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 18:42:03,372 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:42:03,372 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:42:03,372 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:42:03,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:42:03,386 INFO L201 PluginConnector]: Adding new model adfg_2_seq_1.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:42:03 BoogieIcfgContainer [2025-04-26 18:42:03,386 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:42:03,386 INFO L158 Benchmark]: Toolchain (without parser) took 5595.07ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 95.2MB in the beginning and 45.1MB in the end (delta: 50.0MB). Peak memory consumption was 22.7MB. Max. memory is 8.0GB. [2025-04-26 18:42:03,386 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:03,387 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.01ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 93.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:42:03,387 INFO L158 Benchmark]: Boogie Preprocessor took 27.85ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 92.1MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:42:03,387 INFO L158 Benchmark]: RCFGBuilder took 190.05ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 82.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:42:03,387 INFO L158 Benchmark]: BuchiAutomizer took 5337.87ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 82.1MB in the beginning and 45.1MB in the end (delta: 37.0MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. [2025-04-26 18:42:03,388 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.16ms. Allocated memory is still 167.8MB. Free memory is still 96.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.01ms. Allocated memory is still 167.8MB. Free memory was 95.0MB in the beginning and 93.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 27.85ms. Allocated memory is still 167.8MB. Free memory was 93.1MB in the beginning and 92.1MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 190.05ms. Allocated memory is still 167.8MB. Free memory was 92.1MB in the beginning and 82.3MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 5337.87ms. Allocated memory was 167.8MB in the beginning and 142.6MB in the end (delta: -25.2MB). Free memory was 82.1MB in the beginning and 45.1MB in the end (delta: 37.0MB). Peak memory consumption was 10.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 3.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 1078 StatesRemovedByMinimization, 9 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 [8, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 674 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 672 mSDsluCounter, 912 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 375 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 349 IncrementalHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 537 mSDtfsCounter, 349 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc1 concLT0 SILN1 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax100 hnf100 lsp65 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq169 hnf94 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 48ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 252, Number of transitions in reduction automaton: 327, Number of states in reduction automaton: 180, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (2 trivial, 8 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 2 * n + -2 * x1 + t and consists of 5 locations. One deterministic module has affine ranking function 2 * n + -2 * x1 + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * n + -2 * x3 + 1 and consists of 6 locations. One deterministic module has affine ranking function 2 * n + -2 * x2 + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * n + -2 * x3 + 1 and consists of 6 locations. One deterministic module has affine ranking function 2 * n + -2 * x2 + 1 and consists of 4 locations. One deterministic module has affine ranking function -1 * z1 and consists of 4 locations. One deterministic module has affine ranking function -1 * z2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:42:03,398 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...