/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-more/buffer-mult.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:13:48,704 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:13:48,748 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:48,768 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:13:48,768 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:13:48,769 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:13:48,770 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:13:48,770 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:13:48,770 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:13:48,771 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:13:48,771 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:13:48,772 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:13:48,772 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:13:48,772 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:13:48,773 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:13:48,773 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:13:48,773 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:13:48,774 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:13:48,774 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:13:48,774 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:13:48,775 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:13:48,775 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:13:48,775 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:13:48,776 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:13:48,776 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:13:48,776 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:13:48,777 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:13:48,777 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:13:48,777 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:13:48,778 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:13:48,778 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:13:48,778 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:13:48,779 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:13:48,780 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:13:48,780 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:49,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:13:49,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:13:49,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:13:49,048 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:13:49,049 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:13:49,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-mult.wvr.bpl [2023-10-12 17:13:49,051 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/buffer-mult.wvr.bpl' [2023-10-12 17:13:49,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:13:49,081 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:13:49,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:49,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:13:49,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:13:49,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:49" (1/1) ... [2023-10-12 17:13:49,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:49" (1/1) ... [2023-10-12 17:13:49,114 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:13:49,115 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:49,117 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:13:49,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:13:49,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:13:49,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:49" (1/1) ... [2023-10-12 17:13:49,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:49" (1/1) ... [2023-10-12 17:13:49,129 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:49" (1/1) ... [2023-10-12 17:13:49,129 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:49" (1/1) ... [2023-10-12 17:13:49,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:49" (1/1) ... [2023-10-12 17:13:49,142 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:49" (1/1) ... [2023-10-12 17:13:49,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:49" (1/1) ... [2023-10-12 17:13:49,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:49" (1/1) ... [2023-10-12 17:13:49,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:13:49,151 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:13:49,151 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:13:49,152 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:13:49,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:49" (1/1) ... [2023-10-12 17:13:49,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:49,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:49,196 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:49,222 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:49,232 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:13:49,232 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:13:49,232 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:13:49,232 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:13:49,232 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:13:49,232 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:13:49,233 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:13:49,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:13:49,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:13:49,233 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:13:49,234 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:13:49,234 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:13:49,234 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2023-10-12 17:13:49,234 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-10-12 17:13:49,234 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-10-12 17:13:49,235 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:49,281 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:13:49,283 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:13:49,391 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:13:49,416 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:13:49,416 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:13:49,418 INFO L201 PluginConnector]: Adding new model buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:49 BoogieIcfgContainer [2023-10-12 17:13:49,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:13:49,419 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:13:49,419 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:13:49,422 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:13:49,423 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:49,423 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:49" (1/2) ... [2023-10-12 17:13:49,429 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@46a8ad3a and model type buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:13:49, skipping insertion in model container [2023-10-12 17:13:49,429 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:49,429 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:49" (2/2) ... [2023-10-12 17:13:49,430 INFO L332 chiAutomizerObserver]: Analyzing ICFG buffer-mult.wvr.bpl [2023-10-12 17:13:49,506 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:13:49,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:13:49,565 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:13:49,566 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:13:49,570 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 7. Compared 55 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:49,571 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 39 transitions, 110 flow [2023-10-12 17:13:49,585 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 31 transitions, 86 flow [2023-10-12 17:13:49,589 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:13:49,601 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:13:49,603 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 31 transitions, 86 flow [2023-10-12 17:13:49,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 86 flow [2023-10-12 17:13:49,618 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-10-12 17:13:49,618 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:13:49,620 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 7. Compared 55 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:49,623 INFO L119 LiptonReduction]: Number of co-enabled transitions 350 [2023-10-12 17:13:49,849 INFO L134 LiptonReduction]: Checked pairs total: 505 [2023-10-12 17:13:49,850 INFO L136 LiptonReduction]: Total number of compositions: 9 [2023-10-12 17:13:49,867 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:13:49,867 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:13:49,867 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:13:49,867 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:13:49,867 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:13:49,867 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:13:49,867 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:13:49,868 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:13:49,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:13:49,945 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 152 [2023-10-12 17:13:49,946 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:49,946 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:49,950 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:13:49,950 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:49,950 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:13:49,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 163 states, but on-demand construction may add more states [2023-10-12 17:13:49,961 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 152 [2023-10-12 17:13:49,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:49,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:49,962 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:13:49,962 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:49,967 INFO L748 eck$LassoCheckResult]: Stem: 47#[$Ultimate##0]don't care [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 50#[L73]don't care [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 52#[L73-1, L24]don't care [2023-10-12 17:13:49,967 INFO L750 eck$LassoCheckResult]: Loop: 52#[L73-1, L24]don't care [126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back] 58#[L73-1, L25-1]don't care [90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i] 52#[L73-1, L24]don't care [2023-10-12 17:13:49,971 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:49,972 INFO L85 PathProgramCache]: Analyzing trace with hash 3578, now seen corresponding path program 1 times [2023-10-12 17:13:49,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:49,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124932875] [2023-10-12 17:13:49,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:49,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:50,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,062 INFO L85 PathProgramCache]: Analyzing trace with hash 4957, now seen corresponding path program 1 times [2023-10-12 17:13:50,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:50,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605297616] [2023-10-12 17:13:50,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:50,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:50,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,081 INFO L85 PathProgramCache]: Analyzing trace with hash 3442454, now seen corresponding path program 1 times [2023-10-12 17:13:50,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:50,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807310891] [2023-10-12 17:13:50,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:50,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:50,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:50,186 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:50,186 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:50,186 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:50,187 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:50,187 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:50,187 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,187 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:50,187 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:50,187 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:13:50,187 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:50,188 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:50,200 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:50,219 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:50,228 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:50,232 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:50,235 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:50,239 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:50,328 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:50,332 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:50,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,336 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:50,345 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,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:50,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:13:50,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:50,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:50,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:50,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:13:50,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:13:50,360 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:50,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:50,385 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:50,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,387 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:50,389 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:50,402 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,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:50,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:50,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:50,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:50,417 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:50,417 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:50,436 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:50,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:50,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,447 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:50,449 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:50,495 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,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:50,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:50,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:50,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:50,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:50,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:50,529 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:50,560 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:13:50,560 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:13:50,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:50,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:50,565 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:50,566 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:50,838 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:50,854 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:50,855 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:50,855 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:13:50,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:13:50,861 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:50,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:50,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:50,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:50,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:50,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:50,940 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,964 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:50,966 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:51,114 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:51,117 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:51,124 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:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2023-10-12 17:13:51,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:13:51,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:51,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:13:51,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:51,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 2 letters. Loop has 4 letters. [2023-10-12 17:13:51,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:51,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 534 states and 2142 transitions. [2023-10-12 17:13:51,152 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 144 [2023-10-12 17:13:51,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 534 states to 385 states and 1593 transitions. [2023-10-12 17:13:51,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2023-10-12 17:13:51,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 269 [2023-10-12 17:13:51,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 385 states and 1593 transitions. [2023-10-12 17:13:51,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:51,176 INFO L219 hiAutomatonCegarLoop]: Abstraction has 385 states and 1593 transitions. [2023-10-12 17:13:51,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states and 1593 transitions. [2023-10-12 17:13:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 271. [2023-10-12 17:13:51,221 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:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 1169 transitions. [2023-10-12 17:13:51,224 INFO L241 hiAutomatonCegarLoop]: Abstraction has 271 states and 1169 transitions. [2023-10-12 17:13:51,224 INFO L430 stractBuchiCegarLoop]: Abstraction has 271 states and 1169 transitions. [2023-10-12 17:13:51,225 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:13:51,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 1169 transitions. [2023-10-12 17:13:51,228 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 144 [2023-10-12 17:13:51,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:51,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:51,228 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:13:51,228 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:51,229 INFO L748 eck$LassoCheckResult]: Stem: 1267#[$Ultimate##0]don't care [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 1269#[L73]don't care [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 1459#[L73-1, L24]don't care [109] L73-1-->L36: 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] 953#[L24, L36, L74]don't care [2023-10-12 17:13:51,229 INFO L750 eck$LassoCheckResult]: Loop: 953#[L24, L36, L74]don't care [121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back] 945#[L24, L74, L37-1]don't care [95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j] 953#[L24, L36, L74]don't care [2023-10-12 17:13:51,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:51,230 INFO L85 PathProgramCache]: Analyzing trace with hash 111027, now seen corresponding path program 1 times [2023-10-12 17:13:51,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:51,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878188192] [2023-10-12 17:13:51,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:51,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:51,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:51,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:51,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:51,241 INFO L85 PathProgramCache]: Analyzing trace with hash 4807, now seen corresponding path program 1 times [2023-10-12 17:13:51,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:51,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459739229] [2023-10-12 17:13:51,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:51,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:51,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:51,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:51,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:51,252 INFO L85 PathProgramCache]: Analyzing trace with hash 106700793, now seen corresponding path program 1 times [2023-10-12 17:13:51,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:51,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795958431] [2023-10-12 17:13:51,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:51,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:51,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:51,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:51,354 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:51,355 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:51,355 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:51,355 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:51,355 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:51,356 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:51,356 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:51,356 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:51,356 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:13:51,356 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:51,356 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:51,358 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:51,361 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:51,364 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:51,372 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:51,374 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:51,382 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:51,384 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:51,387 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:51,483 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:51,483 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:51,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:51,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:51,485 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:51,494 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:51,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:51,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:51,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:51,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:51,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:51,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:51,511 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:51,525 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:51,531 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:51,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:51,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:51,685 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:51,687 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:51,688 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:51,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:51,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:51,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:51,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:51,698 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:51,698 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:51,725 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:51,731 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:51,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:51,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:51,733 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:51,735 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:51,736 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:51,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:51,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:51,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:51,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:51,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:51,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:51,765 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:51,773 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:13:51,773 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:13:51,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:51,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:51,777 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:51,779 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:51,780 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:51,818 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:51,818 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:51,818 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(j, N) = -1*j + 1*N Supporting invariants [] [2023-10-12 17:13:51,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:51,828 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:51,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:51,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:51,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:51,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:51,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:51,879 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:51,879 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:51,880 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:51,975 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:51,975 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:51,976 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:51,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2023-10-12 17:13:51,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:13:51,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:51,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:13:51,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:51,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 60 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:13:51,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:51,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 954 states and 4146 transitions. [2023-10-12 17:13:51,992 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 124 [2023-10-12 17:13:52,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 954 states to 697 states and 3068 transitions. [2023-10-12 17:13:52,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 231 [2023-10-12 17:13:52,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 362 [2023-10-12 17:13:52,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 697 states and 3068 transitions. [2023-10-12 17:13:52,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:52,005 INFO L219 hiAutomatonCegarLoop]: Abstraction has 697 states and 3068 transitions. [2023-10-12 17:13:52,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states and 3068 transitions. [2023-10-12 17:13:52,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 566. [2023-10-12 17:13:52,049 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:52,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 2643 transitions. [2023-10-12 17:13:52,054 INFO L241 hiAutomatonCegarLoop]: Abstraction has 566 states and 2643 transitions. [2023-10-12 17:13:52,054 INFO L430 stractBuchiCegarLoop]: Abstraction has 566 states and 2643 transitions. [2023-10-12 17:13:52,054 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:13:52,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 566 states and 2643 transitions. [2023-10-12 17:13:52,060 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 124 [2023-10-12 17:13:52,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:52,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:52,060 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:13:52,060 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:52,061 INFO L748 eck$LassoCheckResult]: Stem: 2827#[$Ultimate##0]don't care [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 2829#[L73]don't care [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 3105#[L73-1, L24]don't care [109] L73-1-->L36: 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] 3021#[L24, L36, L74]don't care [112] L74-->L49-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] 2691#[L49-1, L24, L75, L36]don't care [2023-10-12 17:13:52,061 INFO L750 eck$LassoCheckResult]: Loop: 2691#[L49-1, L24, L75, L36]don't care [97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 2687#[L24, L49, L75, L36]don't care [99] L49-->L49-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (+ (select v_q1_7 v_q1_front_11) v_total_16) v_total_15) (< v_q1_front_11 v_q1_back_14)) InVars {q1_front=v_q1_front_11, q1=v_q1_7, total=v_total_16, q1_back=v_q1_back_14} OutVars{q1_front=v_q1_front_10, q1=v_q1_7, total=v_total_15, q1_back=v_q1_back_14} AuxVars[] AssignedVars[q1_front, total] 2691#[L49-1, L24, L75, L36]don't care [2023-10-12 17:13:52,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:52,062 INFO L85 PathProgramCache]: Analyzing trace with hash 3441949, now seen corresponding path program 1 times [2023-10-12 17:13:52,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:52,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718893328] [2023-10-12 17:13:52,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:52,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:52,112 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:52,112 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2023-10-12 17:13:52,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:52,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869263317] [2023-10-12 17:13:52,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:52,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:52,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:52,128 INFO L85 PathProgramCache]: Analyzing trace with hash -987251201, now seen corresponding path program 1 times [2023-10-12 17:13:52,128 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:52,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:52,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795145354] [2023-10-12 17:13:52,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:52,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:52,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:52,217 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:52,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:52,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795145354] [2023-10-12 17:13:52,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795145354] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:52,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:13:52,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:13:52,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265707094] [2023-10-12 17:13:52,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:52,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:52,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:13:52,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:13:52,257 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:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:52,311 INFO L93 Difference]: Finished difference Result 839 states and 3757 transitions. [2023-10-12 17:13:52,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 839 states and 3757 transitions. [2023-10-12 17:13:52,322 INFO L131 ngComponentsAnalysis]: Automaton has 80 accepting balls. 186 [2023-10-12 17:13:52,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 839 states to 813 states and 3662 transitions. [2023-10-12 17:13:52,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 325 [2023-10-12 17:13:52,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 325 [2023-10-12 17:13:52,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 813 states and 3662 transitions. [2023-10-12 17:13:52,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:52,334 INFO L219 hiAutomatonCegarLoop]: Abstraction has 813 states and 3662 transitions. [2023-10-12 17:13:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states and 3662 transitions. [2023-10-12 17:13:52,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 743. [2023-10-12 17:13:52,351 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:52,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 3423 transitions. [2023-10-12 17:13:52,356 INFO L241 hiAutomatonCegarLoop]: Abstraction has 743 states and 3423 transitions. [2023-10-12 17:13:52,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:13:52,359 INFO L430 stractBuchiCegarLoop]: Abstraction has 743 states and 3423 transitions. [2023-10-12 17:13:52,359 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:13:52,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 743 states and 3423 transitions. [2023-10-12 17:13:52,365 INFO L131 ngComponentsAnalysis]: Automaton has 69 accepting balls. 164 [2023-10-12 17:13:52,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:52,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:52,366 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:13:52,366 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:52,366 INFO L748 eck$LassoCheckResult]: Stem: 4786#[$Ultimate##0]don't care [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 4788#[L73]don't care [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 5170#[L73-1, L24]don't care [109] L73-1-->L36: 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] 5034#[L24, L36, L74]don't care [112] L74-->L49-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] 5036#[L49-1, L24, L75, L36]don't care [115] L75-->L61-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] 4734#[L24, L36, L76, L49-1, L61-1]don't care [2023-10-12 17:13:52,366 INFO L750 eck$LassoCheckResult]: Loop: 4734#[L24, L36, L76, L49-1, L61-1]don't care [101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 4730#[L61, L24, L36, L76, L49-1]don't care [103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front] 4734#[L24, L36, L76, L49-1, L61-1]don't care [2023-10-12 17:13:52,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:52,367 INFO L85 PathProgramCache]: Analyzing trace with hash 106700534, now seen corresponding path program 1 times [2023-10-12 17:13:52,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:52,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003581043] [2023-10-12 17:13:52,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:52,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:52,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:52,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:52,394 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2023-10-12 17:13:52,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:52,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520813114] [2023-10-12 17:13:52,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:52,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:52,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:52,413 INFO L85 PathProgramCache]: Analyzing trace with hash -539998696, now seen corresponding path program 1 times [2023-10-12 17:13:52,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:52,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938215370] [2023-10-12 17:13:52,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:52,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:52,462 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:52,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:52,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938215370] [2023-10-12 17:13:52,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938215370] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:52,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:13:52,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:13:52,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420536121] [2023-10-12 17:13:52,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:52,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:52,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:13:52,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:13:52,494 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:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:52,535 INFO L93 Difference]: Finished difference Result 1115 states and 4878 transitions. [2023-10-12 17:13:52,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1115 states and 4878 transitions. [2023-10-12 17:13:52,551 INFO L131 ngComponentsAnalysis]: Automaton has 102 accepting balls. 230 [2023-10-12 17:13:52,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1115 states to 1076 states and 4736 transitions. [2023-10-12 17:13:52,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 443 [2023-10-12 17:13:52,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 443 [2023-10-12 17:13:52,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1076 states and 4736 transitions. [2023-10-12 17:13:52,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:52,567 INFO L219 hiAutomatonCegarLoop]: Abstraction has 1076 states and 4736 transitions. [2023-10-12 17:13:52,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states and 4736 transitions. [2023-10-12 17:13:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1014. [2023-10-12 17:13:52,594 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:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 4540 transitions. [2023-10-12 17:13:52,600 INFO L241 hiAutomatonCegarLoop]: Abstraction has 1014 states and 4540 transitions. [2023-10-12 17:13:52,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:13:52,602 INFO L430 stractBuchiCegarLoop]: Abstraction has 1014 states and 4540 transitions. [2023-10-12 17:13:52,602 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:13:52,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1014 states and 4540 transitions. [2023-10-12 17:13:52,611 INFO L131 ngComponentsAnalysis]: Automaton has 93 accepting balls. 212 [2023-10-12 17:13:52,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:52,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:52,612 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:13:52,612 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:52,612 INFO L748 eck$LassoCheckResult]: Stem: 7409#[$Ultimate##0]don't care [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 7411#[L73]don't care [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 7855#[L73-1, L24]don't care [109] L73-1-->L36: 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] 7953#[L24, L36, L74]don't care [112] L74-->L49-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] 8445#[L49-1, L24, L75, L36]don't care [126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back] 8443#[L49-1, L75, L36, L25-1]don't care [2023-10-12 17:13:52,612 INFO L750 eck$LassoCheckResult]: Loop: 8443#[L49-1, L75, L36, L25-1]don't care [97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 8637#[L49, L75, L36, L25-1]don't care [99] L49-->L49-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (+ (select v_q1_7 v_q1_front_11) v_total_16) v_total_15) (< v_q1_front_11 v_q1_back_14)) InVars {q1_front=v_q1_front_11, q1=v_q1_7, total=v_total_16, q1_back=v_q1_back_14} OutVars{q1_front=v_q1_front_10, q1=v_q1_7, total=v_total_15, q1_back=v_q1_back_14} AuxVars[] AssignedVars[q1_front, total] 8443#[L49-1, L75, L36, L25-1]don't care [2023-10-12 17:13:52,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:52,613 INFO L85 PathProgramCache]: Analyzing trace with hash 106700545, now seen corresponding path program 1 times [2023-10-12 17:13:52,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:52,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995015522] [2023-10-12 17:13:52,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:52,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,624 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:52,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:52,624 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 2 times [2023-10-12 17:13:52,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:52,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980163811] [2023-10-12 17:13:52,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:52,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:52,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:52,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:52,635 INFO L85 PathProgramCache]: Analyzing trace with hash -539988253, now seen corresponding path program 1 times [2023-10-12 17:13:52,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:52,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644455327] [2023-10-12 17:13:52,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:52,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:52,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:52,770 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:52,770 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:52,770 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:52,770 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:52,770 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:52,770 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:52,770 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:52,770 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:52,770 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:13:52,770 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:52,770 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:52,772 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:52,776 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:52,779 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:52,781 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:52,783 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:52,804 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:52,807 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:52,809 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:52,812 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:52,814 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:52,816 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:52,925 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:52,925 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:52,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:52,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:52,929 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:52,940 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:52,940 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:52,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:52,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:52,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:52,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:52,950 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:52,951 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:52,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:52,973 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:52,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:52,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:52,974 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:52,986 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:52,986 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:52,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:52,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:52,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:52,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:52,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:52,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:53,010 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:53,017 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:53,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:53,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:53,018 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:53,028 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:53,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:53,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:53,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:53,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:53,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:53,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:53,040 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:53,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:53,056 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:53,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:53,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:53,059 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:53,061 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:53,063 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:53,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:53,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:53,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:53,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:53,072 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:53,072 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:53,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:53,100 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:53,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:53,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:53,102 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:53,104 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:53,106 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:53,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:53,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:53,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:53,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:53,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:53,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:53,142 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:53,150 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:13:53,150 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:13:53,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:53,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:53,153 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:53,164 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:53,172 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:53,180 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:53,181 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:53,181 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2023-10-12 17:13:53,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:13:53,186 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:53,199 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:53,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:53,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:53,223 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:53,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:53,226 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:53,227 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:53,227 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:53,322 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:53,322 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:53,324 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:53,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2023-10-12 17:13:53,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:13:53,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:53,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:13:53,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:53,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:13:53,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:53,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3399 states and 14910 transitions. [2023-10-12 17:13:53,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-10-12 17:13:53,403 INFO L131 ngComponentsAnalysis]: Automaton has 144 accepting balls. 314 [2023-10-12 17:13:53,441 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3399 states to 2922 states and 12779 transitions. [2023-10-12 17:13:53,441 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 885 [2023-10-12 17:13:53,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1051 [2023-10-12 17:13:53,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2922 states and 12779 transitions. [2023-10-12 17:13:53,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:53,445 INFO L219 hiAutomatonCegarLoop]: Abstraction has 2922 states and 12779 transitions. [2023-10-12 17:13:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2922 states and 12779 transitions. [2023-10-12 17:13:53,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2922 to 2242. [2023-10-12 17:13:53,516 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:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 10503 transitions. [2023-10-12 17:13:53,529 INFO L241 hiAutomatonCegarLoop]: Abstraction has 2242 states and 10503 transitions. [2023-10-12 17:13:53,529 INFO L430 stractBuchiCegarLoop]: Abstraction has 2242 states and 10503 transitions. [2023-10-12 17:13:53,529 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:13:53,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2242 states and 10503 transitions. [2023-10-12 17:13:53,547 INFO L131 ngComponentsAnalysis]: Automaton has 105 accepting balls. 236 [2023-10-12 17:13:53,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:53,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:53,548 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:13:53,548 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:53,550 INFO L748 eck$LassoCheckResult]: Stem: 12850#[$Ultimate##0]don't care [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 12852#[L73]don't care [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 13326#[L73-1, L24]don't care [109] L73-1-->L36: 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] 13414#[L24, L36, L74]don't care [112] L74-->L49-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] 13494#[L49-1, L24, L75, L36]don't care [115] L75-->L61-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] 12824#[L24, L36, L76, L49-1, L61-1]don't care [121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back] 12828#[L24, L37-1, L76, L49-1, L61-1]don't care [2023-10-12 17:13:53,551 INFO L750 eck$LassoCheckResult]: Loop: 12828#[L24, L37-1, L76, L49-1, L61-1]don't care [101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 16352#[L61, L24, L37-1, L76, L49-1]don't care [103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front] 12828#[L24, L37-1, L76, L49-1, L61-1]don't care [2023-10-12 17:13:53,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:53,551 INFO L85 PathProgramCache]: Analyzing trace with hash -987250621, now seen corresponding path program 1 times [2023-10-12 17:13:53,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:53,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491906569] [2023-10-12 17:13:53,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:53,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:53,565 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:53,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:53,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:53,575 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 2 times [2023-10-12 17:13:53,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:53,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679238576] [2023-10-12 17:13:53,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:53,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:53,580 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:53,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:53,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:53,588 INFO L85 PathProgramCache]: Analyzing trace with hash 439928869, now seen corresponding path program 1 times [2023-10-12 17:13:53,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:53,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052262731] [2023-10-12 17:13:53,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:53,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:53,601 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:53,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:53,783 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:53,784 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:53,784 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:53,784 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:53,784 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:53,784 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:53,784 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:53,784 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:53,784 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:13:53,784 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:53,784 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:53,786 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:53,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:53,791 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:53,794 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:53,812 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:53,817 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:53,820 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:53,822 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:53,824 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:53,826 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:53,828 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:53,831 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:53,833 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:53,835 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:53,838 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:53,971 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:53,971 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:53,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:53,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:53,973 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:53,975 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:53,977 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:53,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:53,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:53,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:53,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:53,984 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:53,984 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:53,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:54,004 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:54,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:54,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:54,006 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:54,008 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:54,010 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:54,017 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:54,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:54,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:54,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:54,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:54,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:54,028 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:54,031 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:54,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:54,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:54,033 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:54,034 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:54,036 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:54,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:54,042 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:54,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:54,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:54,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:54,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:54,048 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:54,051 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:54,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:54,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:54,052 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:54,053 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:54,055 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:54,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:54,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:54,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:54,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:54,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:54,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:54,072 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:54,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-10-12 17:13:54,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:54,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:54,080 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:54,084 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:54,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:13:54,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:54,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:54,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:54,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:54,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:54,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:54,105 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:54,113 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:13:54,113 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:13:54,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:54,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:54,117 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:54,120 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:54,121 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:54,150 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:54,150 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:54,150 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:54,154 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:54,154 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:13:54,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:54,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:54,177 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:54,189 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:54,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:54,193 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:54,193 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:54,193 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:54,356 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:54,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2023-10-12 17:13:54,360 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:54,361 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:54,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2023-10-12 17:13:54,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:13:54,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:54,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:13:54,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:54,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 6 letters. Loop has 4 letters. [2023-10-12 17:13:54,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:54,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7308 states and 33175 transitions. [2023-10-12 17:13:54,459 INFO L131 ngComponentsAnalysis]: Automaton has 162 accepting balls. 350 [2023-10-12 17:13:54,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7308 states to 6199 states and 28191 transitions. [2023-10-12 17:13:54,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1525 [2023-10-12 17:13:54,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1673 [2023-10-12 17:13:54,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6199 states and 28191 transitions. [2023-10-12 17:13:54,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:54,564 INFO L219 hiAutomatonCegarLoop]: Abstraction has 6199 states and 28191 transitions. [2023-10-12 17:13:54,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6199 states and 28191 transitions. [2023-10-12 17:13:54,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6199 to 5132. [2023-10-12 17:13:54,720 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:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5132 states to 5132 states and 24385 transitions. [2023-10-12 17:13:54,749 INFO L241 hiAutomatonCegarLoop]: Abstraction has 5132 states and 24385 transitions. [2023-10-12 17:13:54,749 INFO L430 stractBuchiCegarLoop]: Abstraction has 5132 states and 24385 transitions. [2023-10-12 17:13:54,749 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:13:54,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5132 states and 24385 transitions. [2023-10-12 17:13:54,829 INFO L131 ngComponentsAnalysis]: Automaton has 127 accepting balls. 280 [2023-10-12 17:13:54,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:54,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:54,830 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2023-10-12 17:13:54,830 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:54,831 INFO L748 eck$LassoCheckResult]: Stem: 24637#[$Ultimate##0]don't care [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 24639#[L73]don't care [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 25157#[L73-1, L24]don't care [109] L73-1-->L36: 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] 25265#[L24, L36, L74]don't care [112] L74-->L49-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] 28991#[L49-1, L24, L75, L36]don't care [126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back] 32747#[L49-1, L75, L36, L25-1]don't care [90] L25-1-->L24: Formula: (= (+ v_i_3 1) v_i_2) InVars {i=v_i_3} OutVars{i=v_i_2} AuxVars[] AssignedVars[i] 32799#[L49-1, L24, L75, L36]don't care [126] L24-->L25-1: Formula: (and (< v_i_20 v_N_24) (= (+ 1 v_q1_back_35) v_q1_back_34) (= v_C_15 (select v_q1_17 v_q1_back_35))) InVars {q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_35, C=v_C_15} OutVars{q1=v_q1_17, N=v_N_24, i=v_i_20, q1_back=v_q1_back_34, C=v_C_15} AuxVars[] AssignedVars[q1_back] 30287#[L49-1, L75, L36, L25-1]don't care [2023-10-12 17:13:54,831 INFO L750 eck$LassoCheckResult]: Loop: 30287#[L49-1, L75, L36, L25-1]don't care [97] L49-1-->L49: Formula: (or (< v_i_6 v_N_6) (< v_q1_front_2 v_q1_back_5)) InVars {q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} OutVars{q1_front=v_q1_front_2, i=v_i_6, N=v_N_6, q1_back=v_q1_back_5} AuxVars[] AssignedVars[] 30811#[L49, L75, L36, L25-1]don't care [99] L49-->L49-1: Formula: (and (= (+ v_q1_front_11 1) v_q1_front_10) (= (+ (select v_q1_7 v_q1_front_11) v_total_16) v_total_15) (< v_q1_front_11 v_q1_back_14)) InVars {q1_front=v_q1_front_11, q1=v_q1_7, total=v_total_16, q1_back=v_q1_back_14} OutVars{q1_front=v_q1_front_10, q1=v_q1_7, total=v_total_15, q1_back=v_q1_back_14} AuxVars[] AssignedVars[q1_front, total] 30287#[L49-1, L75, L36, L25-1]don't care [2023-10-12 17:13:54,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:54,831 INFO L85 PathProgramCache]: Analyzing trace with hash -539988443, now seen corresponding path program 1 times [2023-10-12 17:13:54,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:54,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465191883] [2023-10-12 17:13:54,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:54,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:54,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:54,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:54,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:54,841 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 3 times [2023-10-12 17:13:54,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:54,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493607118] [2023-10-12 17:13:54,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:54,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:54,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:54,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:54,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:54,846 INFO L85 PathProgramCache]: Analyzing trace with hash 762152199, now seen corresponding path program 1 times [2023-10-12 17:13:54,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:54,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279534475] [2023-10-12 17:13:54,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:54,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:54,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:54,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:55,023 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:55,023 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:55,024 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:55,024 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:55,024 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:55,024 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,024 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:55,024 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:55,024 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:13:55,024 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:55,024 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:55,026 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:55,029 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:55,031 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:55,033 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:55,035 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:55,059 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:55,061 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:55,063 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:55,067 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:55,069 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:55,071 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:55,187 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:55,188 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:55,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:55,189 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:55,198 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:55,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:55,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:55,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:55,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:55,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:55,209 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:55,212 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:55,212 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:55,216 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:55,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:55,218 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:55,225 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:55,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:55,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:55,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:55,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:55,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:55,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:55,239 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:55,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:55,255 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:55,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:55,256 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:55,260 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:55,260 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:55,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:55,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:55,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:55,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:55,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:55,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:55,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:55,287 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:55,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:55,288 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:55,289 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:55,292 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:55,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:55,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:55,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:55,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:55,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:55,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:55,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:55,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2023-10-12 17:13:55,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:55,306 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:55,307 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:55,309 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:55,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:55,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:55,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:55,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:55,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:55,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:55,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:55,344 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:55,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:55,345 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:55,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:55,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:55,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:55,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:55,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:55,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:55,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:55,365 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:55,376 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:55,382 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:13:55,382 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:13:55,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:55,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:55,385 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:55,409 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:55,409 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:55,419 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:55,419 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:55,419 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q1_back, q1_front) = 1*q1_back - 1*q1_front Supporting invariants [] [2023-10-12 17:13:55,426 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:55,430 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:13:55,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:55,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:55,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:55,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:55,466 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:55,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:55,469 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:55,469 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:55,469 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:55,671 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:55,671 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:55,673 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:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2023-10-12 17:13:55,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:13:55,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:55,673 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:13:55,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:55,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:55,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:55,704 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:55,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:55,707 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:55,708 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:55,708 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:55,835 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:55,835 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:55,836 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:55,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2023-10-12 17:13:55,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 51 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:13:55,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:55,836 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:13:55,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:55,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:55,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:55,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:55,868 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:55,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:55,870 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:55,871 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:55,871 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:55,978 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:56,055 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:56,055 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:56,056 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:56,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2023-10-12 17:13:56,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:13:56,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:56,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:13:56,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:56,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 54 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:13:56,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:56,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12729 states and 57795 transitions. [2023-10-12 17:13:56,187 INFO L131 ngComponentsAnalysis]: Automaton has 97 accepting balls. 194 [2023-10-12 17:13:56,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12729 states to 6975 states and 31135 transitions. [2023-10-12 17:13:56,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1459 [2023-10-12 17:13:56,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1699 [2023-10-12 17:13:56,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6975 states and 31135 transitions. [2023-10-12 17:13:56,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:13:56,277 INFO L219 hiAutomatonCegarLoop]: Abstraction has 6975 states and 31135 transitions. [2023-10-12 17:13:56,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6975 states and 31135 transitions. [2023-10-12 17:13:56,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6975 to 2925. [2023-10-12 17:13:56,400 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:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2925 states to 2925 states and 13315 transitions. [2023-10-12 17:13:56,413 INFO L241 hiAutomatonCegarLoop]: Abstraction has 2925 states and 13315 transitions. [2023-10-12 17:13:56,413 INFO L430 stractBuchiCegarLoop]: Abstraction has 2925 states and 13315 transitions. [2023-10-12 17:13:56,413 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:13:56,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2925 states and 13315 transitions. [2023-10-12 17:13:56,430 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 80 [2023-10-12 17:13:56,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:56,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:56,431 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-10-12 17:13:56,431 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:13:56,431 INFO L748 eck$LassoCheckResult]: Stem: 68068#[$Ultimate##0]don't care [81] $Ultimate##0-->L73: Formula: (and (= v_i_5 0) (= v_q2_front_1 v_q2_back_4) (= v_q1_back_4 v_q1_front_1) (<= 0 v_N_5) (= v_total_1 0) (= v_j_5 0)) InVars {q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} OutVars{q1_front=v_q1_front_1, N=v_N_5, q2_back=v_q2_back_4, j=v_j_5, i=v_i_5, total=v_total_1, q1_back=v_q1_back_4, q2_front=v_q2_front_1} AuxVars[] AssignedVars[] 68070#[L73]don't care [106] L73-->L24: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 68510#[L73-1, L24]don't care [109] L73-1-->L36: 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] 68580#[L24, L36, L74]don't care [112] L74-->L49-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] 73642#[L49-1, L24, L75, L36]don't care [115] L75-->L61-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] 73646#[L24, L36, L76, L49-1, L61-1]don't care [121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back] 73614#[L24, L37-1, L76, L49-1, L61-1]don't care [95] L37-1-->L36: Formula: (= v_j_3 (+ v_j_4 1)) InVars {j=v_j_4} OutVars{j=v_j_3} AuxVars[] AssignedVars[j] 72164#[L24, L36, L76, L49-1, L61-1]don't care [121] L36-->L37-1: Formula: (and (< v_j_10 v_N_12) (= (+ v_C_7 (select v_q2_9 v_q2_back_15)) 0) (= v_q2_back_14 (+ v_q2_back_15 1))) InVars {q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_15, j=v_j_10, C=v_C_7} OutVars{q2=v_q2_9, N=v_N_12, q2_back=v_q2_back_14, j=v_j_10, C=v_C_7} AuxVars[] AssignedVars[q2_back] 70066#[L24, L37-1, L76, L49-1, L61-1]don't care [2023-10-12 17:13:56,432 INFO L750 eck$LassoCheckResult]: Loop: 70066#[L24, L37-1, L76, L49-1, L61-1]don't care [101] L61-1-->L61: Formula: (or (< v_q2_front_2 v_q2_back_5) (< v_j_6 v_N_8)) InVars {N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} OutVars{N=v_N_8, q2_front=v_q2_front_2, j=v_j_6, q2_back=v_q2_back_5} AuxVars[] AssignedVars[] 70062#[L61, L24, L37-1, L76, L49-1]don't care [103] L61-->L61-1: Formula: (and (= (+ v_q2_front_13 1) v_q2_front_12) (= (+ (select v_q2_7 v_q2_front_13) v_total_20) v_total_19) (< v_q2_front_13 v_q2_back_12)) InVars {q2=v_q2_7, total=v_total_20, q2_front=v_q2_front_13, q2_back=v_q2_back_12} OutVars{q2=v_q2_7, total=v_total_19, q2_front=v_q2_front_12, q2_back=v_q2_back_12} AuxVars[] AssignedVars[total, q2_front] 70066#[L24, L37-1, L76, L49-1, L61-1]don't care [2023-10-12 17:13:56,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:56,432 INFO L85 PathProgramCache]: Analyzing trace with hash 439928701, now seen corresponding path program 1 times [2023-10-12 17:13:56,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:56,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900553845] [2023-10-12 17:13:56,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:56,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:56,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:56,442 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 3 times [2023-10-12 17:13:56,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:56,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297831607] [2023-10-12 17:13:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:56,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:56,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:56,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1864689887, now seen corresponding path program 1 times [2023-10-12 17:13:56,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:56,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120016262] [2023-10-12 17:13:56,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:56,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,452 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:56,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:56,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:56,667 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:13:56,668 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:13:56,668 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:13:56,668 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:13:56,668 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:13:56,668 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:56,668 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:13:56,668 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:13:56,668 INFO L133 ssoRankerPreferences]: Filename of dumped script: buffer-mult.wvr.bpl_BEv2_Iteration8_Lasso [2023-10-12 17:13:56,668 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:13:56,668 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:13:56,669 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:56,672 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:56,705 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:56,707 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:56,709 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:56,712 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:56,714 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:56,716 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:56,718 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:56,721 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:56,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:56,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:56,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:56,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:56,735 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:56,880 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:13:56,880 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:13:56,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:56,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:56,881 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:56,890 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:56,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:56,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:56,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:56,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:56,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:56,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:56,902 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:56,910 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:13:56,916 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:56,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:56,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:56,917 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:56,925 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:56,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:13:56,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:13:56,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:13:56,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:13:56,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:13:56,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:13:56,941 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:56,948 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:13:56,963 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:13:56,964 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:13:56,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:56,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:56,965 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:56,968 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:56,968 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:13:56,994 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:13:56,994 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:13:56,994 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:56,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2023-10-12 17:13:56,999 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:13:57,013 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:57,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:57,025 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:57,041 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:57,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:57,043 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:57,043 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:57,044 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:57,109 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:57,109 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:57,110 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:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2023-10-12 17:13:57,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:13:57,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:57,110 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:13:57,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:57,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:57,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:57,139 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:57,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:57,141 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:57,141 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:57,141 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:57,205 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:57,205 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:57,205 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:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2023-10-12 17:13:57,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:13:57,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:57,206 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:13:57,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:57,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:57,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:13:57,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:57,236 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:13:57,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:13:57,238 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:57,239 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:57,239 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:57,331 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:57,331 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:57,332 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:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2023-10-12 17:13:57,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 50 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:13:57,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:57,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 50 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:13:57,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:57,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 50 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:13:57,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:13:57,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7643 states and 32936 transitions. [2023-10-12 17:13:57,414 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:13:57,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7643 states to 0 states and 0 transitions. [2023-10-12 17:13:57,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:13:57,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:13:57,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:13:57,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:13:57,414 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:57,415 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:57,415 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:13:57,415 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:13:57,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:13:57,415 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:13:57,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:13:57,420 INFO L201 PluginConnector]: Adding new model buffer-mult.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:13:57 BoogieIcfgContainer [2023-10-12 17:13:57,420 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:13:57,421 INFO L158 Benchmark]: Toolchain (without parser) took 8339.65ms. Allocated memory was 185.6MB in the beginning and 358.6MB in the end (delta: 173.0MB). Free memory was 141.4MB in the beginning and 107.5MB in the end (delta: 33.9MB). Peak memory consumption was 208.9MB. Max. memory is 8.0GB. [2023-10-12 17:13:57,421 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 185.6MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:13:57,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.25ms. Allocated memory is still 185.6MB. Free memory was 141.4MB in the beginning and 139.7MB in the end (delta: 1.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-10-12 17:13:57,421 INFO L158 Benchmark]: Boogie Preprocessor took 32.13ms. Allocated memory is still 185.6MB. Free memory was 139.7MB in the beginning and 138.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:13:57,421 INFO L158 Benchmark]: RCFGBuilder took 266.63ms. Allocated memory is still 185.6MB. Free memory was 138.7MB in the beginning and 127.5MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-10-12 17:13:57,422 INFO L158 Benchmark]: BuchiAutomizer took 8001.27ms. Allocated memory was 185.6MB in the beginning and 358.6MB in the end (delta: 173.0MB). Free memory was 127.3MB in the beginning and 107.5MB in the end (delta: 19.8MB). Peak memory consumption was 193.2MB. Max. memory is 8.0GB. [2023-10-12 17:13:57,423 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.27ms. Allocated memory is still 185.6MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.25ms. Allocated memory is still 185.6MB. Free memory was 141.4MB in the beginning and 139.7MB in the end (delta: 1.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.13ms. Allocated memory is still 185.6MB. Free memory was 139.7MB in the beginning and 138.7MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 266.63ms. Allocated memory is still 185.6MB. Free memory was 138.7MB in the beginning and 127.5MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 8001.27ms. Allocated memory was 185.6MB in the beginning and 358.6MB in the end (delta: 173.0MB). Free memory was 127.3MB in the beginning and 107.5MB in the end (delta: 19.8MB). Peak memory consumption was 193.2MB. 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 N + -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.8s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 4.1s. Construction of modules took 0.3s. Büchi inclusion checks took 1.6s. 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.7s 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.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 332 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 500 IncrementalHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 73 mSDtfsCounter, 500 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf100 lsp45 ukn95 mio100 lsp69 div100 bol100 ite100 ukn100 eq193 hnf91 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 50ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s - 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.2s, 40 PlacesBefore, 32 PlacesAfterwards, 31 TransitionsBefore, 23 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 2 FixpointIterations, 3 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 505 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 388, independent: 366, independent conditional: 0, independent unconditional: 366, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 219, independent: 211, independent conditional: 0, independent unconditional: 211, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 219, independent: 201, independent conditional: 0, independent unconditional: 201, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 65, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 388, independent: 155, independent conditional: 0, independent unconditional: 155, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 219, unknown conditional: 0, unknown unconditional: 219] , 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:57,439 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:57,637 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...