/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/buffer-mult-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:13:41,723 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:13:41,782 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:13:41,805 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:13:41,805 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:13:41,806 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:13:41,807 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:13:41,807 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:13:41,808 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:13:41,811 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:13:41,811 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:13:41,811 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:13:41,811 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:13:41,812 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:13:41,813 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:13:41,813 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:13:41,813 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:13:41,813 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:13:41,813 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:13:41,813 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:13:41,814 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:13:41,814 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:13:41,814 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:13:41,814 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:13:41,814 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:13:41,814 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:13:41,815 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:13:41,815 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:13:41,815 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:13:41,815 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:13:41,816 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:13:41,816 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:13:41,816 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:13:41,817 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:13:41,817 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_AUTOMATON [2023-10-12 17:13:41,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:13:42,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:13:42,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:13:42,002 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:13:42,009 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:13:42,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/buffer-mult-alt.wvr.bpl [2023-10-12 17:13:42,010 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-bad/buffer-mult-alt.wvr.bpl' [2023-10-12 17:13:42,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:13:42,062 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:13:42,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:42,063 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:13:42,063 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:13:42,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:42" (1/1) ... [2023-10-12 17:13:42,079 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:42" (1/1) ... [2023-10-12 17:13:42,098 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:13:42,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:42,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:13:42,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:13:42,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:13:42,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:42" (1/1) ... [2023-10-12 17:13:42,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:42" (1/1) ... [2023-10-12 17:13:42,113 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:42" (1/1) ... [2023-10-12 17:13:42,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:42" (1/1) ... [2023-10-12 17:13:42,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:42" (1/1) ... [2023-10-12 17:13:42,117 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:42" (1/1) ... [2023-10-12 17:13:42,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:42" (1/1) ... [2023-10-12 17:13:42,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:42" (1/1) ... [2023-10-12 17:13:42,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:13:42,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:13:42,119 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:13:42,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:13:42,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:42" (1/1) ... [2023-10-12 17:13:42,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:42,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:42,290 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:42,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:13:42,398 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:13:42,398 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:13:42,401 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:13:42,401 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:13:42,401 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:13:42,401 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:13:42,401 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:13:42,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:13:42,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:13:42,401 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:13:42,401 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:13:42,402 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:13:42,403 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-10-12 17:13:42,403 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-10-12 17:13:42,403 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-10-12 17:13:42,403 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:13:42,458 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:13:42,459 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:13:42,619 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:13:42,655 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:13:42,656 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:13:42,667 INFO L201 PluginConnector]: Adding new model buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:42 BoogieIcfgContainer [2023-10-12 17:13:42,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:13:42,668 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:13:42,668 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:13:42,670 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:13:42,671 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:42,671 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:42" (1/2) ... [2023-10-12 17:13:42,686 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66e17d45 and model type buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:13:42, skipping insertion in model container [2023-10-12 17:13:42,686 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:42,686 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:42" (2/2) ... [2023-10-12 17:13:42,687 INFO L332 chiAutomizerObserver]: Analyzing ICFG buffer-mult-alt.wvr.bpl [2023-10-12 17:13:42,793 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:13:42,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:13:42,859 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:13:42,859 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:13:42,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-10-12 17:13:42,869 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:13:42,875 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2023-10-12 17:13:42,881 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:13:42,930 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:13:42,932 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:13:42,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 86 flow [2023-10-12 17:13:42,945 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:13:42,945 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:13:42,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 31 events. 4/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2023-10-12 17:13:42,946 INFO L119 LiptonReduction]: Number of co-enabled transitions 350 [2023-10-12 17:13:43,258 INFO L134 LiptonReduction]: Checked pairs total: 553 [2023-10-12 17:13:43,258 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:13:43,276 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:13:43,276 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:13:43,276 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:13:43,276 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:13:43,277 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:13:43,277 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:13:43,277 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:13:43,278 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:13:43,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:13:43,352 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 152 [2023-10-12 17:13:43,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:43,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:43,356 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:13:43,356 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:43,356 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:13:43,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 163 states, but on-demand construction may add more states [2023-10-12 17:13:43,371 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 152 [2023-10-12 17:13:43,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:43,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:43,372 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:13:43,372 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:43,375 INFO L748 eck$LassoCheckResult]: Stem: 47#[$Ultimate##0]don't care [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L74]don't care [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L74-1, L25]don't care [2023-10-12 17:13:43,375 INFO L750 eck$LassoCheckResult]: Loop: 52#[L74-1, L25]don't care [126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back] 58#[L74-1, L26-1]don't care [90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i] 52#[L74-1, L25]don't care [2023-10-12 17:13:43,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:43,379 INFO L85 PathProgramCache]: Analyzing trace with hash 3454, now seen corresponding path program 1 times [2023-10-12 17:13:43,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:43,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317680642] [2023-10-12 17:13:43,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:43,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:43,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:43,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:43,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:43,564 INFO L85 PathProgramCache]: Analyzing trace with hash 4957, now seen corresponding path program 1 times [2023-10-12 17:13:43,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:43,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472647261] [2023-10-12 17:13:43,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:43,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:43,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:43,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:43,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:43,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:43,588 INFO L85 PathProgramCache]: Analyzing trace with hash 3323290, now seen corresponding path program 1 times [2023-10-12 17:13:43,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:43,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639999691] [2023-10-12 17:13:43,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:43,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:43,593 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:43,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:43,708 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:43,709 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:43,709 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:43,709 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:43,709 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:43,709 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:43,709 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:43,709 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:43,709 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:13:43,710 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:43,710 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:43,732 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:43,758 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:43,782 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:43,785 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:43,788 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:43,790 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:43,912 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:43,915 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:43,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:43,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:43,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:43,963 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 [2023-10-12 17:13:43,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2023-10-12 17:13:43,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:43,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:43,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:43,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:43,980 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:43,980 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:44,003 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:44,023 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:13:44,023 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:13:44,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:44,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:44,026 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:44,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2023-10-12 17:13:44,037 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:44,069 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:44,070 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:44,070 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:13:44,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:44,085 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:44,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:44,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:44,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:44,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:44,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:44,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:44,186 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 [2023-10-12 17:13:44,188 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 163 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:44,266 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 163 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 534 states and 2142 transitions. Complement of second has 7 states. [2023-10-12 17:13:44,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:44,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2023-10-12 17:13:44,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:13:44,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:44,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:13:44,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:44,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 2 letters. Loop has 4 letters. [2023-10-12 17:13:44,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:44,274 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 534 states and 2142 transitions. [2023-10-12 17:13:44,284 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 144 [2023-10-12 17:13:44,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 534 states to 385 states and 1593 transitions. [2023-10-12 17:13:44,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2023-10-12 17:13:44,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2023-10-12 17:13:44,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 385 states and 1593 transitions. [2023-10-12 17:13:44,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:44,296 INFO L219 hiAutomatonCegarLoop]: Abstraction has 385 states and 1593 transitions. [2023-10-12 17:13:44,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states and 1593 transitions. [2023-10-12 17:13:44,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 271. [2023-10-12 17:13:44,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 271 states have (on average 4.313653136531365) internal successors, (1169), 270 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 1169 transitions. [2023-10-12 17:13:44,348 INFO L241 hiAutomatonCegarLoop]: Abstraction has 271 states and 1169 transitions. [2023-10-12 17:13:44,348 INFO L430 stractBuchiCegarLoop]: Abstraction has 271 states and 1169 transitions. [2023-10-12 17:13:44,348 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:13:44,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 1169 transitions. [2023-10-12 17:13:44,351 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 144 [2023-10-12 17:13:44,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:44,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:44,355 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:13:44,355 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:44,359 INFO L748 eck$LassoCheckResult]: Stem: 1257#[$Ultimate##0]don't care [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 1259#[L74]don't care [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 1421#[L74-1, L25]don't care [109] L74-1-->L37: 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] 1147#[L37, L75, L25]don't care [2023-10-12 17:13:44,359 INFO L750 eck$LassoCheckResult]: Loop: 1147#[L37, L75, L25]don't care [122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back] 1153#[L38-1, L75, L25]don't care [95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j] 1147#[L37, L75, L25]don't care [2023-10-12 17:13:44,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:44,359 INFO L85 PathProgramCache]: Analyzing trace with hash 107183, now seen corresponding path program 1 times [2023-10-12 17:13:44,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:44,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828203281] [2023-10-12 17:13:44,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:44,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:44,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:44,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:44,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:44,368 INFO L85 PathProgramCache]: Analyzing trace with hash 4838, now seen corresponding path program 1 times [2023-10-12 17:13:44,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:44,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545748789] [2023-10-12 17:13:44,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:44,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:44,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:44,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:44,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:44,375 INFO L85 PathProgramCache]: Analyzing trace with hash 103006740, now seen corresponding path program 1 times [2023-10-12 17:13:44,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:44,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38403576] [2023-10-12 17:13:44,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:44,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:44,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:44,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:44,459 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:44,459 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:44,459 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:44,460 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:44,460 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:44,460 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:44,460 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:44,460 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:44,460 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:13:44,460 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:44,460 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:44,461 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:44,469 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:44,471 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:44,474 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:44,481 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:44,483 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:44,485 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:44,488 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:44,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:13:44,638 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:44,638 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:44,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:44,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:44,640 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:44,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2023-10-12 17:13:44,674 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 [2023-10-12 17:13:44,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:44,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:44,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:44,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:44,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:44,684 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:44,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:44,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:44,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:44,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:44,704 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:44,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2023-10-12 17:13:44,708 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 [2023-10-12 17:13:44,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:44,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:44,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:44,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:44,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:44,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:44,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:44,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2023-10-12 17:13:44,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:44,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:44,765 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:44,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2023-10-12 17:13:44,794 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 [2023-10-12 17:13:44,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:44,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:44,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:44,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:44,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:44,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:44,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:44,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:44,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:44,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:44,826 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:44,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2023-10-12 17:13:44,845 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 [2023-10-12 17:13:44,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:44,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:44,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:44,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:44,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:44,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:44,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:44,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:44,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:44,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:44,882 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:44,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2023-10-12 17:13:44,897 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 [2023-10-12 17:13:44,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:44,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:44,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:44,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:44,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:44,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:44,922 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:44,929 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:13:44,929 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:13:44,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:44,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:44,930 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:44,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2023-10-12 17:13:44,933 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:44,961 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:44,961 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:44,961 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:13:44,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:13:44,967 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:44,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:44,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:44,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:44,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:44,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:45,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:45,001 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 [2023-10-12 17:13:45,001 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 271 states and 1169 transitions. cyclomatic complexity: 956 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:45,071 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 271 states and 1169 transitions. cyclomatic complexity: 956. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 954 states and 4146 transitions. Complement of second has 7 states. [2023-10-12 17:13:45,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:45,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2023-10-12 17:13:45,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:13:45,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:45,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:13:45,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:45,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:13:45,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:45,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 954 states and 4146 transitions. [2023-10-12 17:13:45,083 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 124 [2023-10-12 17:13:45,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 954 states to 697 states and 3068 transitions. [2023-10-12 17:13:45,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 231 [2023-10-12 17:13:45,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 362 [2023-10-12 17:13:45,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 697 states and 3068 transitions. [2023-10-12 17:13:45,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:45,093 INFO L219 hiAutomatonCegarLoop]: Abstraction has 697 states and 3068 transitions. [2023-10-12 17:13:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states and 3068 transitions. [2023-10-12 17:13:45,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 566. [2023-10-12 17:13:45,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 566 states have (on average 4.669611307420495) internal successors, (2643), 565 states have internal predecessors, (2643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:45,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 2643 transitions. [2023-10-12 17:13:45,107 INFO L241 hiAutomatonCegarLoop]: Abstraction has 566 states and 2643 transitions. [2023-10-12 17:13:45,107 INFO L430 stractBuchiCegarLoop]: Abstraction has 566 states and 2643 transitions. [2023-10-12 17:13:45,107 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:13:45,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 566 states and 2643 transitions. [2023-10-12 17:13:45,111 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 124 [2023-10-12 17:13:45,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:45,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:45,112 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:13:45,112 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:45,112 INFO L748 eck$LassoCheckResult]: Stem: 2817#[$Ultimate##0]don't care [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 2819#[L74]don't care [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 3037#[L74-1, L25]don't care [109] L74-1-->L37: 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] 2729#[L37, L75, L25]don't care [112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 2733#[L25, L37, L76, L50-1]don't care [2023-10-12 17:13:45,112 INFO L750 eck$LassoCheckResult]: Loop: 2733#[L25, L37, L76, L50-1]don't care [97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 2899#[L25, L50, L37, L76]don't care [99] L50-->L50-1: Formula: (and (< v_q1_front_13 v_q1_back_8) (= (+ v_q1_front_13 1) v_q1_front_12) (= (+ (select v_q1_5 v_q1_front_13) v_total_16) v_total_15)) InVars {q1_front=v_q1_front_13, q1=v_q1_5, total=v_total_16, q1_back=v_q1_back_8} OutVars{q1_front=v_q1_front_12, q1=v_q1_5, total=v_total_15, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_front, total] 2733#[L25, L37, L76, L50-1]don't care [2023-10-12 17:13:45,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:45,112 INFO L85 PathProgramCache]: Analyzing trace with hash 3322785, now seen corresponding path program 1 times [2023-10-12 17:13:45,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:45,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124204585] [2023-10-12 17:13:45,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:45,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:45,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:45,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:45,121 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:45,121 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2023-10-12 17:13:45,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:45,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700572030] [2023-10-12 17:13:45,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:45,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:45,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:45,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:45,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:45,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:45,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1101767805, now seen corresponding path program 1 times [2023-10-12 17:13:45,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:45,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667034598] [2023-10-12 17:13:45,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:45,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:45,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:45,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:45,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667034598] [2023-10-12 17:13:45,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667034598] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:45,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:13:45,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:13:45,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128688266] [2023-10-12 17:13:45,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:45,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:45,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:13:45,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:13:45,182 INFO L87 Difference]: Start difference. First operand 566 states and 2643 transitions. cyclomatic complexity: 2172 Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:45,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:45,214 INFO L93 Difference]: Finished difference Result 839 states and 3757 transitions. [2023-10-12 17:13:45,214 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 839 states and 3757 transitions. [2023-10-12 17:13:45,223 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 186 [2023-10-12 17:13:45,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 839 states to 813 states and 3662 transitions. [2023-10-12 17:13:45,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 325 [2023-10-12 17:13:45,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 325 [2023-10-12 17:13:45,232 INFO L73 IsDeterministic]: Start isDeterministic. Operand 813 states and 3662 transitions. [2023-10-12 17:13:45,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:45,232 INFO L219 hiAutomatonCegarLoop]: Abstraction has 813 states and 3662 transitions. [2023-10-12 17:13:45,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states and 3662 transitions. [2023-10-12 17:13:45,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 743. [2023-10-12 17:13:45,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 743 states have (on average 4.60699865410498) internal successors, (3423), 742 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 3423 transitions. [2023-10-12 17:13:45,249 INFO L241 hiAutomatonCegarLoop]: Abstraction has 743 states and 3423 transitions. [2023-10-12 17:13:45,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:13:45,250 INFO L430 stractBuchiCegarLoop]: Abstraction has 743 states and 3423 transitions. [2023-10-12 17:13:45,250 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:13:45,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 743 states and 3423 transitions. [2023-10-12 17:13:45,256 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 164 [2023-10-12 17:13:45,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:45,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:45,256 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:13:45,256 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:45,256 INFO L748 eck$LassoCheckResult]: Stem: 4778#[$Ultimate##0]don't care [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 4780#[L74]don't care [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 5060#[L74-1, L25]don't care [109] L74-1-->L37: 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] 4670#[L37, L75, L25]don't care [112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 4674#[L25, L37, L76, L50-1]don't care [115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 4884#[L77, L50-1, L62-1, L37, L25]don't care [2023-10-12 17:13:45,257 INFO L750 eck$LassoCheckResult]: Loop: 4884#[L77, L50-1, L62-1, L37, L25]don't care [101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 5534#[L77, L62, L50-1, L37, L25]don't care [103] L62-->L62-1: Formula: (and (< v_q2_front_11 v_q2_back_14) (= (+ v_q2_front_11 1) v_q2_front_10) (= (+ (select v_q2_7 v_q2_front_11) v_total_20) v_total_19)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_11, q2_back=v_q2_back_14} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_10, q2_back=v_q2_back_14} AuxVars[] AssignedVars[total, q2_front] 4884#[L77, L50-1, L62-1, L37, L25]don't care [2023-10-12 17:13:45,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:45,257 INFO L85 PathProgramCache]: Analyzing trace with hash 103006450, now seen corresponding path program 1 times [2023-10-12 17:13:45,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:45,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720143990] [2023-10-12 17:13:45,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:45,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:45,261 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:45,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:45,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:45,265 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2023-10-12 17:13:45,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:45,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830255091] [2023-10-12 17:13:45,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:45,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:45,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:45,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:45,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash 204953876, now seen corresponding path program 1 times [2023-10-12 17:13:45,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:45,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397705687] [2023-10-12 17:13:45,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:45,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:45,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:45,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397705687] [2023-10-12 17:13:45,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397705687] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:45,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:13:45,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:13:45,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322342531] [2023-10-12 17:13:45,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:45,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:45,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:13:45,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:13:45,308 INFO L87 Difference]: Start difference. First operand 743 states and 3423 transitions. cyclomatic complexity: 2822 Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:45,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:45,338 INFO L93 Difference]: Finished difference Result 1115 states and 4878 transitions. [2023-10-12 17:13:45,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1115 states and 4878 transitions. [2023-10-12 17:13:45,349 INFO L131 ngComponentsAnalysis]: Automaton has 102 accepting balls. 230 [2023-10-12 17:13:45,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1115 states to 1076 states and 4736 transitions. [2023-10-12 17:13:45,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 443 [2023-10-12 17:13:45,360 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 443 [2023-10-12 17:13:45,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1076 states and 4736 transitions. [2023-10-12 17:13:45,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:45,360 INFO L219 hiAutomatonCegarLoop]: Abstraction has 1076 states and 4736 transitions. [2023-10-12 17:13:45,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states and 4736 transitions. [2023-10-12 17:13:45,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1014. [2023-10-12 17:13:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1014 states, 1014 states have (on average 4.477317554240631) internal successors, (4540), 1013 states have internal predecessors, (4540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:45,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 4540 transitions. [2023-10-12 17:13:45,409 INFO L241 hiAutomatonCegarLoop]: Abstraction has 1014 states and 4540 transitions. [2023-10-12 17:13:45,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:13:45,410 INFO L430 stractBuchiCegarLoop]: Abstraction has 1014 states and 4540 transitions. [2023-10-12 17:13:45,410 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:13:45,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1014 states and 4540 transitions. [2023-10-12 17:13:45,416 INFO L131 ngComponentsAnalysis]: Automaton has 93 accepting balls. 212 [2023-10-12 17:13:45,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:45,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:45,416 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:13:45,416 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:45,417 INFO L748 eck$LassoCheckResult]: Stem: 7363#[$Ultimate##0]don't care [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 7365#[L74]don't care [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 7685#[L74-1, L25]don't care [109] L74-1-->L37: 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] 7745#[L37, L75, L25]don't care [112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 8447#[L25, L37, L76, L50-1]don't care [126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back] 7373#[L37, L76, L50-1, L26-1]don't care [2023-10-12 17:13:45,417 INFO L750 eck$LassoCheckResult]: Loop: 7373#[L37, L76, L50-1, L26-1]don't care [97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 7375#[L37, L76, L26-1, L50]don't care [99] L50-->L50-1: Formula: (and (< v_q1_front_13 v_q1_back_8) (= (+ v_q1_front_13 1) v_q1_front_12) (= (+ (select v_q1_5 v_q1_front_13) v_total_16) v_total_15)) InVars {q1_front=v_q1_front_13, q1=v_q1_5, total=v_total_16, q1_back=v_q1_back_8} OutVars{q1_front=v_q1_front_12, q1=v_q1_5, total=v_total_15, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_front, total] 7373#[L37, L76, L50-1, L26-1]don't care [2023-10-12 17:13:45,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:45,417 INFO L85 PathProgramCache]: Analyzing trace with hash 103006461, now seen corresponding path program 1 times [2023-10-12 17:13:45,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:45,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948639133] [2023-10-12 17:13:45,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:45,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:45,421 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:45,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:45,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:45,424 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 2 times [2023-10-12 17:13:45,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:45,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506032276] [2023-10-12 17:13:45,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:45,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:45,426 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:45,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:45,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:45,429 INFO L85 PathProgramCache]: Analyzing trace with hash 204964319, now seen corresponding path program 1 times [2023-10-12 17:13:45,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:45,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339840888] [2023-10-12 17:13:45,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:45,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:45,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:45,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:45,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:45,567 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:45,567 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:45,567 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:45,567 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:45,567 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:45,567 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:45,567 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:45,567 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:45,567 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:13:45,567 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:45,567 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:45,568 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:45,571 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:45,588 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:45,590 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:45,594 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:45,596 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:45,598 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:45,600 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:45,602 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:45,605 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:45,607 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:45,711 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:45,711 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:45,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:45,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:45,725 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:45,752 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 [2023-10-12 17:13:45,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:45,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:45,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:45,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:45,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:45,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:45,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-10-12 17:13:45,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:45,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:45,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:45,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:45,813 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:45,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-10-12 17:13:45,828 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 [2023-10-12 17:13:45,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:45,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:45,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:45,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:45,839 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:45,839 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:45,848 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:45,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:45,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:45,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:45,853 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:45,884 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 [2023-10-12 17:13:45,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:45,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:45,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:45,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:45,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:45,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:45,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-10-12 17:13:45,908 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:45,914 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:13:45,915 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:13:45,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:45,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:46,142 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:46,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:13:46,144 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:46,152 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:46,153 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:46,153 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:13:46,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:46,161 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:46,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:46,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:46,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:46,186 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:46,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:46,189 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:13:46,189 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1014 states and 4540 transitions. cyclomatic complexity: 3721 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:46,253 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1014 states and 4540 transitions. cyclomatic complexity: 3721. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3399 states and 14910 transitions. Complement of second has 5 states. [2023-10-12 17:13:46,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:46,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2023-10-12 17:13:46,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:13:46,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:46,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:13:46,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:46,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:13:46,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:46,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3399 states and 14910 transitions. [2023-10-12 17:13:46,286 INFO L131 ngComponentsAnalysis]: Automaton has 144 accepting balls. 314 [2023-10-12 17:13:46,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3399 states to 2922 states and 12779 transitions. [2023-10-12 17:13:46,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 885 [2023-10-12 17:13:46,315 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1051 [2023-10-12 17:13:46,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2922 states and 12779 transitions. [2023-10-12 17:13:46,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:46,315 INFO L219 hiAutomatonCegarLoop]: Abstraction has 2922 states and 12779 transitions. [2023-10-12 17:13:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states and 12779 transitions. [2023-10-12 17:13:46,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2242. [2023-10-12 17:13:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2242 states have (on average 4.684656556645852) internal successors, (10503), 2241 states have internal predecessors, (10503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 10503 transitions. [2023-10-12 17:13:46,366 INFO L241 hiAutomatonCegarLoop]: Abstraction has 2242 states and 10503 transitions. [2023-10-12 17:13:46,366 INFO L430 stractBuchiCegarLoop]: Abstraction has 2242 states and 10503 transitions. [2023-10-12 17:13:46,366 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:13:46,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2242 states and 10503 transitions. [2023-10-12 17:13:46,379 INFO L131 ngComponentsAnalysis]: Automaton has 105 accepting balls. 236 [2023-10-12 17:13:46,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:46,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:46,379 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:13:46,379 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:46,380 INFO L748 eck$LassoCheckResult]: Stem: 12824#[$Ultimate##0]don't care [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 12826#[L74]don't care [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 13134#[L74-1, L25]don't care [109] L74-1-->L37: 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] 12706#[L37, L75, L25]don't care [112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 12710#[L25, L37, L76, L50-1]don't care [115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 12934#[L77, L50-1, L62-1, L37, L25]don't care [122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back] 13212#[L77, L50-1, L62-1, L25, L38-1]don't care [2023-10-12 17:13:46,380 INFO L750 eck$LassoCheckResult]: Loop: 13212#[L77, L50-1, L62-1, L25, L38-1]don't care [101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 16136#[L77, L62, L50-1, L25, L38-1]don't care [103] L62-->L62-1: Formula: (and (< v_q2_front_11 v_q2_back_14) (= (+ v_q2_front_11 1) v_q2_front_10) (= (+ (select v_q2_7 v_q2_front_11) v_total_20) v_total_19)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_11, q2_back=v_q2_back_14} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_10, q2_back=v_q2_back_14} AuxVars[] AssignedVars[total, q2_front] 13212#[L77, L50-1, L62-1, L25, L38-1]don't care [2023-10-12 17:13:46,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:46,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1101767224, now seen corresponding path program 1 times [2023-10-12 17:13:46,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:46,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484856083] [2023-10-12 17:13:46,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:46,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:46,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:46,388 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:46,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:46,388 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 2 times [2023-10-12 17:13:46,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:46,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771770702] [2023-10-12 17:13:46,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:46,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:46,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:46,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:46,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:46,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2058623082, now seen corresponding path program 1 times [2023-10-12 17:13:46,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:46,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938612096] [2023-10-12 17:13:46,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:46,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:46,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:46,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:46,578 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:46,578 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:46,578 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:46,578 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:46,579 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:46,579 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:46,579 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:46,579 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:46,579 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:13:46,579 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:46,579 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:46,582 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:46,584 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:46,586 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:46,591 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:46,593 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:46,595 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:46,597 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:46,599 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:46,615 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:46,617 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:46,619 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:46,620 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:46,622 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:46,624 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:46,627 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:46,753 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:46,753 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:46,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:46,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:46,755 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:46,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:13:46,783 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 [2023-10-12 17:13:46,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:46,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:46,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:46,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:46,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:46,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:46,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:46,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-10-12 17:13:46,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:46,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:46,813 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:46,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:13:46,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:46,816 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 [2023-10-12 17:13:46,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:46,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:46,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:46,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:46,824 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:46,824 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:46,840 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:46,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:46,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:46,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:46,846 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:46,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:13:46,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:46,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:46,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:46,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:46,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:46,857 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:46,857 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:46,872 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:46,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:46,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:46,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:46,880 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:46,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:13:46,884 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 [2023-10-12 17:13:46,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:46,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:46,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:46,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:46,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:46,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:46,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:46,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:46,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:46,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:46,912 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:46,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:13:46,927 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 [2023-10-12 17:13:46,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:46,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:46,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:46,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:46,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:46,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:46,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:46,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:46,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:46,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:46,953 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:46,958 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 [2023-10-12 17:13:46,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:46,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:46,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:46,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:46,965 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:46,965 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:46,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:13:46,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:46,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:46,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:46,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:46,986 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:46,992 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 [2023-10-12 17:13:46,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:46,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:46,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:46,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:46,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:46,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:47,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:13:47,016 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:47,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:47,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:47,030 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:47,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:13:47,033 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 [2023-10-12 17:13:47,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:47,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:47,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:47,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:47,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:47,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:47,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:47,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:47,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:47,076 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:47,083 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 [2023-10-12 17:13:47,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:47,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:47,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:47,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:47,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:47,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:47,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:13:47,103 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:47,110 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:13:47,110 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:13:47,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:47,111 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:47,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-10-12 17:13:47,114 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:47,136 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:47,136 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:47,136 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2023-10-12 17:13:47,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:47,140 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:47,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:47,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:47,158 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:47,168 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:47,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:47,171 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:13:47,171 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2242 states and 10503 transitions. cyclomatic complexity: 8615 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:47,272 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2242 states and 10503 transitions. cyclomatic complexity: 8615. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7308 states and 33175 transitions. Complement of second has 5 states. [2023-10-12 17:13:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2023-10-12 17:13:47,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:13:47,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:47,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:13:47,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:47,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 6 letters. Loop has 4 letters. [2023-10-12 17:13:47,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:47,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7308 states and 33175 transitions. [2023-10-12 17:13:47,346 INFO L131 ngComponentsAnalysis]: Automaton has 162 accepting balls. 350 [2023-10-12 17:13:47,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7308 states to 6199 states and 28191 transitions. [2023-10-12 17:13:47,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1525 [2023-10-12 17:13:47,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1673 [2023-10-12 17:13:47,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6199 states and 28191 transitions. [2023-10-12 17:13:47,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:47,415 INFO L219 hiAutomatonCegarLoop]: Abstraction has 6199 states and 28191 transitions. [2023-10-12 17:13:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6199 states and 28191 transitions. [2023-10-12 17:13:47,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6199 to 5132. [2023-10-12 17:13:47,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5132 states, 5132 states have (on average 4.751558846453625) internal successors, (24385), 5131 states have internal predecessors, (24385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5132 states to 5132 states and 24385 transitions. [2023-10-12 17:13:47,658 INFO L241 hiAutomatonCegarLoop]: Abstraction has 5132 states and 24385 transitions. [2023-10-12 17:13:47,658 INFO L430 stractBuchiCegarLoop]: Abstraction has 5132 states and 24385 transitions. [2023-10-12 17:13:47,658 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:13:47,658 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5132 states and 24385 transitions. [2023-10-12 17:13:47,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:47,711 INFO L131 ngComponentsAnalysis]: Automaton has 127 accepting balls. 280 [2023-10-12 17:13:47,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:47,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:47,712 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2023-10-12 17:13:47,712 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:47,712 INFO L748 eck$LassoCheckResult]: Stem: 24631#[$Ultimate##0]don't care [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 24633#[L74]don't care [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 24991#[L74-1, L25]don't care [109] L74-1-->L37: 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] 25051#[L37, L75, L25]don't care [112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 28297#[L25, L37, L76, L50-1]don't care [126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back] 32797#[L37, L76, L50-1, L26-1]don't care [90] L26-1-->L25: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i] 32805#[L25, L37, L76, L50-1]don't care [126] L25-->L26-1: Formula: (and (= (select v_q1_21 v_q1_back_43) v_C_20) (< v_i_28 v_N_22) (= (+ 1 v_q1_back_43) v_q1_back_42)) InVars {q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_43, C=v_C_20} OutVars{q1=v_q1_21, N=v_N_22, i=v_i_28, q1_back=v_q1_back_42, C=v_C_20} AuxVars[] AssignedVars[q1_back] 24767#[L37, L76, L50-1, L26-1]don't care [2023-10-12 17:13:47,712 INFO L750 eck$LassoCheckResult]: Loop: 24767#[L37, L76, L50-1, L26-1]don't care [97] L50-1-->L50: Formula: (or (< v_i_6 v_N_4) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_4, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 25235#[L37, L76, L26-1, L50]don't care [99] L50-->L50-1: Formula: (and (< v_q1_front_13 v_q1_back_8) (= (+ v_q1_front_13 1) v_q1_front_12) (= (+ (select v_q1_5 v_q1_front_13) v_total_16) v_total_15)) InVars {q1_front=v_q1_front_13, q1=v_q1_5, total=v_total_16, q1_back=v_q1_back_8} OutVars{q1_front=v_q1_front_12, q1=v_q1_5, total=v_total_15, q1_back=v_q1_back_8} AuxVars[] AssignedVars[q1_front, total] 24767#[L37, L76, L50-1, L26-1]don't care [2023-10-12 17:13:47,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:47,713 INFO L85 PathProgramCache]: Analyzing trace with hash 204964129, now seen corresponding path program 1 times [2023-10-12 17:13:47,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:47,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429089853] [2023-10-12 17:13:47,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:47,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:47,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:47,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:47,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:47,720 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 3 times [2023-10-12 17:13:47,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:47,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600811428] [2023-10-12 17:13:47,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:47,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:47,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:47,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:47,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:47,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:47,724 INFO L85 PathProgramCache]: Analyzing trace with hash -597964541, now seen corresponding path program 1 times [2023-10-12 17:13:47,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:47,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261902944] [2023-10-12 17:13:47,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:47,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:47,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:47,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:47,975 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:47,976 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:47,976 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:47,976 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:47,976 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:47,976 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:47,976 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:47,976 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:47,976 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:13:47,976 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:47,976 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:47,977 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:47,979 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:47,981 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:47,983 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:47,984 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:47,986 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:47,988 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:47,991 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:47,992 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:47,996 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:47,998 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:48,117 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:48,117 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:48,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,118 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:48,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:13:48,122 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 [2023-10-12 17:13:48,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:48,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:48,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,170 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:48,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-10-12 17:13:48,174 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 [2023-10-12 17:13:48,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,181 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,181 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:48,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:48,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,202 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:48,205 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 [2023-10-12 17:13:48,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,212 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,212 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-10-12 17:13:48,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:48,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:48,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,261 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:48,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-10-12 17:13:48,278 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 [2023-10-12 17:13:48,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,306 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:48,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:48,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,328 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:48,349 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 [2023-10-12 17:13:48,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-10-12 17:13:48,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,357 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,378 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:48,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:48,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,382 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:48,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-10-12 17:13:48,386 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 [2023-10-12 17:13:48,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,402 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:48,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:48,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,414 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:48,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-10-12 17:13:48,417 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 [2023-10-12 17:13:48,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:48,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:48,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,457 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:48,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-10-12 17:13:48,473 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 [2023-10-12 17:13:48,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:48,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:48,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,501 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:48,538 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 [2023-10-12 17:13:48,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,545 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,545 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-10-12 17:13:48,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:48,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:48,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,564 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:48,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-10-12 17:13:48,568 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 [2023-10-12 17:13:48,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,573 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:48,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:48,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,589 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:48,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-10-12 17:13:48,592 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 [2023-10-12 17:13:48,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,620 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:48,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:48,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,638 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:48,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-10-12 17:13:48,642 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 [2023-10-12 17:13:48,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:48,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:48,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:48,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:48,650 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:48,650 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:48,659 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:48,669 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:13:48,669 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:13:48,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:48,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:48,670 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:48,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-10-12 17:13:48,673 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:48,685 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:48,686 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:48,686 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_front, q1_back) = -1*q1_front + 1*q1_back Supporting invariants [] [2023-10-12 17:13:48,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:48,691 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:13:48,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:48,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:48,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:48,721 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:48,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:48,722 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:13:48,722 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5132 states and 24385 transitions. cyclomatic complexity: 19946 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:48,829 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5132 states and 24385 transitions. cyclomatic complexity: 19946. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 10188 states and 45326 transitions. Complement of second has 5 states. [2023-10-12 17:13:48,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2023-10-12 17:13:48,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:13:48,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:48,831 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:13:48,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:48,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:48,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:48,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:48,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:48,852 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:48,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:48,854 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:13:48,854 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5132 states and 24385 transitions. cyclomatic complexity: 19946 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:48,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:48,966 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5132 states and 24385 transitions. cyclomatic complexity: 19946. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 10188 states and 45326 transitions. Complement of second has 5 states. [2023-10-12 17:13:48,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2023-10-12 17:13:48,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:13:48,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:48,967 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:13:48,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:48,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:48,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:48,992 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:48,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:48,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:48,993 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:13:48,993 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5132 states and 24385 transitions. cyclomatic complexity: 19946 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:49,101 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5132 states and 24385 transitions. cyclomatic complexity: 19946. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12729 states and 57795 transitions. Complement of second has 5 states. [2023-10-12 17:13:49,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:49,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:49,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2023-10-12 17:13:49,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:13:49,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:49,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:13:49,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:49,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:13:49,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:49,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12729 states and 57795 transitions. [2023-10-12 17:13:49,211 INFO L131 ngComponentsAnalysis]: Automaton has 97 accepting balls. 194 [2023-10-12 17:13:49,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12729 states to 6975 states and 31135 transitions. [2023-10-12 17:13:49,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1459 [2023-10-12 17:13:49,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1699 [2023-10-12 17:13:49,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6975 states and 31135 transitions. [2023-10-12 17:13:49,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:49,357 INFO L219 hiAutomatonCegarLoop]: Abstraction has 6975 states and 31135 transitions. [2023-10-12 17:13:49,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6975 states and 31135 transitions. [2023-10-12 17:13:49,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6975 to 2925. [2023-10-12 17:13:49,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2925 states, 2925 states have (on average 4.552136752136752) internal successors, (13315), 2924 states have internal predecessors, (13315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:49,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 13315 transitions. [2023-10-12 17:13:49,444 INFO L241 hiAutomatonCegarLoop]: Abstraction has 2925 states and 13315 transitions. [2023-10-12 17:13:49,444 INFO L430 stractBuchiCegarLoop]: Abstraction has 2925 states and 13315 transitions. [2023-10-12 17:13:49,444 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:13:49,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2925 states and 13315 transitions. [2023-10-12 17:13:49,455 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 80 [2023-10-12 17:13:49,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:49,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:49,456 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-10-12 17:13:49,456 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:49,456 INFO L748 eck$LassoCheckResult]: Stem: 68060#[$Ultimate##0]don't care [77] $Ultimate##0-->L74: Formula: (and (= v_i_5 0) (<= 0 v_M_3) (= v_q2_front_1 v_q2_back_4) (< v_M_3 v_N_3) (= v_q1_back_4 v_q1_front_1) (= v_total_1 0) (= v_j_5 0) (< 0 v_C_3)) InVars {q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_3, M=v_M_3, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, C=v_C_3, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 68062#[L74]don't care [106] L74-->L25: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 68386#[L74-1, L25]don't care [109] L74-1-->L37: 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] 68430#[L37, L75, L25]don't care [112] L75-->L50-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 73606#[L25, L37, L76, L50-1]don't care [115] L76-->L62-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2] 73602#[L77, L50-1, L62-1, L37, L25]don't care [122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back] 73584#[L77, L50-1, L62-1, L25, L38-1]don't care [95] L38-1-->L37: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j] 71988#[L77, L50-1, L62-1, L37, L25]don't care [122] L37-->L38-1: Formula: (and (= (+ v_q2_back_19 1) v_q2_back_18) (= (+ v_C_18 (select v_q2_11 v_q2_back_19)) 0) (< v_j_10 v_M_8)) InVars {q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_19, j=v_j_10, C=v_C_18} OutVars{q2=v_q2_11, M=v_M_8, q2_back=v_q2_back_18, j=v_j_10, C=v_C_18} AuxVars[] AssignedVars[q2_back] 69692#[L77, L50-1, L62-1, L25, L38-1]don't care [2023-10-12 17:13:49,456 INFO L750 eck$LassoCheckResult]: Loop: 69692#[L77, L50-1, L62-1, L25, L38-1]don't care [101] L62-1-->L62: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_M_4)) InVars {M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{M=v_M_4, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 70040#[L77, L62, L50-1, L25, L38-1]don't care [103] L62-->L62-1: Formula: (and (< v_q2_front_11 v_q2_back_14) (= (+ v_q2_front_11 1) v_q2_front_10) (= (+ (select v_q2_7 v_q2_front_11) v_total_20) v_total_19)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_11, q2_back=v_q2_back_14} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_10, q2_back=v_q2_back_14} AuxVars[] AssignedVars[total, q2_front] 69692#[L77, L50-1, L62-1, L25, L38-1]don't care [2023-10-12 17:13:49,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,457 INFO L85 PathProgramCache]: Analyzing trace with hash 2058622915, now seen corresponding path program 1 times [2023-10-12 17:13:49,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:49,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755759150] [2023-10-12 17:13:49,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:49,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,461 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:49,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,465 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 3 times [2023-10-12 17:13:49,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:49,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393359517] [2023-10-12 17:13:49,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:49,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:49,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1643298907, now seen corresponding path program 1 times [2023-10-12 17:13:49,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:49,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988521684] [2023-10-12 17:13:49,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:49,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,472 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:49,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:49,718 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:49,718 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:49,718 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:49,718 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:49,718 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:49,718 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:49,718 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:49,718 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:49,718 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult-alt.wvr.bpl_BEv2_Iteration8_Lasso [2023-10-12 17:13:49,718 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:49,718 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:49,720 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,722 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,723 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,725 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,727 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,728 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,730 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,733 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,752 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,754 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,755 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,758 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,759 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,762 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,764 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:13:49,886 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:49,886 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:49,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:49,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:49,894 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:49,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-10-12 17:13:49,904 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 [2023-10-12 17:13:49,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:49,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:49,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:49,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:49,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:49,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:49,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:49,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:49,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:49,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:49,957 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:49,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-10-12 17:13:49,961 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 [2023-10-12 17:13:49,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:49,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:49,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:49,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:49,967 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:49,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:49,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:50,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:50,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,017 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:50,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-10-12 17:13:50,020 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 [2023-10-12 17:13:50,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:50,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:50,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:50,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:50,027 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:50,027 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:50,029 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:50,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:50,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,033 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:50,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-10-12 17:13:50,037 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 [2023-10-12 17:13:50,042 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:50,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:50,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:50,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:50,044 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:50,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:50,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:50,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:50,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,057 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:50,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-10-12 17:13:50,060 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 [2023-10-12 17:13:50,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:50,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:50,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:50,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:50,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:50,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:50,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:50,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:50,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,073 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:50,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-10-12 17:13:50,076 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 [2023-10-12 17:13:50,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:50,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:50,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:50,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:50,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:50,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:50,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:50,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:50,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,100 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:50,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-10-12 17:13:50,103 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 [2023-10-12 17:13:50,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:50,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:50,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:50,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:50,110 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:50,110 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:50,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:50,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:50,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,116 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:50,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-10-12 17:13:50,120 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 [2023-10-12 17:13:50,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:50,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:50,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:50,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:50,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:50,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:50,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:50,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:50,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,142 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:50,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2023-10-12 17:13:50,145 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 [2023-10-12 17:13:50,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:50,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:50,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:50,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:50,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:50,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:50,169 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:50,173 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:13:50,173 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:13:50,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,174 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:50,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-10-12 17:13:50,177 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:50,198 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:50,198 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:50,198 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q2_front, q2_back) = -1*q2_front + 1*q2_back Supporting invariants [] [2023-10-12 17:13:50,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:50,218 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:13:50,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:50,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:50,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:50,243 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:50,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:50,244 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:13:50,244 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2925 states and 13315 transitions. cyclomatic complexity: 10696 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:50,294 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2925 states and 13315 transitions. cyclomatic complexity: 10696. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5369 states and 23376 transitions. Complement of second has 5 states. [2023-10-12 17:13:50,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:50,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2023-10-12 17:13:50,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:13:50,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:50,295 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:13:50,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:50,310 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:50,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:50,320 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:50,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:50,323 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:13:50,323 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2925 states and 13315 transitions. cyclomatic complexity: 10696 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:50,373 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2925 states and 13315 transitions. cyclomatic complexity: 10696. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5369 states and 23376 transitions. Complement of second has 5 states. [2023-10-12 17:13:50,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:50,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2023-10-12 17:13:50,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:13:50,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:50,374 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:13:50,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:50,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:50,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:50,400 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:50,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:50,402 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:13:50,402 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2925 states and 13315 transitions. cyclomatic complexity: 10696 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:50,475 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2925 states and 13315 transitions. cyclomatic complexity: 10696. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7643 states and 32936 transitions. Complement of second has 5 states. [2023-10-12 17:13:50,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:13:50,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:13:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2023-10-12 17:13:50,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 50 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:13:50,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:50,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 50 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:13:50,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:50,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 50 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:13:50,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:50,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7643 states and 32936 transitions. [2023-10-12 17:13:50,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:50,598 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:13:50,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7643 states to 0 states and 0 transitions. [2023-10-12 17:13:50,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:13:50,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:13:50,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:13:50,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:13:50,599 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:50,599 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:50,599 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:50,599 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:13:50,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:13:50,599 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:13:50,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:13:50,603 INFO L201 PluginConnector]: Adding new model buffer-mult-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:13:50 BoogieIcfgContainer [2023-10-12 17:13:50,603 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:13:50,603 INFO L158 Benchmark]: Toolchain (without parser) took 8541.55ms. Allocated memory was 234.9MB in the beginning and 954.2MB in the end (delta: 719.3MB). Free memory was 184.7MB in the beginning and 764.2MB in the end (delta: -579.5MB). Peak memory consumption was 139.7MB. Max. memory is 8.0GB. [2023-10-12 17:13:50,603 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.52ms. Allocated memory is still 234.9MB. Free memory is still 185.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:13:50,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.96ms. Allocated memory is still 234.9MB. Free memory was 184.7MB in the beginning and 183.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:13:50,604 INFO L158 Benchmark]: Boogie Preprocessor took 18.15ms. Allocated memory is still 234.9MB. Free memory was 183.1MB in the beginning and 182.1MB in the end (delta: 977.6kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:13:50,604 INFO L158 Benchmark]: RCFGBuilder took 548.24ms. Allocated memory is still 234.9MB. Free memory was 182.0MB in the beginning and 170.3MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-10-12 17:13:50,604 INFO L158 Benchmark]: BuchiAutomizer took 7935.25ms. Allocated memory was 234.9MB in the beginning and 954.2MB in the end (delta: 719.3MB). Free memory was 170.2MB in the beginning and 764.2MB in the end (delta: -594.0MB). Peak memory consumption was 125.1MB. Max. memory is 8.0GB. [2023-10-12 17:13:50,605 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.52ms. Allocated memory is still 234.9MB. Free memory is still 185.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.96ms. Allocated memory is still 234.9MB. Free memory was 184.7MB in the beginning and 183.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.15ms. Allocated memory is still 234.9MB. Free memory was 183.1MB in the beginning and 182.1MB in the end (delta: 977.6kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 548.24ms. Allocated memory is still 234.9MB. Free memory was 182.0MB in the beginning and 170.3MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 7935.25ms. Allocated memory was 234.9MB in the beginning and 954.2MB in the end (delta: 719.3MB). Free memory was 170.2MB in the beginning and 764.2MB in the end (delta: -594.0MB). Peak memory consumption was 125.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (2 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function M + -1 * j and consists of 5 locations. One deterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One deterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. One nondeterministic module has affine ranking function -1 * q1_front + q1_back and consists of 3 locations. One nondeterministic module has affine ranking function q2_back + -1 * q2_front and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 4.6s. Construction of modules took 0.2s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 6174 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 342 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 113 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 490 IncrementalHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 77 mSDtfsCounter, 490 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital71 mio100 ax100 hnf100 lsp46 ukn94 mio100 lsp70 div100 bol100 ite100 ukn100 eq185 hnf92 smp100 dnf100 smp100 tf100 neg100 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 154ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 40 PlacesBefore, 32 PlacesAfterwards, 31 TransitionsBefore, 23 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 553 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 410, independent: 386, independent conditional: 0, independent unconditional: 386, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 223, independent: 214, independent conditional: 0, independent unconditional: 214, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 223, independent: 202, independent conditional: 0, independent unconditional: 202, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 116, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 410, independent: 172, independent conditional: 0, independent unconditional: 172, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 223, unknown conditional: 0, unknown unconditional: 223] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:13:50,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...