/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_x_t_indep.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:27,134 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:27,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:27,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:27,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:27,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:27,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:27,197 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:27,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:27,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:27,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:27,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:27,198 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:27,198 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:27,198 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:27,198 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:27,198 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:27,198 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:27,198 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:27,198 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:27,198 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:27,198 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:27,198 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:27,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:27,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:27,199 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:27,199 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:27,199 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:27,199 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:27,199 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:27,199 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:27,199 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:27,199 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:27,199 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:27,199 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:27,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:27,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:27,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:27,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:27,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:27,200 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:27,200 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:27,200 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:27,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:27,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:27,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:27,445 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:27,445 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:27,446 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/2_thr/adfg_2_x_t_indep.c.bpl [2025-04-26 16:56:27,446 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/2_thr/adfg_2_x_t_indep.c.bpl' [2025-04-26 16:56:27,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:27,463 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:27,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:27,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:27,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:27,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "adfg_2_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:27" (1/1) ... [2025-04-26 16:56:27,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "adfg_2_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:27" (1/1) ... [2025-04-26 16:56:27,501 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:27,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:27,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:27,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:27,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:27,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "adfg_2_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:27" (1/1) ... [2025-04-26 16:56:27,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "adfg_2_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:27" (1/1) ... [2025-04-26 16:56:27,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "adfg_2_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:27" (1/1) ... [2025-04-26 16:56:27,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "adfg_2_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:27" (1/1) ... [2025-04-26 16:56:27,510 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "adfg_2_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:27" (1/1) ... [2025-04-26 16:56:27,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "adfg_2_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:27" (1/1) ... [2025-04-26 16:56:27,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "adfg_2_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:27" (1/1) ... [2025-04-26 16:56:27,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "adfg_2_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:27" (1/1) ... [2025-04-26 16:56:27,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "adfg_2_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:27" (1/1) ... [2025-04-26 16:56:27,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:27,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:27,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:27,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:27,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "adfg_2_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:27" (1/1) ... [2025-04-26 16:56:27,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:27,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:27,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:27,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:56:27,577 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:27,577 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:27,577 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:27,577 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:27,577 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:27,577 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:27,577 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:27,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:27,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:27,578 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:56:27,616 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:27,618 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:27,710 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:27,711 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:27,720 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:27,721 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:27,721 INFO L201 PluginConnector]: Adding new model adfg_2_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:27 BoogieIcfgContainer [2025-04-26 16:56:27,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:27,722 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:27,722 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:27,726 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:27,726 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:27,726 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_2_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:27" (1/2) ... [2025-04-26 16:56:27,727 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@787a5f73 and model type adfg_2_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:27, skipping insertion in model container [2025-04-26 16:56:27,727 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:27,728 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "adfg_2_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:27" (2/2) ... [2025-04-26 16:56:27,728 INFO L376 chiAutomizerObserver]: Analyzing ICFG adfg_2_x_t_indep.c.bpl [2025-04-26 16:56:27,769 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:56:27,796 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:27,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:27,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:27,799 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:27,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:56:27,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 31 transitions, 76 flow [2025-04-26 16:56:27,852 INFO L116 PetriNetUnfolderBase]: 6/27 cut-off events. [2025-04-26 16:56:27,853 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:56:27,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 6/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 47 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 25. Up to 4 conditions per place. [2025-04-26 16:56:27,856 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 31 transitions, 76 flow [2025-04-26 16:56:27,858 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 27 transitions, 66 flow [2025-04-26 16:56:27,859 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 28 places, 27 transitions, 66 flow [2025-04-26 16:56:27,863 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:27,926 WARN L140 AmpleReduction]: Number of pruned transitions: 43 [2025-04-26 16:56:27,926 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:27,926 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 15 [2025-04-26 16:56:27,926 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:15 [2025-04-26 16:56:27,926 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:38 [2025-04-26 16:56:27,927 WARN L145 AmpleReduction]: Times succ was already a loop node:10 [2025-04-26 16:56:27,927 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:25 [2025-04-26 16:56:27,927 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:27,929 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 69 states, 68 states have (on average 1.6764705882352942) internal successors, (in total 114), 68 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:27,934 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:27,934 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:27,934 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:27,935 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:27,935 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:27,935 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:27,935 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:27,935 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:27,936 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 69 states, 68 states have (on average 1.6764705882352942) internal successors, (in total 114), 68 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:27,949 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 48 [2025-04-26 16:56:27,949 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:27,949 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:27,954 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:27,955 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:27,955 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:27,955 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 69 states, 68 states have (on average 1.6764705882352942) internal successors, (in total 114), 68 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:27,957 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 48 [2025-04-26 16:56:27,957 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:27,957 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:27,958 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:27,958 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:27,964 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[76] $Ultimate##0-->L25: Formula: (<= 1 v_b_2) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[78] L25-->L33-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" [2025-04-26 16:56:27,965 INFO L754 eck$LassoCheckResult]: Loop: "[81] L33-2-->L33: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[84] L33-->L39: Formula: (< v_b_1 1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[86] L39-->L33-2: Formula: (= (+ v_x1_1 v_t1_1) v_x1_2) InVars {t1=v_t1_1, x1=v_x1_2} OutVars{t1=v_t1_1, x1=v_x1_1} AuxVars[] AssignedVars[x1]" [2025-04-26 16:56:27,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:27,971 INFO L85 PathProgramCache]: Analyzing trace with hash 128325, now seen corresponding path program 1 times [2025-04-26 16:56:27,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:27,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292261371] [2025-04-26 16:56:27,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:27,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:28,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,028 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:28,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:28,050 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash 110322, now seen corresponding path program 1 times [2025-04-26 16:56:28,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:28,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000747741] [2025-04-26 16:56:28,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:28,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:28,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:28,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:28,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:28,070 INFO L85 PathProgramCache]: Analyzing trace with hash -471956690, now seen corresponding path program 1 times [2025-04-26 16:56:28,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:28,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742397253] [2025-04-26 16:56:28,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:28,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:28,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:28,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:28,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:28,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:28,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742397253] [2025-04-26 16:56:28,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742397253] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:28,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:28,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:28,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135943221] [2025-04-26 16:56:28,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:28,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:28,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:56:28,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:56:28,225 INFO L87 Difference]: Start difference. First operand has 69 states, 68 states have (on average 1.6764705882352942) internal successors, (in total 114), 68 states have internal predecessors, (114), 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 16:56:28,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:28,308 INFO L93 Difference]: Finished difference Result 104 states and 160 transitions. [2025-04-26 16:56:28,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 160 transitions. [2025-04-26 16:56:28,314 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 66 [2025-04-26 16:56:28,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 88 states and 136 transitions. [2025-04-26 16:56:28,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2025-04-26 16:56:28,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2025-04-26 16:56:28,326 INFO L74 IsDeterministic]: Start isDeterministic. Operand 88 states and 136 transitions. [2025-04-26 16:56:28,327 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:28,327 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88 states and 136 transitions. [2025-04-26 16:56:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states and 136 transitions. [2025-04-26 16:56:28,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-04-26 16:56:28,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.5454545454545454) internal successors, (in total 136), 87 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:28,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 136 transitions. [2025-04-26 16:56:28,401 INFO L240 hiAutomatonCegarLoop]: Abstraction has 88 states and 136 transitions. [2025-04-26 16:56:28,403 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:56:28,410 INFO L438 stractBuchiCegarLoop]: Abstraction has 88 states and 136 transitions. [2025-04-26 16:56:28,410 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:28,410 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 136 transitions. [2025-04-26 16:56:28,411 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 66 [2025-04-26 16:56:28,411 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:28,411 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:28,411 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:28,411 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:28,412 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[76] $Ultimate##0-->L25: Formula: (<= 1 v_b_2) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[78] L25-->L33-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" [2025-04-26 16:56:28,412 INFO L754 eck$LassoCheckResult]: Loop: "[81] L33-2-->L33: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[83] L33-->L35: Formula: (<= 1 v_b_4) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[85] L35-->L33-2: Formula: (= v_x1_5 (+ v_x1_6 v_t1_4)) InVars {t1=v_t1_4, x1=v_x1_6} OutVars{t1=v_t1_4, x1=v_x1_5} AuxVars[] AssignedVars[x1]" [2025-04-26 16:56:28,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:28,412 INFO L85 PathProgramCache]: Analyzing trace with hash 128325, now seen corresponding path program 2 times [2025-04-26 16:56:28,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:28,413 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519371461] [2025-04-26 16:56:28,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:28,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:28,419 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:28,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,420 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:28,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:28,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:28,426 INFO L85 PathProgramCache]: Analyzing trace with hash 110290, now seen corresponding path program 1 times [2025-04-26 16:56:28,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:28,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785985960] [2025-04-26 16:56:28,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:28,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:28,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,434 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:28,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:28,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:28,438 INFO L85 PathProgramCache]: Analyzing trace with hash -471956722, now seen corresponding path program 1 times [2025-04-26 16:56:28,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:28,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413025112] [2025-04-26 16:56:28,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:28,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:28,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:28,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:28,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,444 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:28,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:28,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:28,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:28,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:28,503 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:28,504 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:28,505 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:28,505 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:28,505 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:28,505 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:28,505 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:28,505 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:28,505 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_t_indep.c.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:56:28,505 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:28,505 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:28,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,529 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,570 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:28,570 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:28,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:28,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:28,573 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:28,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:56:28,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:28,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:28,600 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 16:56:28,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:28,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:28,603 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:28,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:56:28,606 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:28,607 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:28,756 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:28,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:56:28,763 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:28,763 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:28,763 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:28,764 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:28,764 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:28,764 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:28,764 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:28,764 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:28,764 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_t_indep.c.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:56:28,764 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:28,764 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:28,765 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:28,820 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:28,822 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:28,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:28,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:28,826 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:28,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:56:28,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:28,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:28,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:28,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:28,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:28,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:28,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:28,856 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:28,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:28,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:28,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:28,864 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:28,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:56:28,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:28,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:28,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:28,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:28,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:28,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:28,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:28,895 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:28,902 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:28,902 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:28,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:28,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:28,905 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:28,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:56:28,908 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:28,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:56:28,929 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:56:28,929 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:28,930 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x1) = 2*n - 2*x1 + 1 Supporting invariants [1*t1 - 1 >= 0] [2025-04-26 16:56:28,935 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 16:56:28,940 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:28,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:28,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:28,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:56:28,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:28,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:28,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:28,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:28,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:28,996 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:56:28,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:29,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:29,038 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:29,039 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 136 transitions. cyclomatic complexity: 66 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 16:56:29,106 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 136 transitions. cyclomatic complexity: 66. 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 164 states and 246 transitions. Complement of second has 6 states. [2025-04-26 16:56:29,106 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:29,107 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 16:56:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-04-26 16:56:29,110 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:56:29,111 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:29,111 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:56:29,111 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:29,111 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:56:29,111 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:29,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 246 transitions. [2025-04-26 16:56:29,113 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 75 [2025-04-26 16:56:29,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 124 states and 187 transitions. [2025-04-26 16:56:29,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2025-04-26 16:56:29,119 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2025-04-26 16:56:29,119 INFO L74 IsDeterministic]: Start isDeterministic. Operand 124 states and 187 transitions. [2025-04-26 16:56:29,119 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:29,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 124 states and 187 transitions. [2025-04-26 16:56:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states and 187 transitions. [2025-04-26 16:56:29,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 107. [2025-04-26 16:56:29,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.560747663551402) internal successors, (in total 167), 106 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 167 transitions. [2025-04-26 16:56:29,127 INFO L240 hiAutomatonCegarLoop]: Abstraction has 107 states and 167 transitions. [2025-04-26 16:56:29,127 INFO L438 stractBuchiCegarLoop]: Abstraction has 107 states and 167 transitions. [2025-04-26 16:56:29,127 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:29,127 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 167 transitions. [2025-04-26 16:56:29,128 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 66 [2025-04-26 16:56:29,128 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:29,128 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:29,128 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:29,128 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:29,129 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] $Ultimate##0-->L29: Formula: (< v_b_3 1) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[79] L29-->L33-2: Formula: (= (+ v_t1_3 1) 0) InVars {} OutVars{t1=v_t1_3} AuxVars[] AssignedVars[t1]" [2025-04-26 16:56:29,129 INFO L754 eck$LassoCheckResult]: Loop: "[81] L33-2-->L33: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[84] L33-->L39: Formula: (< v_b_1 1) InVars {b=v_b_1} OutVars{b=v_b_1} AuxVars[] AssignedVars[]" "[86] L39-->L33-2: Formula: (= (+ v_x1_1 v_t1_1) v_x1_2) InVars {t1=v_t1_1, x1=v_x1_2} OutVars{t1=v_t1_1, x1=v_x1_1} AuxVars[] AssignedVars[x1]" [2025-04-26 16:56:29,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:29,129 INFO L85 PathProgramCache]: Analyzing trace with hash 128357, now seen corresponding path program 1 times [2025-04-26 16:56:29,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:29,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318957710] [2025-04-26 16:56:29,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:29,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:29,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:29,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:29,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,136 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:29,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:29,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:29,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:29,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:29,139 INFO L85 PathProgramCache]: Analyzing trace with hash 110322, now seen corresponding path program 2 times [2025-04-26 16:56:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:29,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340141818] [2025-04-26 16:56:29,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:29,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:29,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:29,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:29,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:29,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,144 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:29,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:29,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:29,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:29,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:29,148 INFO L85 PathProgramCache]: Analyzing trace with hash -471003378, now seen corresponding path program 1 times [2025-04-26 16:56:29,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:29,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443683609] [2025-04-26 16:56:29,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:29,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:29,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:29,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:29,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,151 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:29,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:29,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:29,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:29,192 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:29,193 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:29,193 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:29,193 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:29,193 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:29,193 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,193 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:29,193 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:29,193 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_t_indep.c.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:56:29,193 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:29,193 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:29,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,244 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:29,245 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:29,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,247 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:29,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:56:29,250 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:29,251 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:29,262 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:29,262 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 16:56:29,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:29,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,271 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:29,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:56:29,273 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:29,273 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:29,292 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:29,292 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=0} Honda state: {b=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:29,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:56:29,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,300 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:29,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:56:29,301 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:29,302 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:29,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:29,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,323 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:29,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:56:29,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:29,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:29,438 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:29,443 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 16:56:29,444 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:29,444 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:29,444 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:29,444 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:29,444 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:29,444 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,444 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:29,444 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:29,444 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_t_indep.c.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:56:29,444 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:29,444 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:29,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,488 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:29,489 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:29,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,490 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:29,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:56:29,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:29,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:29,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:29,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:29,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:29,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:29,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:29,511 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:29,517 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 16:56:29,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,520 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:29,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:56:29,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:29,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:29,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:29,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:29,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:29,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:29,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:29,538 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:29,544 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 16:56:29,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,547 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:29,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:56:29,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:29,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:29,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:29,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:29,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:29,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:29,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:29,569 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:29,577 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:29,577 INFO L437 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:29,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,580 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:29,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:56:29,582 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:29,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:29,598 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:56:29,598 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:29,598 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x1) = 2*n - 2*x1 + 1 Supporting invariants [-1*t1 - 1 >= 0] [2025-04-26 16:56:29,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:29,606 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:29,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:29,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:29,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:29,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:29,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:56:29,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:29,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:29,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:29,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:29,638 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:56:29,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:29,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:29,663 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:29,663 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 167 transitions. cyclomatic complexity: 81 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 16:56:29,717 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 167 transitions. cyclomatic complexity: 81. 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 214 states and 323 transitions. Complement of second has 7 states. [2025-04-26 16:56:29,717 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:29,718 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 16:56:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2025-04-26 16:56:29,718 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:56:29,718 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:29,718 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:56:29,718 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:29,718 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:56:29,718 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:29,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 323 transitions. [2025-04-26 16:56:29,720 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 63 [2025-04-26 16:56:29,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 166 states and 247 transitions. [2025-04-26 16:56:29,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2025-04-26 16:56:29,722 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 125 [2025-04-26 16:56:29,722 INFO L74 IsDeterministic]: Start isDeterministic. Operand 166 states and 247 transitions. [2025-04-26 16:56:29,722 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:29,722 INFO L218 hiAutomatonCegarLoop]: Abstraction has 166 states and 247 transitions. [2025-04-26 16:56:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states and 247 transitions. [2025-04-26 16:56:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 111. [2025-04-26 16:56:29,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.5855855855855856) internal successors, (in total 176), 110 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 176 transitions. [2025-04-26 16:56:29,727 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 176 transitions. [2025-04-26 16:56:29,727 INFO L438 stractBuchiCegarLoop]: Abstraction has 111 states and 176 transitions. [2025-04-26 16:56:29,727 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:29,727 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 176 transitions. [2025-04-26 16:56:29,728 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 45 [2025-04-26 16:56:29,728 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:29,728 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:29,728 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:56:29,728 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:29,729 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] $Ultimate##0-->L29: Formula: (< v_b_3 1) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[79] L29-->L33-2: Formula: (= (+ v_t1_3 1) 0) InVars {} OutVars{t1=v_t1_3} AuxVars[] AssignedVars[t1]" "[81] L33-2-->L33: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" [2025-04-26 16:56:29,729 INFO L754 eck$LassoCheckResult]: Loop: "[83] L33-->L35: Formula: (<= 1 v_b_4) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[85] L35-->L33-2: Formula: (= v_x1_5 (+ v_x1_6 v_t1_4)) InVars {t1=v_t1_4, x1=v_x1_6} OutVars{t1=v_t1_4, x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[81] L33-2-->L33: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" [2025-04-26 16:56:29,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:29,729 INFO L85 PathProgramCache]: Analyzing trace with hash 3979148, now seen corresponding path program 1 times [2025-04-26 16:56:29,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:29,729 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342829126] [2025-04-26 16:56:29,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:29,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:29,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:29,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:29,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:29,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:29,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:29,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:29,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:29,735 INFO L85 PathProgramCache]: Analyzing trace with hash 112270, now seen corresponding path program 2 times [2025-04-26 16:56:29,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:29,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256397204] [2025-04-26 16:56:29,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:29,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:29,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:29,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:29,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:29,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:29,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:29,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:29,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:29,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:29,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1716203741, now seen corresponding path program 1 times [2025-04-26 16:56:29,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:29,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876519911] [2025-04-26 16:56:29,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:29,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:29,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:29,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:29,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:29,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:29,788 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876519911] [2025-04-26 16:56:29,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876519911] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:29,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:29,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:29,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667334910] [2025-04-26 16:56:29,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:29,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:29,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:56:29,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:56:29,808 INFO L87 Difference]: Start difference. First operand 111 states and 176 transitions. cyclomatic complexity: 86 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:29,821 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2025-04-26 16:56:29,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 121 transitions. [2025-04-26 16:56:29,822 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2025-04-26 16:56:29,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 70 states and 99 transitions. [2025-04-26 16:56:29,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-04-26 16:56:29,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-04-26 16:56:29,825 INFO L74 IsDeterministic]: Start isDeterministic. Operand 70 states and 99 transitions. [2025-04-26 16:56:29,825 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:29,825 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 99 transitions. [2025-04-26 16:56:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 99 transitions. [2025-04-26 16:56:29,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-04-26 16:56:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.4142857142857144) internal successors, (in total 99), 69 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 99 transitions. [2025-04-26 16:56:29,830 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 99 transitions. [2025-04-26 16:56:29,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:56:29,832 INFO L438 stractBuchiCegarLoop]: Abstraction has 70 states and 99 transitions. [2025-04-26 16:56:29,832 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:29,832 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 99 transitions. [2025-04-26 16:56:29,833 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2025-04-26 16:56:29,833 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:29,833 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:29,833 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:29,833 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:29,833 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[76] $Ultimate##0-->L25: Formula: (<= 1 v_b_2) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[78] L25-->L33-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[80] L33-2-->thread1FINAL: Formula: (< v_n_1 v_x1_3) InVars {x1=v_x1_3, n=v_n_1} OutVars{x1=v_x1_3, n=v_n_1} AuxVars[] AssignedVars[]" "[82] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[103] L14-->$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]" "[87] $Ultimate##0-->L49: Formula: (<= 1 v_b_7) InVars {b=v_b_7} OutVars{b=v_b_7} AuxVars[] AssignedVars[]" "[89] L49-->L57-2: Formula: (= v_t2_3 1) InVars {} OutVars{t2=v_t2_3} AuxVars[] AssignedVars[t2]" [2025-04-26 16:56:29,833 INFO L754 eck$LassoCheckResult]: Loop: "[92] L57-2-->L57: Formula: (<= v_x2_1 v_n_3) InVars {x2=v_x2_1, n=v_n_3} OutVars{x2=v_x2_1, n=v_n_3} AuxVars[] AssignedVars[]" "[94] L57-->L59: Formula: (<= 1 v_b_5) InVars {b=v_b_5} OutVars{b=v_b_5} AuxVars[] AssignedVars[]" "[96] L59-->L57-2: Formula: (= (+ v_x2_3 v_t2_1) v_x2_2) InVars {t2=v_t2_1, x2=v_x2_3} OutVars{t2=v_t2_1, x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:56:29,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:29,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1715190306, now seen corresponding path program 1 times [2025-04-26 16:56:29,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:29,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327250122] [2025-04-26 16:56:29,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:29,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:29,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:29,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:29,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,838 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:29,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:29,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:29,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:29,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash 121213, now seen corresponding path program 1 times [2025-04-26 16:56:29,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:29,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001056664] [2025-04-26 16:56:29,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:29,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:29,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:29,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:29,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,849 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:29,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:29,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:29,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:29,852 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:29,852 INFO L85 PathProgramCache]: Analyzing trace with hash 8576956, now seen corresponding path program 1 times [2025-04-26 16:56:29,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:29,852 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110381958] [2025-04-26 16:56:29,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:29,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:29,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:29,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:29,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,859 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:29,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:29,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:29,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:29,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:29,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:29,916 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:29,916 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:29,916 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:29,916 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:29,917 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:29,917 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,917 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:29,917 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:29,917 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_t_indep.c.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:56:29,917 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:29,917 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:29,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:29,990 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:29,990 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:29,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:29,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:29,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 16:56:29,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:56:29,995 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:29,995 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:30,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:30,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:30,014 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:30,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:56:30,017 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:30,017 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:30,160 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:30,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:30,166 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:30,166 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:30,166 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:30,166 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:30,166 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:30,166 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,167 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:30,167 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:30,167 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_t_indep.c.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:56:30,167 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:30,167 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:30,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,232 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:30,233 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:30,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:30,239 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:30,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:56:30,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:30,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:30,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:30,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:30,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:30,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:30,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:30,259 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:30,266 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:56:30,266 INFO L437 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:56:30,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:30,268 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 16:56:30,270 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 16:56:30,270 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:30,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:30,287 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-04-26 16:56:30,287 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:30,287 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = 1*x1 - 1*x2 Supporting invariants [1*x1 - 1*n - 1 >= 0, 1*t2 - 1 >= 0] [2025-04-26 16:56:30,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:30,296 INFO L156 tatePredicateManager]: 0 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:56:30,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:30,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:30,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:30,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:30,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:30,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:30,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:30,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:30,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:30,351 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:56:30,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:30,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:30,376 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 16:56:30,376 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 99 transitions. cyclomatic complexity: 41 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:30,423 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 99 transitions. cyclomatic complexity: 41. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 88 states and 123 transitions. Complement of second has 7 states. [2025-04-26 16:56:30,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 2 accepting loop states [2025-04-26 16:56:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2025-04-26 16:56:30,426 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:56:30,426 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:30,426 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 16:56:30,426 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:30,426 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 8 letters. Loop has 6 letters. [2025-04-26 16:56:30,426 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:30,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 123 transitions. [2025-04-26 16:56:30,427 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2025-04-26 16:56:30,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 66 states and 92 transitions. [2025-04-26 16:56:30,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-04-26 16:56:30,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2025-04-26 16:56:30,427 INFO L74 IsDeterministic]: Start isDeterministic. Operand 66 states and 92 transitions. [2025-04-26 16:56:30,427 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:30,427 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 92 transitions. [2025-04-26 16:56:30,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 92 transitions. [2025-04-26 16:56:30,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2025-04-26 16:56:30,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.4) internal successors, (in total 91), 64 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2025-04-26 16:56:30,430 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 91 transitions. [2025-04-26 16:56:30,430 INFO L438 stractBuchiCegarLoop]: Abstraction has 65 states and 91 transitions. [2025-04-26 16:56:30,430 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:56:30,430 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 91 transitions. [2025-04-26 16:56:30,430 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2025-04-26 16:56:30,430 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:30,430 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:30,430 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:30,430 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:30,431 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[77] $Ultimate##0-->L29: Formula: (< v_b_3 1) InVars {b=v_b_3} OutVars{b=v_b_3} AuxVars[] AssignedVars[]" "[79] L29-->L33-2: Formula: (= (+ v_t1_3 1) 0) InVars {} OutVars{t1=v_t1_3} AuxVars[] AssignedVars[t1]" "[80] L33-2-->thread1FINAL: Formula: (< v_n_1 v_x1_3) InVars {x1=v_x1_3, n=v_n_1} OutVars{x1=v_x1_3, n=v_n_1} AuxVars[] AssignedVars[]" "[82] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[103] L14-->$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]" "[88] $Ultimate##0-->L53: Formula: (< v_b_8 1) InVars {b=v_b_8} OutVars{b=v_b_8} AuxVars[] AssignedVars[]" "[90] L53-->L57-2: Formula: (= (+ v_t2_4 1) 0) InVars {} OutVars{t2=v_t2_4} AuxVars[] AssignedVars[t2]" [2025-04-26 16:56:30,431 INFO L754 eck$LassoCheckResult]: Loop: "[92] L57-2-->L57: Formula: (<= v_x2_1 v_n_3) InVars {x2=v_x2_1, n=v_n_3} OutVars{x2=v_x2_1, n=v_n_3} AuxVars[] AssignedVars[]" "[95] L57-->L63: Formula: (< v_b_6 1) InVars {b=v_b_6} OutVars{b=v_b_6} AuxVars[] AssignedVars[]" "[97] L63-->L57-2: Formula: (= v_x2_5 (+ v_x2_4 v_t2_2)) InVars {t2=v_t2_2, x2=v_x2_5} OutVars{t2=v_t2_2, x2=v_x2_4} AuxVars[] AssignedVars[x2]" [2025-04-26 16:56:30,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:30,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1663644126, now seen corresponding path program 1 times [2025-04-26 16:56:30,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:30,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56281937] [2025-04-26 16:56:30,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:30,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:30,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:30,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:30,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,434 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:30,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:30,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:30,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:30,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:30,437 INFO L85 PathProgramCache]: Analyzing trace with hash 121245, now seen corresponding path program 1 times [2025-04-26 16:56:30,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:30,437 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566800189] [2025-04-26 16:56:30,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:30,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:30,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:30,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:30,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,438 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:30,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:30,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:30,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:30,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:30,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1994437668, now seen corresponding path program 1 times [2025-04-26 16:56:30,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:30,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537388552] [2025-04-26 16:56:30,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:30,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:30,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:30,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:30,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,444 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:30,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:30,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:30,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:30,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:30,496 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:30,497 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:30,497 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:30,497 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:30,497 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:30,497 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,497 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:30,497 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:30,497 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_t_indep.c.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:56:30,497 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:30,497 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:30,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,556 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:30,557 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:30,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:30,559 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 16:56:30,560 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 16:56:30,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:30,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:30,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:30,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:30,578 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 16:56:30,578 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 16:56:30,579 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:30,579 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:30,708 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:30,714 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 16:56:30,715 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:30,715 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:30,715 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:30,715 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:30,715 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:30,715 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,715 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:30,715 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:30,715 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_t_indep.c.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:56:30,715 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:30,715 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:30,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:30,781 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:30,782 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:30,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:30,783 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 16:56:30,784 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 16:56:30,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:30,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:30,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:30,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:30,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:30,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:30,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:30,799 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:30,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:56:30,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:30,806 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 16:56:30,807 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 16:56:30,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:30,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:30,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:30,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:30,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:30,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:30,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:30,822 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:30,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:30,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:30,831 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 16:56:30,832 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 16:56:30,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:30,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:30,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:30,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:30,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:30,846 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:30,846 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:30,852 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:30,856 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:56:30,856 INFO L437 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:56:30,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:30,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:30,858 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 16:56:30,859 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 16:56:30,860 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:30,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:56:30,876 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:56:30,876 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:30,876 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, x2) = 2*n - 2*x2 + 1 Supporting invariants [-1*t2 - 1 >= 0] [2025-04-26 16:56:30,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:30,883 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:30,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:30,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:30,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:30,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:30,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:56:30,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:30,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:30,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:30,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:30,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:30,924 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:56:30,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:30,949 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:30,949 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 91 transitions. cyclomatic complexity: 38 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:30,993 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 91 transitions. cyclomatic complexity: 38. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 90 states and 128 transitions. Complement of second has 6 states. [2025-04-26 16:56:30,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:30,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2025-04-26 16:56:30,994 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 8 letters. Loop has 3 letters. [2025-04-26 16:56:30,994 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:30,994 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 16:56:30,994 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:30,994 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 8 letters. Loop has 6 letters. [2025-04-26 16:56:30,994 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:30,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 128 transitions. [2025-04-26 16:56:30,995 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 16:56:30,995 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 31 states and 42 transitions. [2025-04-26 16:56:30,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2025-04-26 16:56:30,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-04-26 16:56:30,995 INFO L74 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2025-04-26 16:56:30,995 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:30,995 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-04-26 16:56:30,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2025-04-26 16:56:30,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-04-26 16:56:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.3548387096774193) internal successors, (in total 42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2025-04-26 16:56:30,996 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-04-26 16:56:31,000 INFO L438 stractBuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-04-26 16:56:31,000 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:56:31,000 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 42 transitions. [2025-04-26 16:56:31,000 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 16:56:31,000 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:31,000 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:31,001 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:31,001 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:31,001 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[76] $Ultimate##0-->L25: Formula: (<= 1 v_b_2) InVars {b=v_b_2} OutVars{b=v_b_2} AuxVars[] AssignedVars[]" "[78] L25-->L33-2: Formula: (= v_t1_2 1) InVars {} OutVars{t1=v_t1_2} AuxVars[] AssignedVars[t1]" "[81] L33-2-->L33: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[83] L33-->L35: Formula: (<= 1 v_b_4) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[103] L14-->$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]" "[87] $Ultimate##0-->L49: Formula: (<= 1 v_b_7) InVars {b=v_b_7} OutVars{b=v_b_7} AuxVars[] AssignedVars[]" "[85] L35-->L33-2: Formula: (= v_x1_5 (+ v_x1_6 v_t1_4)) InVars {t1=v_t1_4, x1=v_x1_6} OutVars{t1=v_t1_4, x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[81] L33-2-->L33: Formula: (<= v_x1_4 v_n_2) InVars {x1=v_x1_4, n=v_n_2} OutVars{x1=v_x1_4, n=v_n_2} AuxVars[] AssignedVars[]" "[89] L49-->L57-2: Formula: (= v_t2_3 1) InVars {} OutVars{t2=v_t2_3} AuxVars[] AssignedVars[t2]" "[83] L33-->L35: Formula: (<= 1 v_b_4) InVars {b=v_b_4} OutVars{b=v_b_4} AuxVars[] AssignedVars[]" "[85] L35-->L33-2: Formula: (= v_x1_5 (+ v_x1_6 v_t1_4)) InVars {t1=v_t1_4, x1=v_x1_6} OutVars{t1=v_t1_4, x1=v_x1_5} AuxVars[] AssignedVars[x1]" "[80] L33-2-->thread1FINAL: Formula: (< v_n_1 v_x1_3) InVars {x1=v_x1_3, n=v_n_1} OutVars{x1=v_x1_3, n=v_n_1} AuxVars[] AssignedVars[]" [2025-04-26 16:56:31,001 INFO L754 eck$LassoCheckResult]: Loop: "[92] L57-2-->L57: Formula: (<= v_x2_1 v_n_3) InVars {x2=v_x2_1, n=v_n_3} OutVars{x2=v_x2_1, n=v_n_3} AuxVars[] AssignedVars[]" "[94] L57-->L59: Formula: (<= 1 v_b_5) InVars {b=v_b_5} OutVars{b=v_b_5} AuxVars[] AssignedVars[]" "[96] L59-->L57-2: Formula: (= (+ v_x2_3 v_t2_1) v_x2_2) InVars {t2=v_t2_1, x2=v_x2_3} OutVars{t2=v_t2_1, x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-04-26 16:56:31,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:31,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1818685384, now seen corresponding path program 1 times [2025-04-26 16:56:31,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:31,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829730124] [2025-04-26 16:56:31,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:31,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:31,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:31,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:31,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:31,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:31,006 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:31,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:31,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:31,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:31,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:31,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:31,013 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:31,013 INFO L85 PathProgramCache]: Analyzing trace with hash 121213, now seen corresponding path program 2 times [2025-04-26 16:56:31,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:31,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529788400] [2025-04-26 16:56:31,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:31,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:31,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:31,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:31,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:31,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:31,015 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:31,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:31,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:31,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:31,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:31,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:31,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:31,017 INFO L85 PathProgramCache]: Analyzing trace with hash -556072874, now seen corresponding path program 1 times [2025-04-26 16:56:31,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:31,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189484249] [2025-04-26 16:56:31,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:31,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:31,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:56:31,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:56:31,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:31,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:31,021 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:31,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:56:31,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:56:31,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:31,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:31,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:31,101 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:31,101 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:31,101 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:31,101 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:31,101 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:56:31,101 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:31,101 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:31,101 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:31,101 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_t_indep.c.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:56:31,101 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:31,101 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:31,102 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:31,105 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:31,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:31,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:31,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:31,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:31,169 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:31,169 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:56:31,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:31,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:31,171 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 16:56:31,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 16:56:31,189 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:31,189 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:31,206 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:31,206 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {b=1} Honda state: {b=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:56:31,212 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 16:56:31,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:31,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:31,213 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 16:56:31,214 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 16:56:31,215 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:31,215 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:31,225 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:56:31,225 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 16:56:31,230 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 16:56:31,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:31,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:31,232 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 16:56:31,233 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 16:56:31,233 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:56:31,233 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:31,256 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 16:56:31,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:31,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:31,270 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 16:56:31,270 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 16:56:31,271 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:56:31,271 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:56:31,424 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:56:31,430 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 16:56:31,430 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:31,430 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:31,430 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:31,430 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:31,430 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:31,430 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:31,431 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:31,431 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:31,431 INFO L132 ssoRankerPreferences]: Filename of dumped script: adfg_2_x_t_indep.c.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:56:31,431 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:31,431 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:31,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:31,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:31,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:31,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:31,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:31,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:31,494 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:31,495 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:31,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:31,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:31,496 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 16:56:31,497 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 16:56:31,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:31,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:31,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:31,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:31,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:31,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:31,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:31,511 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:31,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:56:31,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:31,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:31,519 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 16:56:31,521 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 16:56:31,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:31,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:31,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:31,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:31,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:31,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:31,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:31,542 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:31,550 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:56:31,550 INFO L437 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:56:31,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:31,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:31,552 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 16:56:31,553 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 16:56:31,554 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:31,569 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 16:56:31,570 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2025-04-26 16:56:31,570 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:31,570 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x1, x2) = 1*x1 - 1*x2 Supporting invariants [1*x1 - 1*n - 1 >= 0, 1*t2 - 1 >= 0] [2025-04-26 16:56:31,575 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 16:56:31,578 INFO L156 tatePredicateManager]: 0 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:56:31,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:31,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:31,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:31,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:31,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:31,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:31,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:31,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:31,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:31,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:31,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:31,635 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:56:31,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:31,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:56:31,659 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 16:56:31,659 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 17 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:31,694 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 42 transitions. cyclomatic complexity: 17. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 57 states and 80 transitions. Complement of second has 7 states. [2025-04-26 16:56:31,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:56:31,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2025-04-26 16:56:31,695 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 16:56:31,695 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:31,695 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 16 letters. Loop has 3 letters. [2025-04-26 16:56:31,695 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:31,696 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 13 letters. Loop has 6 letters. [2025-04-26 16:56:31,696 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:31,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 80 transitions. [2025-04-26 16:56:31,696 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:31,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 0 states and 0 transitions. [2025-04-26 16:56:31,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:31,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:31,696 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:31,696 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:31,696 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:31,696 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:31,696 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:31,696 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:56:31,696 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:31,697 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:31,697 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:31,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:56:31,707 INFO L201 PluginConnector]: Adding new model adfg_2_x_t_indep.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:31 BoogieIcfgContainer [2025-04-26 16:56:31,708 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:31,708 INFO L158 Benchmark]: Toolchain (without parser) took 4245.16ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.2MB in the beginning and 94.2MB in the end (delta: -8.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:31,708 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:31,708 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.98ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 84.2MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:31,709 INFO L158 Benchmark]: Boogie Preprocessor took 22.81ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 83.3MB in the end (delta: 948.5kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:31,709 INFO L158 Benchmark]: RCFGBuilder took 194.23ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 74.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:56:31,709 INFO L158 Benchmark]: BuchiAutomizer took 3985.71ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.0MB in the beginning and 94.2MB in the end (delta: -20.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:31,710 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.14ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.98ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 84.2MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.81ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 83.3MB in the end (delta: 948.5kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 194.23ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 74.2MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3985.71ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.0MB in the beginning and 94.2MB in the end (delta: -20.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 2.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 73 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 218 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 218 mSDsluCounter, 269 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 126 IncrementalHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 172 mSDtfsCounter, 126 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital32 mio100 ax100 hnf100 lsp53 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq176 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 134, Number of transitions in reduction automaton: 114, Number of states in reduction automaton: 69, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (2 trivial, 5 deterministic, 0 nondeterministic). 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 * x1 + 1 and consists of 4 locations. One deterministic module has affine ranking function x1 + -1 * x2 and consists of 5 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 x1 + -1 * x2 and consists of 5 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 16:56:31,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...