/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/queue-add-2-nl.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:14:09,395 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:14:09,472 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:14:09,500 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:14:09,501 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:14:09,502 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:14:09,503 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:14:09,503 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:14:09,504 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:14:09,507 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:14:09,508 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:14:09,508 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:14:09,508 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:14:09,509 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:14:09,509 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:14:09,510 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:14:09,510 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:14:09,510 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:14:09,510 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:14:09,510 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:14:09,511 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:14:09,511 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:14:09,511 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:14:09,512 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:14:09,513 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:14:09,513 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:14:09,513 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:14:09,513 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:14:09,513 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:14:09,514 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:14:09,514 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:14:09,515 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:14:09,515 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:14:09,516 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:14:09,516 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:14:09,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:14:09,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:14:09,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:14:09,794 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:14:09,795 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:14:09,796 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/queue-add-2-nl.wvr.bpl [2023-10-12 17:14:09,796 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/queue-add-2-nl.wvr.bpl' [2023-10-12 17:14:09,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:14:09,825 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:14:09,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:09,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:14:09,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:14:09,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:09" (1/1) ... [2023-10-12 17:14:09,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:09" (1/1) ... [2023-10-12 17:14:09,850 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:14:09,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:09,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:14:09,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:14:09,852 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:14:09,859 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:09" (1/1) ... [2023-10-12 17:14:09,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:09" (1/1) ... [2023-10-12 17:14:09,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:09" (1/1) ... [2023-10-12 17:14:09,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:09" (1/1) ... [2023-10-12 17:14:09,866 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:09" (1/1) ... [2023-10-12 17:14:09,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:09" (1/1) ... [2023-10-12 17:14:09,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:09" (1/1) ... [2023-10-12 17:14:09,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:09" (1/1) ... [2023-10-12 17:14:09,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:14:09,875 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:14:09,875 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:14:09,875 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:14:09,876 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:09" (1/1) ... [2023-10-12 17:14:09,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:09,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:09,916 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:14:09,920 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:14:09,948 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:14:09,948 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:14:09,948 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:14:09,948 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:14:09,948 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:14:09,948 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:14:09,948 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:14:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:14:09,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:14:09,950 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:14:09,996 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:14:09,998 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:14:10,129 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:14:10,145 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:14:10,145 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:14:10,147 INFO L201 PluginConnector]: Adding new model queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:10 BoogieIcfgContainer [2023-10-12 17:14:10,147 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:14:10,148 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:14:10,148 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:14:10,156 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:14:10,156 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:10,157 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:09" (1/2) ... [2023-10-12 17:14:10,158 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44229946 and model type queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:14:10, skipping insertion in model container [2023-10-12 17:14:10,158 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:10,159 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:10" (2/2) ... [2023-10-12 17:14:10,160 INFO L332 chiAutomizerObserver]: Analyzing ICFG queue-add-2-nl.wvr.bpl [2023-10-12 17:14:10,226 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:14:10,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 31 transitions, 78 flow [2023-10-12 17:14:10,277 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-10-12 17:14:10,277 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:14:10,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 2/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:14:10,281 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 31 transitions, 78 flow [2023-10-12 17:14:10,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 27 transitions, 66 flow [2023-10-12 17:14:10,287 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:14:10,299 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 27 transitions, 66 flow [2023-10-12 17:14:10,301 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 27 transitions, 66 flow [2023-10-12 17:14:10,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 66 flow [2023-10-12 17:14:10,309 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-10-12 17:14:10,309 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:14:10,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 2/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2023-10-12 17:14:10,311 INFO L119 LiptonReduction]: Number of co-enabled transitions 198 [2023-10-12 17:14:10,812 INFO L134 LiptonReduction]: Checked pairs total: 172 [2023-10-12 17:14:10,813 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-10-12 17:14:10,836 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:14:10,837 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:14:10,837 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:14:10,837 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:14:10,837 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:14:10,837 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:14:10,837 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:14:10,838 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:14:10,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:14:10,860 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2023-10-12 17:14:10,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:10,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:10,864 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:10,864 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:10,864 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:14:10,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 19 states, but on-demand construction may add more states [2023-10-12 17:14:10,866 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 7 [2023-10-12 17:14:10,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:10,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:10,866 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:10,867 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:10,870 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]don't care [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 40#[L61]don't care [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 42#[$Ultimate##0, L61-1]don't care [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 44#[L61-1, L25-1]don't care [2023-10-12 17:14:10,871 INFO L750 eck$LassoCheckResult]: Loop: 44#[L61-1, L25-1]don't care [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 44#[L61-1, L25-1]don't care [2023-10-12 17:14:10,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:10,878 INFO L85 PathProgramCache]: Analyzing trace with hash 98092, now seen corresponding path program 1 times [2023-10-12 17:14:10,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:10,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45730594] [2023-10-12 17:14:10,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:10,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:10,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:10,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:10,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:10,993 INFO L85 PathProgramCache]: Analyzing trace with hash 140, now seen corresponding path program 1 times [2023-10-12 17:14:10,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:10,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674698185] [2023-10-12 17:14:10,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:10,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,008 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:11,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:11,022 INFO L85 PathProgramCache]: Analyzing trace with hash 3040961, now seen corresponding path program 1 times [2023-10-12 17:14:11,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:11,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522122362] [2023-10-12 17:14:11,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:11,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:11,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:11,158 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:11,159 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:11,159 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:11,159 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:11,159 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:11,159 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:11,159 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:11,159 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:11,160 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:14:11,160 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:11,160 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:11,174 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:14:11,187 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:14:11,191 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:14:11,201 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:14:11,215 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:14:11,299 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:11,302 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:11,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:11,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:11,311 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:14:11,312 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:14:11,314 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:14:11,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:11,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:11,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:11,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:11,330 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:11,330 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:11,349 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:11,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:14:11,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:11,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:11,356 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:14:11,361 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:14:11,375 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:14:11,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:11,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:11,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:11,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:11,387 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:11,387 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:11,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:11,411 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:14:11,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:11,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:11,413 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:14:11,417 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:14:11,418 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:14:11,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:11,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:11,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:11,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:11,436 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:11,436 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:11,457 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:11,480 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:14:11,480 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:14:11,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:11,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:11,485 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:14:11,486 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:14:11,523 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:11,540 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:11,541 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:11,541 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:14:11,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:11,551 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:11,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:11,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:11,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:11,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:11,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:11,609 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:14:11,637 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:14:11,639 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 19 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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:14:11,687 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 19 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 44 states and 100 transitions. Complement of second has 5 states. [2023-10-12 17:14:11,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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:14:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2023-10-12 17:14:11,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:14:11,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:11,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:14:11,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:11,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:14:11,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:11,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 100 transitions. [2023-10-12 17:14:11,701 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:14:11,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 23 states and 53 transitions. [2023-10-12 17:14:11,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2023-10-12 17:14:11,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-10-12 17:14:11,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 53 transitions. [2023-10-12 17:14:11,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:11,707 INFO L219 hiAutomatonCegarLoop]: Abstraction has 23 states and 53 transitions. [2023-10-12 17:14:11,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 53 transitions. [2023-10-12 17:14:11,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-10-12 17:14:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.35) internal successors, (47), 19 states have internal predecessors, (47), 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:14:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 47 transitions. [2023-10-12 17:14:11,729 INFO L241 hiAutomatonCegarLoop]: Abstraction has 20 states and 47 transitions. [2023-10-12 17:14:11,729 INFO L430 stractBuchiCegarLoop]: Abstraction has 20 states and 47 transitions. [2023-10-12 17:14:11,729 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:14:11,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 47 transitions. [2023-10-12 17:14:11,731 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 4 [2023-10-12 17:14:11,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:11,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:11,731 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:14:11,731 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:11,732 INFO L748 eck$LassoCheckResult]: Stem: 189#[$Ultimate##0]don't care [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 165#[L61]don't care [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 167#[$Ultimate##0, L61-1]don't care [90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 159#[L62, $Ultimate##0, $Ultimate##0]don't care [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 161#[L62, L45-1, $Ultimate##0]don't care [2023-10-12 17:14:11,732 INFO L750 eck$LassoCheckResult]: Loop: 161#[L62, L45-1, $Ultimate##0]don't care [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 161#[L62, L45-1, $Ultimate##0]don't care [2023-10-12 17:14:11,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:11,733 INFO L85 PathProgramCache]: Analyzing trace with hash 3041574, now seen corresponding path program 1 times [2023-10-12 17:14:11,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:11,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986659790] [2023-10-12 17:14:11,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:11,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,738 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:11,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:11,743 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 1 times [2023-10-12 17:14:11,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:11,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101536152] [2023-10-12 17:14:11,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:11,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:11,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:11,754 INFO L85 PathProgramCache]: Analyzing trace with hash 94288904, now seen corresponding path program 1 times [2023-10-12 17:14:11,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:11,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612584975] [2023-10-12 17:14:11,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:11,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:11,800 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:14:11,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:11,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612584975] [2023-10-12 17:14:11,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612584975] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:11,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:11,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:14:11,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078195871] [2023-10-12 17:14:11,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:11,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:11,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:14:11,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:14:11,891 INFO L87 Difference]: Start difference. First operand 20 states and 47 transitions. cyclomatic complexity: 34 Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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:14:11,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:11,908 INFO L93 Difference]: Finished difference Result 24 states and 50 transitions. [2023-10-12 17:14:11,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 50 transitions. [2023-10-12 17:14:11,913 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2023-10-12 17:14:11,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 50 transitions. [2023-10-12 17:14:11,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-10-12 17:14:11,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2023-10-12 17:14:11,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 50 transitions. [2023-10-12 17:14:11,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:11,917 INFO L219 hiAutomatonCegarLoop]: Abstraction has 24 states and 50 transitions. [2023-10-12 17:14:11,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 50 transitions. [2023-10-12 17:14:11,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-10-12 17:14:11,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 23 states have internal predecessors, (50), 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:14:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. [2023-10-12 17:14:11,922 INFO L241 hiAutomatonCegarLoop]: Abstraction has 24 states and 50 transitions. [2023-10-12 17:14:11,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:14:11,924 INFO L430 stractBuchiCegarLoop]: Abstraction has 24 states and 50 transitions. [2023-10-12 17:14:11,924 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:14:11,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 50 transitions. [2023-10-12 17:14:11,926 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2023-10-12 17:14:11,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:11,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:11,927 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:14:11,927 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:11,927 INFO L748 eck$LassoCheckResult]: Stem: 265#[$Ultimate##0]don't care [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 237#[L61]don't care [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 239#[$Ultimate##0, L61-1]don't care [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 241#[L61-1, L25-1]don't care [90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 253#[L62, $Ultimate##0, L25-1]don't care [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 271#[L62, $Ultimate##0, L25-1]don't care [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 267#[L62, L45-1, L25-1]don't care [2023-10-12 17:14:11,928 INFO L750 eck$LassoCheckResult]: Loop: 267#[L62, L45-1, L25-1]don't care [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 267#[L62, L45-1, L25-1]don't care [2023-10-12 17:14:11,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:11,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1372618553, now seen corresponding path program 1 times [2023-10-12 17:14:11,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:11,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771166574] [2023-10-12 17:14:11,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:11,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:11,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:11,954 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 2 times [2023-10-12 17:14:11,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:11,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739885803] [2023-10-12 17:14:11,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:11,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,959 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:11,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:11,964 INFO L85 PathProgramCache]: Analyzing trace with hash 398497927, now seen corresponding path program 1 times [2023-10-12 17:14:11,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:11,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307524822] [2023-10-12 17:14:11,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:11,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:11,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:12,213 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:12,213 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:12,213 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:12,213 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:12,213 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:12,214 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:12,214 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:12,214 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:12,215 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:14:12,215 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:12,217 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:12,222 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:14:12,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:14:12,231 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:14:12,234 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:14:12,237 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:14:12,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:14:12,246 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:14:12,301 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:14:12,531 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:12,531 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:12,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:12,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:12,533 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:14:12,542 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:14:12,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:12,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:12,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:12,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:12,554 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:12,554 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:12,558 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:14:12,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:12,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:14:12,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:12,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:12,563 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:14:12,568 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:14:12,573 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:14:12,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:12,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:12,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:12,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:12,584 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:12,585 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:12,597 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:12,605 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:14:12,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:12,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:12,609 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:14:12,613 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:14:12,614 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:14:12,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:12,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:12,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:12,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:12,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:12,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:12,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:12,654 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:14:12,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:12,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:12,656 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:14:12,662 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:14:12,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:12,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:12,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:12,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:12,671 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:14:12,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:12,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:12,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:12,688 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:14:12,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:12,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:12,689 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:14:12,691 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:14:12,693 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:14:12,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:12,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:12,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:12,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:12,702 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:12,702 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:12,714 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:12,719 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:14:12,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:12,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:12,721 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:14:12,723 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:14:12,724 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:14:12,730 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:12,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:12,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:12,731 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:12,733 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:12,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:12,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:12,758 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:14:12,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:12,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:12,760 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:14:12,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:12,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:12,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:12,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:12,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:12,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:12,778 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:12,783 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:14:12,800 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:12,811 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:14:12,811 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:14:12,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:12,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:12,813 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:14:12,824 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:14:12,824 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:12,839 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:12,839 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:12,839 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_front, q_back) = -1*q_front + 1*q_back Supporting invariants [] [2023-10-12 17:14:12,846 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:14:12,847 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:12,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:12,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:12,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:12,889 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:12,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:12,890 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:14:12,890 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:14:12,891 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 50 transitions. cyclomatic complexity: 32 Second operand has 2 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:14:12,912 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 50 transitions. cyclomatic complexity: 32. Second operand has 2 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) Result 35 states and 68 transitions. Complement of second has 5 states. [2023-10-12 17:14:12,912 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:14:12,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 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:14:12,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2023-10-12 17:14:12,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:14:12,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:12,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:14:12,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:12,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:14:12,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:12,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 68 transitions. [2023-10-12 17:14:12,917 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2023-10-12 17:14:12,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 25 states and 48 transitions. [2023-10-12 17:14:12,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-10-12 17:14:12,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2023-10-12 17:14:12,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 48 transitions. [2023-10-12 17:14:12,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:12,918 INFO L219 hiAutomatonCegarLoop]: Abstraction has 25 states and 48 transitions. [2023-10-12 17:14:12,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 48 transitions. [2023-10-12 17:14:12,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-10-12 17:14:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 22 states have internal predecessors, (44), 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:14:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 44 transitions. [2023-10-12 17:14:12,920 INFO L241 hiAutomatonCegarLoop]: Abstraction has 23 states and 44 transitions. [2023-10-12 17:14:12,920 INFO L430 stractBuchiCegarLoop]: Abstraction has 23 states and 44 transitions. [2023-10-12 17:14:12,921 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:14:12,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 44 transitions. [2023-10-12 17:14:12,921 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2023-10-12 17:14:12,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:12,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:12,922 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:14:12,922 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:12,922 INFO L748 eck$LassoCheckResult]: Stem: 376#[$Ultimate##0]don't care [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 372#[L61]don't care [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 374#[$Ultimate##0, L61-1]don't care [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 360#[L61-1, L25-1]don't care [90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 364#[L62, $Ultimate##0, L25-1]don't care [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 378#[L62, L45-1, L25-1]don't care [108] L25-1-->thread1EXIT: Formula: (and (= v_x_23 (+ v_C_12 v_x_24)) (= (select v_q_30 v_q_back_52) 0) (= v_q_back_51 (+ v_q_back_52 1)) (<= v_N_15 v_i_12)) InVars {q=v_q_30, q_back=v_q_back_52, N=v_N_15, i=v_i_12, x=v_x_24, C=v_C_12} OutVars{q=v_q_30, q_back=v_q_back_51, N=v_N_15, i=v_i_12, x=v_x_23, C=v_C_12} AuxVars[] AssignedVars[q_back, x] 352#[L62, thread1EXIT, L45-1]don't care [2023-10-12 17:14:12,922 INFO L750 eck$LassoCheckResult]: Loop: 352#[L62, thread1EXIT, L45-1]don't care [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 352#[L62, thread1EXIT, L45-1]don't care [2023-10-12 17:14:12,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:12,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1372618764, now seen corresponding path program 1 times [2023-10-12 17:14:12,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:12,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47194499] [2023-10-12 17:14:12,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:12,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:12,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:12,933 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 3 times [2023-10-12 17:14:12,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:12,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227409211] [2023-10-12 17:14:12,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:12,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,937 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:12,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:12,940 INFO L85 PathProgramCache]: Analyzing trace with hash 398491386, now seen corresponding path program 1 times [2023-10-12 17:14:12,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:12,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62491944] [2023-10-12 17:14:12,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:12,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:12,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:13,090 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:13,090 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:13,090 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:13,091 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:13,091 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:13,091 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:13,091 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:13,091 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:13,091 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:14:13,091 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:13,091 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:13,093 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:14:13,095 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:14:13,097 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:14:13,103 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:14:13,107 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:14:13,111 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:14:13,139 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:14:13,348 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:13,349 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:13,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:13,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:13,350 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:14:13,361 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:14:13,363 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:14:13,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:13,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:13,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:13,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:13,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:13,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:13,375 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:13,378 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:14:13,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:13,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:13,379 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:14:13,380 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:14:13,382 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:14:13,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:13,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:13,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:13,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:13,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:13,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:13,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:13,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:13,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:13,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:13,411 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:14:13,411 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:14:13,414 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:14:13,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:13,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:13,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:13,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:13,424 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:13,424 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:13,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:13,433 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:14:13,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:13,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:13,434 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:14:13,437 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:14:13,440 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:14:13,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:13,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:13,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:13,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:13,448 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:13,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:13,475 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:13,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-10-12 17:14:13,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:13,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:13,483 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:14:13,485 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:14:13,490 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:14:13,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:13,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:13,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:13,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:13,499 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:13,499 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:13,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:13,521 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:14:13,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:13,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:13,523 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:14:13,529 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:14:13,544 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:14:13,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:13,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:13,552 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:14:13,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:13,578 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:14:13,578 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:14:13,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:13,623 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:14:13,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:13,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:13,625 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:14:13,639 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:14:13,642 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:14:13,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:13,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:13,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:13,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:13,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:13,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:13,666 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:13,675 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:14:13,675 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:14:13,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:13,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:13,679 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:14:13,688 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:13,696 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:14:13,710 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:13,710 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:13,710 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2023-10-12 17:14:13,716 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:14:13,717 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:13,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:13,739 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:13,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:13,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:13,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:13,764 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:14:13,765 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:14:13,765 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 44 transitions. cyclomatic complexity: 28 Second operand has 2 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:14:13,778 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 44 transitions. cyclomatic complexity: 28. Second operand has 2 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) Result 26 states and 49 transitions. Complement of second has 4 states. [2023-10-12 17:14:13,778 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:14:13,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 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:14:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2023-10-12 17:14:13,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:14:13,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:13,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:14:13,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:13,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:14:13,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:13,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 49 transitions. [2023-10-12 17:14:13,781 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:14:13,781 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 16 states and 27 transitions. [2023-10-12 17:14:13,781 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-10-12 17:14:13,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-10-12 17:14:13,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 27 transitions. [2023-10-12 17:14:13,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:13,782 INFO L219 hiAutomatonCegarLoop]: Abstraction has 16 states and 27 transitions. [2023-10-12 17:14:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 27 transitions. [2023-10-12 17:14:13,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2023-10-12 17:14:13,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 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:14:13,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 24 transitions. [2023-10-12 17:14:13,784 INFO L241 hiAutomatonCegarLoop]: Abstraction has 14 states and 24 transitions. [2023-10-12 17:14:13,784 INFO L430 stractBuchiCegarLoop]: Abstraction has 14 states and 24 transitions. [2023-10-12 17:14:13,784 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:14:13,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 24 transitions. [2023-10-12 17:14:13,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:14:13,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:13,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:13,784 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:13,785 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:13,785 INFO L748 eck$LassoCheckResult]: Stem: 479#[$Ultimate##0]don't care [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 475#[L61]don't care [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 477#[$Ultimate##0, L61-1]don't care [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 467#[L61-1, L25-1]don't care [90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 469#[L62, $Ultimate##0, L25-1]don't care [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 461#[L62, L45-1, L25-1]don't care [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 483#[L62, L45-1, L25-1]don't care [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 481#[L62, L45-1, L25-1]don't care [2023-10-12 17:14:13,785 INFO L750 eck$LassoCheckResult]: Loop: 481#[L62, L45-1, L25-1]don't care [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 481#[L62, L45-1, L25-1]don't care [2023-10-12 17:14:13,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:13,785 INFO L85 PathProgramCache]: Analyzing trace with hash 398491417, now seen corresponding path program 2 times [2023-10-12 17:14:13,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:13,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939011657] [2023-10-12 17:14:13,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:13,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:13,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:13,801 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 4 times [2023-10-12 17:14:13,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:13,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55789869] [2023-10-12 17:14:13,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:13,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,808 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:13,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:13,808 INFO L85 PathProgramCache]: Analyzing trace with hash -531667851, now seen corresponding path program 3 times [2023-10-12 17:14:13,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:13,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206263757] [2023-10-12 17:14:13,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:13,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:13,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:13,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:13,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206263757] [2023-10-12 17:14:13,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206263757] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:13,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:13,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-10-12 17:14:13,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140971898] [2023-10-12 17:14:13,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:13,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:13,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-10-12 17:14:13,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:14:13,909 INFO L87 Difference]: Start difference. First operand 14 states and 24 transitions. cyclomatic complexity: 14 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 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:14:13,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:13,928 INFO L93 Difference]: Finished difference Result 20 states and 34 transitions. [2023-10-12 17:14:13,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 34 transitions. [2023-10-12 17:14:13,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:14:13,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 33 transitions. [2023-10-12 17:14:13,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-10-12 17:14:13,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-10-12 17:14:13,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 33 transitions. [2023-10-12 17:14:13,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:13,929 INFO L219 hiAutomatonCegarLoop]: Abstraction has 19 states and 33 transitions. [2023-10-12 17:14:13,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 33 transitions. [2023-10-12 17:14:13,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-10-12 17:14:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 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:14:13,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2023-10-12 17:14:13,933 INFO L241 hiAutomatonCegarLoop]: Abstraction has 17 states and 30 transitions. [2023-10-12 17:14:13,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:14:13,934 INFO L430 stractBuchiCegarLoop]: Abstraction has 17 states and 30 transitions. [2023-10-12 17:14:13,934 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:14:13,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 30 transitions. [2023-10-12 17:14:13,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:14:13,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:13,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:13,935 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:13,936 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:13,936 INFO L748 eck$LassoCheckResult]: Stem: 539#[$Ultimate##0]don't care [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 535#[L61]don't care [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 537#[$Ultimate##0, L61-1]don't care [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 525#[L61-1, L25-1]don't care [90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 527#[L62, $Ultimate##0, L25-1]don't care [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 519#[L62, L45-1, L25-1]don't care [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 543#[L62, L45-1, L25-1]don't care [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 547#[L62, L45-1, L25-1]don't care [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 541#[L62, L45-1, L25-1]don't care [2023-10-12 17:14:13,936 INFO L750 eck$LassoCheckResult]: Loop: 541#[L62, L45-1, L25-1]don't care [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 541#[L62, L45-1, L25-1]don't care [2023-10-12 17:14:13,937 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:13,937 INFO L85 PathProgramCache]: Analyzing trace with hash -531667882, now seen corresponding path program 4 times [2023-10-12 17:14:13,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:13,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114449107] [2023-10-12 17:14:13,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:13,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,951 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:13,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:13,960 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 5 times [2023-10-12 17:14:13,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:13,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043721177] [2023-10-12 17:14:13,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:13,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,973 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:13,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:13,976 INFO L85 PathProgramCache]: Analyzing trace with hash 698164952, now seen corresponding path program 5 times [2023-10-12 17:14:13,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:13,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007921815] [2023-10-12 17:14:13,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:13,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:13,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:14,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:14,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:14,080 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:14:14,304 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:14,304 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:14,304 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:14,304 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:14,304 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:14,304 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:14,304 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:14,305 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:14,305 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:14:14,305 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:14,305 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:14,307 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:14:14,309 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:14:14,316 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:14:14,318 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:14:14,321 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:14:14,323 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:14:14,325 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:14:14,629 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:14,629 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:14,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:14,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:14,631 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:14:14,638 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:14:14,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:14,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:14,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:14,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:14,648 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:14:14,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:14,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:14,662 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:14,668 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:14:14,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:14,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:14,670 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:14:14,673 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:14:14,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:14,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:14,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:14,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:14,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:14,686 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:14,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:14,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:14,706 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:14:14,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:14,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:14,707 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:14:14,711 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:14:14,712 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:14:14,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:14,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:14,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:14,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:14,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:14,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:14,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:14,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-10-12 17:14:14,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:14,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:14,734 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:14:14,736 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:14:14,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:14,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:14,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:14,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:14,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:14,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:14,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:14,765 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:14,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:14,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:14,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:14,890 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:14:14,891 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:14:14,894 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:14:14,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:14,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:14,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:14,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:14,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:14,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:14,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:14,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-10-12 17:14:14,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:14,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:15,046 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:14:15,047 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:14:15,049 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:14:15,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:15,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:15,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:15,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:15,057 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:15,057 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:15,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:15,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-10-12 17:14:15,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:15,063 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:14:15,064 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:14:15,068 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:14:15,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:15,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:15,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:15,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:15,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:15,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:15,084 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:15,090 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:15,090 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:14:15,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:15,091 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:14:15,105 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:15,113 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:14:15,170 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:15,170 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:15,170 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2023-10-12 17:14:15,176 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:14:15,185 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:14:15,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:15,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:15,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:15,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:15,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:15,219 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:14:15,220 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:14:15,220 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 30 transitions. cyclomatic complexity: 18 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:14:15,230 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 30 transitions. cyclomatic complexity: 18. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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 25 states and 43 transitions. Complement of second has 3 states. [2023-10-12 17:14:15,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 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:14:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2023-10-12 17:14:15,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2023-10-12 17:14:15,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:15,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 9 letters. Loop has 1 letters. [2023-10-12 17:14:15,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:15,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:14:15,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:15,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 43 transitions. [2023-10-12 17:14:15,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:14:15,233 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 40 transitions. [2023-10-12 17:14:15,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2023-10-12 17:14:15,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2023-10-12 17:14:15,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 40 transitions. [2023-10-12 17:14:15,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:15,233 INFO L219 hiAutomatonCegarLoop]: Abstraction has 23 states and 40 transitions. [2023-10-12 17:14:15,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 40 transitions. [2023-10-12 17:14:15,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2023-10-12 17:14:15,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 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:14:15,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2023-10-12 17:14:15,235 INFO L241 hiAutomatonCegarLoop]: Abstraction has 20 states and 35 transitions. [2023-10-12 17:14:15,235 INFO L430 stractBuchiCegarLoop]: Abstraction has 20 states and 35 transitions. [2023-10-12 17:14:15,235 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:14:15,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 35 transitions. [2023-10-12 17:14:15,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:14:15,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:15,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:15,236 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1] [2023-10-12 17:14:15,236 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:15,237 INFO L748 eck$LassoCheckResult]: Stem: 649#[$Ultimate##0]don't care [68] $Ultimate##0-->L61: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4) (= v_x_6 0) (= v_y_4 v_x_6)) InVars {y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{y=v_y_4, x=v_x_6, q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[] 645#[L61]don't care [93] L61-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 647#[$Ultimate##0, L61-1]don't care [70] $Ultimate##0-->L25-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i] 635#[L61-1, L25-1]don't care [90] L61-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 637#[L62, $Ultimate##0, L25-1]don't care [102] $Ultimate##0-->L45-1: Formula: (and (= v_s_11 0) v_f_7) InVars {} OutVars{f=v_f_7, s=v_s_11} AuxVars[] AssignedVars[f, s] 629#[L62, L45-1, L25-1]don't care [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 653#[L62, L45-1, L25-1]don't care [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 655#[L62, L45-1, L25-1]don't care [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 663#[L62, L45-1, L25-1]don't care [109] L25-1-->L25-1: Formula: (and (< v_i_19 v_N_21) (= v_q_back_63 (+ v_q_back_64 1)) (= (+ v_C_18 v_x_36) v_x_35) (= (select v_q_36 v_q_back_64) 1) (= v_i_18 (+ v_i_19 1))) InVars {q=v_q_36, q_back=v_q_back_64, N=v_N_21, i=v_i_19, x=v_x_36, C=v_C_18} OutVars{q=v_q_36, q_back=v_q_back_63, N=v_N_21, i=v_i_18, x=v_x_35, C=v_C_18} AuxVars[] AssignedVars[q_back, i, x] 661#[L62, L45-1, L25-1]don't care [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 651#[L62, L45-1, L25-1]don't care [2023-10-12 17:14:15,237 INFO L750 eck$LassoCheckResult]: Loop: 651#[L62, L45-1, L25-1]don't care [110] L45-1-->L45-1: Formula: (and (= v_s_39 (+ v_j_30 v_s_40)) (= v_y_13 (+ v_C_24 v_y_14)) v_f_22 (< v_q_front_55 v_q_back_75) (let ((.cse0 (= v_j_30 0))) (or (and .cse0 (not v_f_21)) (and v_f_21 (not .cse0)))) (= v_q_front_54 (+ v_q_front_55 1)) (= v_j_30 (select v_q_42 v_q_front_55))) InVars {q=v_q_42, q_back=v_q_back_75, y=v_y_14, q_front=v_q_front_55, f=v_f_22, C=v_C_24, s=v_s_40} OutVars{q=v_q_42, q_back=v_q_back_75, j=v_j_30, y=v_y_13, f=v_f_21, q_front=v_q_front_54, C=v_C_24, s=v_s_39} AuxVars[] AssignedVars[j, y, f, q_front, s] 651#[L62, L45-1, L25-1]don't care [2023-10-12 17:14:15,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:15,238 INFO L85 PathProgramCache]: Analyzing trace with hash 168277111, now seen corresponding path program 6 times [2023-10-12 17:14:15,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:15,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928859142] [2023-10-12 17:14:15,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:15,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:15,247 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:15,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:15,256 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:15,256 INFO L85 PathProgramCache]: Analyzing trace with hash 141, now seen corresponding path program 6 times [2023-10-12 17:14:15,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:15,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159106104] [2023-10-12 17:14:15,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:15,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:15,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:15,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:15,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:15,263 INFO L85 PathProgramCache]: Analyzing trace with hash 921623255, now seen corresponding path program 7 times [2023-10-12 17:14:15,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:15,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869746188] [2023-10-12 17:14:15,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:15,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:15,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:15,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:15,638 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:15,638 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:15,638 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:15,638 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:15,638 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:15,638 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:15,638 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:15,638 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:15,638 INFO L133 ssoRankerPreferences]: Filename of dumped script: queue-add-2-nl.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:14:15,638 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:15,638 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:15,640 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:14:15,643 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:14:15,756 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:14:15,759 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:15,762 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:15,770 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:14:15,773 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:14:16,042 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:16,043 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:16,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:16,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:16,049 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:14:16,052 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:14:16,053 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:14:16,070 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:14:16,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:16,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:16,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:16,072 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:16,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:16,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:16,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:16,078 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:14:16,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:16,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:16,079 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:14:16,081 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:14:16,082 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:14:16,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:16,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:16,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:16,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:16,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:16,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:16,117 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:16,123 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:14:16,123 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:14:16,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:16,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:16,125 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:16,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-10-12 17:14:16,169 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:16,190 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:16,191 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:16,191 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2023-10-12 17:14:16,198 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:14:16,204 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:14:16,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:16,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:16,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:16,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:16,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:16,249 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:14:16,250 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:14:16,250 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 35 transitions. cyclomatic complexity: 21 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:14:16,268 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 35 transitions. cyclomatic complexity: 21. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 22 states and 38 transitions. Complement of second has 3 states. [2023-10-12 17:14:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:14:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2023-10-12 17:14:16,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:16,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:16,270 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:16,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:16,295 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:16,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:16,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:16,313 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:16,313 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:14:16,313 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:14:16,314 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 35 transitions. cyclomatic complexity: 21 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:14:16,323 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 35 transitions. cyclomatic complexity: 21. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 22 states and 38 transitions. Complement of second has 3 states. [2023-10-12 17:14:16,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:16,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:14:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 8 transitions. [2023-10-12 17:14:16,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 8 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:16,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:16,325 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:16,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:16,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:16,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:16,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:16,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:16,362 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:14:16,362 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:14:16,362 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 35 transitions. cyclomatic complexity: 21 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:14:16,373 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 35 transitions. cyclomatic complexity: 21. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 21 states and 36 transitions. Complement of second has 2 states. [2023-10-12 17:14:16,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:14:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 9 transitions. [2023-10-12 17:14:16,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 10 letters. Loop has 1 letters. [2023-10-12 17:14:16,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:16,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 11 letters. Loop has 1 letters. [2023-10-12 17:14:16,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:16,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 9 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:14:16,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:16,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 36 transitions. [2023-10-12 17:14:16,375 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:16,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2023-10-12 17:14:16,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:14:16,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:14:16,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:14:16,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:14:16,375 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:16,376 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:16,376 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:16,376 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:14:16,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:14:16,376 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:16,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:14:16,381 INFO L201 PluginConnector]: Adding new model queue-add-2-nl.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:14:16 BoogieIcfgContainer [2023-10-12 17:14:16,381 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:14:16,382 INFO L158 Benchmark]: Toolchain (without parser) took 6556.48ms. Allocated memory was 186.6MB in the beginning and 302.0MB in the end (delta: 115.3MB). Free memory was 139.9MB in the beginning and 249.3MB in the end (delta: -109.4MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2023-10-12 17:14:16,382 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 186.6MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:14:16,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.99ms. Allocated memory is still 186.6MB. Free memory was 139.9MB in the beginning and 138.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-10-12 17:14:16,387 INFO L158 Benchmark]: Boogie Preprocessor took 21.27ms. Allocated memory is still 186.6MB. Free memory was 138.2MB in the beginning and 137.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:16,387 INFO L158 Benchmark]: RCFGBuilder took 272.39ms. Allocated memory is still 186.6MB. Free memory was 137.2MB in the beginning and 127.0MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:14:16,387 INFO L158 Benchmark]: BuchiAutomizer took 6233.38ms. Allocated memory was 186.6MB in the beginning and 302.0MB in the end (delta: 115.3MB). Free memory was 126.7MB in the beginning and 249.3MB in the end (delta: -122.6MB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:14:16,388 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.27ms. Allocated memory is still 186.6MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.99ms. Allocated memory is still 186.6MB. Free memory was 139.9MB in the beginning and 138.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.27ms. Allocated memory is still 186.6MB. Free memory was 138.2MB in the beginning and 137.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 272.39ms. Allocated memory is still 186.6MB. Free memory was 137.2MB in the beginning and 127.0MB in the end (delta: 10.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 6233.38ms. Allocated memory was 186.6MB in the beginning and 302.0MB in the end (delta: 115.3MB). Free memory was 126.7MB in the beginning and 249.3MB in the end (delta: -122.6MB). There was no memory consumed. 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 7 terminating modules (2 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 3 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 3 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 2 locations. One nondeterministic module has affine ranking function q_back + -1 * q_front and consists of 2 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 4.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 19 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital85 mio100 ax100 hnf100 lsp58 ukn97 mio100 lsp74 div100 bol114 ite100 ukn100 eq178 hnf91 smp100 dnf232 smp66 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 95ms VariablesStem: 4 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s - 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.5s, 32 PlacesBefore, 18 PlacesAfterwards, 27 TransitionsBefore, 13 TransitionsAfterwards, 198 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 12 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 172 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 158, independent conditional: 0, independent unconditional: 158, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 129, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 129, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 163, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 129, unknown conditional: 0, unknown unconditional: 129] , Statistics on independence cache: Total cache size (in pairs): 10, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, 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:14:16,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:16,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...