/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/prod-cons.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:14:28,052 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:14:28,126 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:28,154 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:14:28,155 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:14:28,155 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:14:28,157 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:14:28,157 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:14:28,157 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:14:28,161 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:14:28,161 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:14:28,161 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:14:28,162 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:14:28,163 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:14:28,164 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:14:28,164 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:14:28,164 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:14:28,164 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:14:28,164 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:14:28,165 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:14:28,165 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:14:28,165 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:14:28,167 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:14:28,167 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:14:28,167 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:14:28,167 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:14:28,167 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:14:28,168 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:14:28,168 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:14:28,168 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:14:28,169 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:14:28,169 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:14:28,169 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:14:28,171 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:14:28,171 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:28,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:14:28,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:14:28,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:14:28,434 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:14:28,435 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:14:28,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons.wvr.bpl [2023-10-12 17:14:28,436 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/prod-cons.wvr.bpl' [2023-10-12 17:14:28,477 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:14:28,478 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:14:28,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:28,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:14:28,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:14:28,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:28" (1/1) ... [2023-10-12 17:14:28,498 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:28" (1/1) ... [2023-10-12 17:14:28,503 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:14:28,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:14:28,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:14:28,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:14:28,507 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:14:28,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:28" (1/1) ... [2023-10-12 17:14:28,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:28" (1/1) ... [2023-10-12 17:14:28,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:28" (1/1) ... [2023-10-12 17:14:28,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:28" (1/1) ... [2023-10-12 17:14:28,519 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:28" (1/1) ... [2023-10-12 17:14:28,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:28" (1/1) ... [2023-10-12 17:14:28,523 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:28" (1/1) ... [2023-10-12 17:14:28,523 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:28" (1/1) ... [2023-10-12 17:14:28,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:14:28,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:14:28,525 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:14:28,525 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:14:28,526 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:28" (1/1) ... [2023-10-12 17:14:28,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:28,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:28,554 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:28,568 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:28,602 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:14:28,602 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:14:28,605 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:14:28,605 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:14:28,606 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:14:28,607 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:14:28,607 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:14:28,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:14:28,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:14:28,607 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:14:28,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:14:28,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:14:28,609 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:28,651 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:14:28,653 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:14:28,739 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:14:28,754 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:14:28,755 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:14:28,757 INFO L201 PluginConnector]: Adding new model prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:28 BoogieIcfgContainer [2023-10-12 17:14:28,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:14:28,758 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:14:28,758 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:14:28,762 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:14:28,763 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:28,763 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:14:28" (1/2) ... [2023-10-12 17:14:28,764 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e75cf27 and model type prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:14:28, skipping insertion in model container [2023-10-12 17:14:28,764 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:14:28,764 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:14:28" (2/2) ... [2023-10-12 17:14:28,766 INFO L332 chiAutomizerObserver]: Analyzing ICFG prod-cons.wvr.bpl [2023-10-12 17:14:28,851 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:14:28,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 90 flow [2023-10-12 17:14:28,895 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-10-12 17:14:28,895 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:14:28,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 2/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 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:28,899 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 90 flow [2023-10-12 17:14:28,903 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 27 transitions, 72 flow [2023-10-12 17:14:28,906 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:14:28,917 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 27 transitions, 72 flow [2023-10-12 17:14:28,919 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 72 flow [2023-10-12 17:14:28,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 72 flow [2023-10-12 17:14:28,926 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2023-10-12 17:14:28,927 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:14:28,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 27 events. 2/27 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 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:28,928 INFO L119 LiptonReduction]: Number of co-enabled transitions 138 [2023-10-12 17:14:29,316 INFO L134 LiptonReduction]: Checked pairs total: 220 [2023-10-12 17:14:29,316 INFO L136 LiptonReduction]: Total number of compositions: 13 [2023-10-12 17:14:29,338 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:14:29,339 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:14:29,339 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:14:29,339 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:14:29,339 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:14:29,339 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:14:29,339 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:14:29,340 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:14:29,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:14:29,374 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 20 [2023-10-12 17:14:29,374 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:29,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:29,379 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:14:29,379 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:29,379 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:14:29,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 32 states, but on-demand construction may add more states [2023-10-12 17:14:29,382 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 20 [2023-10-12 17:14:29,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:29,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:29,383 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:14:29,383 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:14:29,386 INFO L748 eck$LassoCheckResult]: Stem: 41#[$Ultimate##0]don't care [102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[] 44#[L57]don't care [80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 46#[L57-1, L21]don't care [2023-10-12 17:14:29,387 INFO L750 eck$LassoCheckResult]: Loop: 46#[L57-1, L21]don't care [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 46#[L57-1, L21]don't care [2023-10-12 17:14:29,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:29,391 INFO L85 PathProgramCache]: Analyzing trace with hash 4203, now seen corresponding path program 1 times [2023-10-12 17:14:29,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:29,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754819877] [2023-10-12 17:14:29,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:29,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:29,483 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:29,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:29,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:29,501 INFO L85 PathProgramCache]: Analyzing trace with hash 130, now seen corresponding path program 1 times [2023-10-12 17:14:29,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:29,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246728172] [2023-10-12 17:14:29,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:29,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:29,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:29,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:29,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:29,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:29,516 INFO L85 PathProgramCache]: Analyzing trace with hash 130392, now seen corresponding path program 1 times [2023-10-12 17:14:29,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:29,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167784164] [2023-10-12 17:14:29,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:29,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:29,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:29,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:29,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:29,629 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:29,629 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:29,629 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:29,629 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:29,630 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:29,630 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:29,630 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:29,630 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:29,630 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:14:29,630 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:29,630 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:29,645 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:29,659 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:29,669 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:29,672 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:29,677 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:29,772 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:29,777 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:29,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:29,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:29,785 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:29,792 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:29,793 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:29,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:29,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:29,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:29,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:29,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:29,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:29,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:29,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:29,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:29,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:29,963 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:29,964 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:29,966 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:29,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:29,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:29,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:29,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:29,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:29,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:29,999 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:30,019 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:14:30,019 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:14:30,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:30,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:30,029 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:30,037 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:30,064 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:30,079 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:30,079 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:30,080 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(w) = 1*w Supporting invariants [] [2023-10-12 17:14:30,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:14:30,087 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:30,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:30,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:30,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:30,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:30,144 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:30,145 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:30,185 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:30,188 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 32 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:30,242 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 32 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 90 states and 244 transitions. Complement of second has 5 states. [2023-10-12 17:14:30,244 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:30,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2023-10-12 17:14:30,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:14:30,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:30,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:14:30,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:30,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:14:30,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:30,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 244 transitions. [2023-10-12 17:14:30,267 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2023-10-12 17:14:30,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 45 states and 125 transitions. [2023-10-12 17:14:30,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-10-12 17:14:30,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2023-10-12 17:14:30,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 125 transitions. [2023-10-12 17:14:30,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:30,277 INFO L219 hiAutomatonCegarLoop]: Abstraction has 45 states and 125 transitions. [2023-10-12 17:14:30,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 125 transitions. [2023-10-12 17:14:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2023-10-12 17:14:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.878787878787879) internal successors, (95), 32 states have internal predecessors, (95), 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:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 95 transitions. [2023-10-12 17:14:30,301 INFO L241 hiAutomatonCegarLoop]: Abstraction has 33 states and 95 transitions. [2023-10-12 17:14:30,301 INFO L430 stractBuchiCegarLoop]: Abstraction has 33 states and 95 transitions. [2023-10-12 17:14:30,301 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:14:30,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 95 transitions. [2023-10-12 17:14:30,302 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2023-10-12 17:14:30,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:30,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:30,303 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:30,303 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:30,303 INFO L748 eck$LassoCheckResult]: Stem: 278#[$Ultimate##0]don't care [102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[] 280#[L57]don't care [80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 226#[L57-1, L21]don't care [83] L57-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 230#[L58, L21, L33]don't care [2023-10-12 17:14:30,303 INFO L750 eck$LassoCheckResult]: Loop: 230#[L58, L21, L33]don't care [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 260#[L58, L34, L21]don't care [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 230#[L58, L21, L33]don't care [2023-10-12 17:14:30,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:30,304 INFO L85 PathProgramCache]: Analyzing trace with hash 130376, now seen corresponding path program 1 times [2023-10-12 17:14:30,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:30,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124879268] [2023-10-12 17:14:30,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:30,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:30,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:30,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:30,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:30,319 INFO L85 PathProgramCache]: Analyzing trace with hash 3287, now seen corresponding path program 1 times [2023-10-12 17:14:30,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:30,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633023728] [2023-10-12 17:14:30,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:30,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:30,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:30,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:30,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:30,328 INFO L85 PathProgramCache]: Analyzing trace with hash 125293662, now seen corresponding path program 1 times [2023-10-12 17:14:30,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:30,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920599036] [2023-10-12 17:14:30,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:30,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:30,375 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:30,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:30,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920599036] [2023-10-12 17:14:30,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920599036] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:30,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:30,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:14:30,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284373799] [2023-10-12 17:14:30,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:30,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:30,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:14:30,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:14:30,410 INFO L87 Difference]: Start difference. First operand 33 states and 95 transitions. cyclomatic complexity: 74 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:30,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:30,429 INFO L93 Difference]: Finished difference Result 56 states and 137 transitions. [2023-10-12 17:14:30,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 137 transitions. [2023-10-12 17:14:30,431 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2023-10-12 17:14:30,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 39 states and 106 transitions. [2023-10-12 17:14:30,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-10-12 17:14:30,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-10-12 17:14:30,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 106 transitions. [2023-10-12 17:14:30,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:30,432 INFO L219 hiAutomatonCegarLoop]: Abstraction has 39 states and 106 transitions. [2023-10-12 17:14:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 106 transitions. [2023-10-12 17:14:30,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-10-12 17:14:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.717948717948718) internal successors, (106), 38 states have internal predecessors, (106), 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:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 106 transitions. [2023-10-12 17:14:30,441 INFO L241 hiAutomatonCegarLoop]: Abstraction has 39 states and 106 transitions. [2023-10-12 17:14:30,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:14:30,442 INFO L430 stractBuchiCegarLoop]: Abstraction has 39 states and 106 transitions. [2023-10-12 17:14:30,442 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:14:30,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 106 transitions. [2023-10-12 17:14:30,446 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2023-10-12 17:14:30,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:30,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:30,446 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:14:30,446 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:30,447 INFO L748 eck$LassoCheckResult]: Stem: 410#[$Ultimate##0]don't care [102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[] 412#[L57]don't care [80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 356#[L57-1, L21]don't care [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 360#[L57-1, L21]don't care [83] L57-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 362#[L58, L21, L33]don't care [2023-10-12 17:14:30,447 INFO L750 eck$LassoCheckResult]: Loop: 362#[L58, L21, L33]don't care [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 372#[L58, L34, L21]don't care [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 362#[L58, L21, L33]don't care [2023-10-12 17:14:30,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:30,448 INFO L85 PathProgramCache]: Analyzing trace with hash 4042235, now seen corresponding path program 1 times [2023-10-12 17:14:30,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:30,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068477703] [2023-10-12 17:14:30,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:30,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:30,460 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:30,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:30,471 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:30,472 INFO L85 PathProgramCache]: Analyzing trace with hash 3287, now seen corresponding path program 2 times [2023-10-12 17:14:30,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:30,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160989756] [2023-10-12 17:14:30,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:30,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:30,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:30,480 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:30,480 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:30,480 INFO L85 PathProgramCache]: Analyzing trace with hash -410377135, now seen corresponding path program 1 times [2023-10-12 17:14:30,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:30,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944546959] [2023-10-12 17:14:30,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:30,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:30,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:30,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:30,614 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:30,614 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:30,614 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:30,614 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:30,614 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:30,614 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:30,614 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:30,614 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:30,615 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:14:30,615 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:30,615 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:30,617 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:30,620 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:30,627 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:30,650 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:30,653 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:30,656 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:30,766 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:30,766 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:30,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:30,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:30,770 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:30,778 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:30,778 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:30,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:30,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:30,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:30,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:30,788 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:30,788 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:30,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:30,807 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:30,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:30,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:30,809 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:30,819 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:30,821 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:30,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:30,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:30,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:30,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:30,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:30,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:30,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:30,874 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:30,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:30,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:30,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:30,901 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:30,919 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:30,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:30,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:30,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:30,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:30,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:30,933 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:30,934 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:30,948 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:30,958 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:30,959 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:14:30,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:30,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:30,960 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:30,962 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:30,963 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:30,971 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:30,971 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:30,971 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(back, front) = 1*back - 1*front Supporting invariants [] [2023-10-12 17:14:30,974 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:30,976 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:30,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:31,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:31,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:31,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:31,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:31,028 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:31,028 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:31,028 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 106 transitions. cyclomatic complexity: 79 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:31,062 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 106 transitions. cyclomatic complexity: 79. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 109 states and 266 transitions. Complement of second has 5 states. [2023-10-12 17:14:31,066 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:31,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:31,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2023-10-12 17:14:31,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:14:31,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:31,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:14:31,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:31,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:14:31,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:31,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 266 transitions. [2023-10-12 17:14:31,069 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2023-10-12 17:14:31,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 51 states and 134 transitions. [2023-10-12 17:14:31,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-10-12 17:14:31,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-10-12 17:14:31,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 134 transitions. [2023-10-12 17:14:31,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:31,070 INFO L219 hiAutomatonCegarLoop]: Abstraction has 51 states and 134 transitions. [2023-10-12 17:14:31,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 134 transitions. [2023-10-12 17:14:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2023-10-12 17:14:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.6956521739130435) internal successors, (124), 45 states have internal predecessors, (124), 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:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 124 transitions. [2023-10-12 17:14:31,074 INFO L241 hiAutomatonCegarLoop]: Abstraction has 46 states and 124 transitions. [2023-10-12 17:14:31,074 INFO L430 stractBuchiCegarLoop]: Abstraction has 46 states and 124 transitions. [2023-10-12 17:14:31,074 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:14:31,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 124 transitions. [2023-10-12 17:14:31,075 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2023-10-12 17:14:31,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:31,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:31,075 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:14:31,075 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:31,076 INFO L748 eck$LassoCheckResult]: Stem: 632#[$Ultimate##0]don't care [102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[] 634#[L57]don't care [80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 580#[L57-1, L21]don't care [83] L57-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 582#[L58, L21, L33]don't care [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 626#[L58, L21, L33]don't care [86] L58-->$Ultimate##0: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 606#[L33, $Ultimate##0, L59, L21]don't care [2023-10-12 17:14:31,076 INFO L750 eck$LassoCheckResult]: Loop: 606#[L33, $Ultimate##0, L59, L21]don't care [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 594#[L34, $Ultimate##0, L21, L59]don't care [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 606#[L33, $Ultimate##0, L59, L21]don't care [2023-10-12 17:14:31,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:31,076 INFO L85 PathProgramCache]: Analyzing trace with hash 125294491, now seen corresponding path program 1 times [2023-10-12 17:14:31,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:31,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084198134] [2023-10-12 17:14:31,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:31,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:31,099 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:31,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:31,105 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:31,105 INFO L85 PathProgramCache]: Analyzing trace with hash 3287, now seen corresponding path program 3 times [2023-10-12 17:14:31,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:31,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538001418] [2023-10-12 17:14:31,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:31,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:31,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:31,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:31,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:31,125 INFO L85 PathProgramCache]: Analyzing trace with hash 148923889, now seen corresponding path program 1 times [2023-10-12 17:14:31,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:31,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632316884] [2023-10-12 17:14:31,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:31,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:31,145 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:31,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:31,318 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:31,319 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:31,319 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:31,319 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:31,319 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:31,319 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:31,319 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:31,319 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:31,319 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:14:31,319 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:31,319 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:31,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:31,329 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:31,351 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:31,359 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:31,361 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:31,364 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:31,367 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:31,369 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:31,371 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:31,484 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:31,484 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:31,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:31,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:31,489 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:31,491 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:31,506 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:31,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:31,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:31,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:31,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:31,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:31,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:31,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:31,539 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:31,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:31,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:31,540 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:31,543 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:31,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:31,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:31,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:31,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:31,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:31,553 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:31,553 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:31,559 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:31,567 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:14:31,567 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:14:31,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:31,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:31,571 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:31,571 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:31,573 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:31,585 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:31,586 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:31,586 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(back, front) = 1*back - 1*front Supporting invariants [] [2023-10-12 17:14:31,589 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:31,590 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:31,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:31,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:31,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:31,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:31,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:31,643 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:31,645 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:31,645 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 124 transitions. cyclomatic complexity: 93 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:31,680 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 124 transitions. cyclomatic complexity: 93. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 103 states and 263 transitions. Complement of second has 5 states. [2023-10-12 17:14:31,680 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:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2023-10-12 17:14:31,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:14:31,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:31,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:14:31,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:31,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:14:31,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:31,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 263 transitions. [2023-10-12 17:14:31,690 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2023-10-12 17:14:31,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 57 states and 143 transitions. [2023-10-12 17:14:31,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-10-12 17:14:31,694 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-10-12 17:14:31,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 143 transitions. [2023-10-12 17:14:31,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:31,694 INFO L219 hiAutomatonCegarLoop]: Abstraction has 57 states and 143 transitions. [2023-10-12 17:14:31,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 143 transitions. [2023-10-12 17:14:31,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2023-10-12 17:14:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.595744680851064) internal successors, (122), 46 states have internal predecessors, (122), 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:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 122 transitions. [2023-10-12 17:14:31,703 INFO L241 hiAutomatonCegarLoop]: Abstraction has 47 states and 122 transitions. [2023-10-12 17:14:31,704 INFO L430 stractBuchiCegarLoop]: Abstraction has 47 states and 122 transitions. [2023-10-12 17:14:31,704 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:14:31,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 122 transitions. [2023-10-12 17:14:31,705 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2023-10-12 17:14:31,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:31,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:31,705 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:14:31,705 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:31,706 INFO L748 eck$LassoCheckResult]: Stem: 867#[$Ultimate##0]don't care [102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[] 869#[L57]don't care [80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 815#[L57-1, L21]don't care [83] L57-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 817#[L58, L21, L33]don't care [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 863#[L58, L21, L33]don't care [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 827#[L58, L34, L21]don't care [2023-10-12 17:14:31,706 INFO L750 eck$LassoCheckResult]: Loop: 827#[L58, L34, L21]don't care [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 831#[L58, L21, L33]don't care [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 827#[L58, L34, L21]don't care [2023-10-12 17:14:31,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:31,706 INFO L85 PathProgramCache]: Analyzing trace with hash 125294477, now seen corresponding path program 1 times [2023-10-12 17:14:31,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:31,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452307093] [2023-10-12 17:14:31,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:31,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:31,717 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:31,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:31,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:31,733 INFO L85 PathProgramCache]: Analyzing trace with hash 3947, now seen corresponding path program 4 times [2023-10-12 17:14:31,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:31,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522201157] [2023-10-12 17:14:31,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:31,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:31,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:31,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:31,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:31,739 INFO L85 PathProgramCache]: Analyzing trace with hash 148911095, now seen corresponding path program 2 times [2023-10-12 17:14:31,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:31,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601498134] [2023-10-12 17:14:31,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:31,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:31,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:31,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:31,856 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:31,856 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:31,857 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:31,857 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:31,857 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:31,857 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:31,857 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:31,857 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:31,857 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:14:31,857 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:31,857 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:31,858 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:31,862 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:31,864 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:31,870 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:31,877 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:31,898 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:31,993 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:31,994 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:31,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:31,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:31,997 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:31,999 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:32,001 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:32,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:32,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:32,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:32,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:32,010 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:32,010 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:32,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:32,025 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:32,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:32,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:32,191 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:32,192 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:32,200 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:32,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:32,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:32,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:32,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:32,208 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:32,208 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:32,233 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:32,241 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:32,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:32,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:32,243 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:32,269 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:32,270 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:32,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:32,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:32,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:32,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:32,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:32,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:32,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:32,293 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:32,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:32,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:32,294 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:32,295 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:32,297 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:32,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:32,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:32,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:32,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:32,305 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:32,305 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:32,308 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:32,311 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:32,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:32,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:32,312 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:32,313 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:32,315 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:32,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:32,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:32,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:32,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:32,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:32,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:32,341 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:32,361 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:32,361 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:14:32,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:32,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:32,369 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:32,376 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:32,385 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:32,394 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:32,395 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:32,395 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(back, front) = 1*back - 1*front Supporting invariants [] [2023-10-12 17:14:32,399 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:32,400 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:32,413 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:32,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:32,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:32,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:32,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:32,475 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:32,476 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:14:32,476 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 122 transitions. cyclomatic complexity: 90 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:32,514 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 122 transitions. cyclomatic complexity: 90. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 158 states and 382 transitions. Complement of second has 5 states. [2023-10-12 17:14:32,514 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:32,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2023-10-12 17:14:32,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:14:32,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:32,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:14:32,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:32,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:14:32,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:32,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 382 transitions. [2023-10-12 17:14:32,523 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2023-10-12 17:14:32,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 89 states and 222 transitions. [2023-10-12 17:14:32,525 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-10-12 17:14:32,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-10-12 17:14:32,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 222 transitions. [2023-10-12 17:14:32,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:32,525 INFO L219 hiAutomatonCegarLoop]: Abstraction has 89 states and 222 transitions. [2023-10-12 17:14:32,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 222 transitions. [2023-10-12 17:14:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2023-10-12 17:14:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.6964285714285716) internal successors, (151), 55 states have internal predecessors, (151), 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:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 151 transitions. [2023-10-12 17:14:32,538 INFO L241 hiAutomatonCegarLoop]: Abstraction has 56 states and 151 transitions. [2023-10-12 17:14:32,538 INFO L430 stractBuchiCegarLoop]: Abstraction has 56 states and 151 transitions. [2023-10-12 17:14:32,538 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:14:32,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 151 transitions. [2023-10-12 17:14:32,539 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 16 [2023-10-12 17:14:32,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:32,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:32,539 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:14:32,539 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:32,539 INFO L748 eck$LassoCheckResult]: Stem: 1162#[$Ultimate##0]don't care [102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[] 1164#[L57]don't care [80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 1112#[L57-1, L21]don't care [83] L57-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1114#[L58, L21, L33]don't care [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 1160#[L58, L34, L21]don't care [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 1180#[L58, L34, L21]don't care [93] L21-->thread1EXIT: Formula: (or (<= v_w_12 0) (not v_v_assert_21)) InVars {v_assert=v_v_assert_21, w=v_w_12} OutVars{v_assert=v_v_assert_21, w=v_w_12} AuxVars[] AssignedVars[] 1136#[L58, L34, thread1EXIT]don't care [2023-10-12 17:14:32,540 INFO L750 eck$LassoCheckResult]: Loop: 1136#[L58, L34, thread1EXIT]don't care [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 1148#[L58, L33, thread1EXIT]don't care [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 1136#[L58, L34, thread1EXIT]don't care [2023-10-12 17:14:32,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:32,540 INFO L85 PathProgramCache]: Analyzing trace with hash -410863526, now seen corresponding path program 1 times [2023-10-12 17:14:32,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:32,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282775567] [2023-10-12 17:14:32,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:32,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:32,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:32,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:32,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:32,552 INFO L85 PathProgramCache]: Analyzing trace with hash 3947, now seen corresponding path program 5 times [2023-10-12 17:14:32,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:32,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807739248] [2023-10-12 17:14:32,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:32,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:32,557 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:32,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:32,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:32,563 INFO L85 PathProgramCache]: Analyzing trace with hash 297145732, now seen corresponding path program 1 times [2023-10-12 17:14:32,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:32,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463297110] [2023-10-12 17:14:32,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:32,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:32,574 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:32,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:32,630 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:32,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:32,642 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:32,745 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:32,745 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:32,745 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:32,745 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:32,746 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:32,746 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:32,746 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:32,746 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:32,746 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:14:32,747 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:32,747 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:32,750 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:32,771 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:32,778 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:32,780 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:32,783 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:32,785 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:32,881 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:32,881 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:32,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:32,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:32,889 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:32,899 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:32,901 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:32,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:32,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:32,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:32,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:32,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:32,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:32,925 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:32,928 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:32,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:32,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:32,929 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:32,930 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:32,933 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:32,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:32,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:32,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:32,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:32,942 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:32,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:32,953 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:32,960 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:14:32,960 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:14:32,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:32,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:32,963 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:32,966 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:32,967 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:32,973 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:32,974 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:32,974 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(front, back) = -1*front + 1*back Supporting invariants [] [2023-10-12 17:14:32,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:32,980 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:32,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:32,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:32,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:33,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:33,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:33,032 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:33,033 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:14:33,033 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 151 transitions. cyclomatic complexity: 113 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:33,055 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 151 transitions. cyclomatic complexity: 113. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 77 states and 198 transitions. Complement of second has 4 states. [2023-10-12 17:14:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2023-10-12 17:14:33,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:14:33,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:33,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:14:33,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:33,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 6 letters. Loop has 4 letters. [2023-10-12 17:14:33,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:33,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 198 transitions. [2023-10-12 17:14:33,059 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-10-12 17:14:33,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 46 states and 121 transitions. [2023-10-12 17:14:33,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2023-10-12 17:14:33,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-10-12 17:14:33,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 121 transitions. [2023-10-12 17:14:33,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:33,060 INFO L219 hiAutomatonCegarLoop]: Abstraction has 46 states and 121 transitions. [2023-10-12 17:14:33,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 121 transitions. [2023-10-12 17:14:33,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-10-12 17:14:33,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.630434782608696) internal successors, (121), 45 states have internal predecessors, (121), 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:33,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 121 transitions. [2023-10-12 17:14:33,073 INFO L241 hiAutomatonCegarLoop]: Abstraction has 46 states and 121 transitions. [2023-10-12 17:14:33,073 INFO L430 stractBuchiCegarLoop]: Abstraction has 46 states and 121 transitions. [2023-10-12 17:14:33,073 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:14:33,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 121 transitions. [2023-10-12 17:14:33,074 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-10-12 17:14:33,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:33,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:33,075 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:14:33,075 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:33,076 INFO L748 eck$LassoCheckResult]: Stem: 1370#[$Ultimate##0]don't care [102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[] 1372#[L57]don't care [80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 1340#[L57-1, L21]don't care [83] L57-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1342#[L58, L21, L33]don't care [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 1364#[L58, L34, L21]don't care [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 1366#[L58, L34, L21]don't care [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 1362#[L58, L21, L33]don't care [2023-10-12 17:14:33,076 INFO L750 eck$LassoCheckResult]: Loop: 1362#[L58, L21, L33]don't care [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 1360#[L58, L34, L21]don't care [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 1362#[L58, L21, L33]don't care [2023-10-12 17:14:33,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:33,077 INFO L85 PathProgramCache]: Analyzing trace with hash -410863525, now seen corresponding path program 3 times [2023-10-12 17:14:33,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:33,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956681245] [2023-10-12 17:14:33,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:33,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:33,086 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:33,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:33,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:33,092 INFO L85 PathProgramCache]: Analyzing trace with hash 3287, now seen corresponding path program 6 times [2023-10-12 17:14:33,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:33,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652313358] [2023-10-12 17:14:33,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:33,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:33,095 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:33,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:33,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:33,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:33,098 INFO L85 PathProgramCache]: Analyzing trace with hash 297146033, now seen corresponding path program 4 times [2023-10-12 17:14:33,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:33,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456250575] [2023-10-12 17:14:33,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:33,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:33,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:33,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:33,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:33,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456250575] [2023-10-12 17:14:33,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456250575] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:14:33,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501143445] [2023-10-12 17:14:33,133 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-10-12 17:14:33,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:14:33,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:33,135 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:14:33,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-10-12 17:14:33,166 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-10-12 17:14:33,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:14:33,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:33,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-10-12 17:14:33,179 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:14:33,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501143445] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:33,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:14:33,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2023-10-12 17:14:33,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455593929] [2023-10-12 17:14:33,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:33,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:33,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:14:33,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:14:33,204 INFO L87 Difference]: Start difference. First operand 46 states and 121 transitions. cyclomatic complexity: 88 Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:33,222 INFO L93 Difference]: Finished difference Result 109 states and 269 transitions. [2023-10-12 17:14:33,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 269 transitions. [2023-10-12 17:14:33,224 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-10-12 17:14:33,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 94 states and 240 transitions. [2023-10-12 17:14:33,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2023-10-12 17:14:33,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-10-12 17:14:33,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 240 transitions. [2023-10-12 17:14:33,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:33,225 INFO L219 hiAutomatonCegarLoop]: Abstraction has 94 states and 240 transitions. [2023-10-12 17:14:33,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 240 transitions. [2023-10-12 17:14:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2023-10-12 17:14:33,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 2.6486486486486487) internal successors, (196), 73 states have internal predecessors, (196), 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:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 196 transitions. [2023-10-12 17:14:33,228 INFO L241 hiAutomatonCegarLoop]: Abstraction has 74 states and 196 transitions. [2023-10-12 17:14:33,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:14:33,230 INFO L430 stractBuchiCegarLoop]: Abstraction has 74 states and 196 transitions. [2023-10-12 17:14:33,230 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:14:33,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 196 transitions. [2023-10-12 17:14:33,230 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-10-12 17:14:33,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:33,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:33,231 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2023-10-12 17:14:33,231 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:33,231 INFO L748 eck$LassoCheckResult]: Stem: 1602#[$Ultimate##0]don't care [102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[] 1604#[L57]don't care [80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 1572#[L57-1, L21]don't care [83] L57-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1574#[L58, L21, L33]don't care [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 1614#[L58, L21, L33]don't care [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 1690#[L58, L34, L21]don't care [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 1650#[L58, L34, L21]don't care [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 1596#[L58, L21, L33]don't care [2023-10-12 17:14:33,231 INFO L750 eck$LassoCheckResult]: Loop: 1596#[L58, L21, L33]don't care [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 1594#[L58, L34, L21]don't care [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 1596#[L58, L21, L33]don't care [2023-10-12 17:14:33,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:33,232 INFO L85 PathProgramCache]: Analyzing trace with hash 148911272, now seen corresponding path program 5 times [2023-10-12 17:14:33,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:33,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486299278] [2023-10-12 17:14:33,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:33,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:33,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:33,242 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:33,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:33,242 INFO L85 PathProgramCache]: Analyzing trace with hash 3287, now seen corresponding path program 7 times [2023-10-12 17:14:33,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:33,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988604203] [2023-10-12 17:14:33,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:33,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:33,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:33,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:33,247 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:33,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1369813950, now seen corresponding path program 6 times [2023-10-12 17:14:33,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:33,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042670102] [2023-10-12 17:14:33,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:33,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:33,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:33,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:33,408 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:33,408 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:33,409 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:33,409 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:33,409 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:33,409 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:33,409 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:33,409 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:33,409 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_BEv2_Iteration8_Lasso [2023-10-12 17:14:33,409 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:33,409 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:33,410 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:33,413 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:33,415 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:33,420 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:33,471 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:33,474 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:33,600 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:33,600 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:33,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:33,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:33,659 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:33,673 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:33,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:33,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:33,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:33,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:33,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:33,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:33,685 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:33,692 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:33,701 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:33,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:33,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:33,703 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:33,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:33,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:33,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:33,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:33,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:33,721 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:33,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:33,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:33,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:33,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2023-10-12 17:14:33,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:33,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:33,760 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:33,761 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:33,763 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:33,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:33,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:33,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:33,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:33,772 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:33,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:33,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:33,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:33,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:33,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:33,794 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:33,805 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:33,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:33,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:33,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:33,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:33,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:33,819 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:33,805 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:33,833 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:33,839 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:33,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:33,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:33,841 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:33,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:33,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:33,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:33,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:33,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:33,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:33,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:33,861 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:33,871 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:33,881 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:14:33,881 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:14:33,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:33,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:33,885 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:33,888 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:33,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:33,913 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:33,913 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:33,913 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(back, front) = 1*back - 1*front Supporting invariants [] [2023-10-12 17:14:33,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:33,922 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:14:33,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:33,946 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:33,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:33,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:33,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:33,962 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:33,962 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:33,962 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 196 transitions. cyclomatic complexity: 138 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:33,982 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 196 transitions. cyclomatic complexity: 138. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 159 states and 378 transitions. Complement of second has 5 states. [2023-10-12 17:14:33,982 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:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2023-10-12 17:14:33,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:14:33,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:33,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:14:33,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:33,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:14:33,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:33,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 378 transitions. [2023-10-12 17:14:33,985 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-10-12 17:14:33,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 128 states and 314 transitions. [2023-10-12 17:14:33,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2023-10-12 17:14:33,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-10-12 17:14:33,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 314 transitions. [2023-10-12 17:14:33,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:33,986 INFO L219 hiAutomatonCegarLoop]: Abstraction has 128 states and 314 transitions. [2023-10-12 17:14:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 314 transitions. [2023-10-12 17:14:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 87. [2023-10-12 17:14:33,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 2.6206896551724137) internal successors, (228), 86 states have internal predecessors, (228), 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:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 228 transitions. [2023-10-12 17:14:33,993 INFO L241 hiAutomatonCegarLoop]: Abstraction has 87 states and 228 transitions. [2023-10-12 17:14:33,993 INFO L430 stractBuchiCegarLoop]: Abstraction has 87 states and 228 transitions. [2023-10-12 17:14:33,993 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:14:33,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 228 transitions. [2023-10-12 17:14:33,994 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-10-12 17:14:33,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:33,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:33,995 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1] [2023-10-12 17:14:33,995 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:33,995 INFO L748 eck$LassoCheckResult]: Stem: 1963#[$Ultimate##0]don't care [102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[] 1965#[L57]don't care [80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 1933#[L57-1, L21]don't care [83] L57-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 1935#[L58, L21, L33]don't care [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 2053#[L58, L21, L33]don't care [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 1973#[L58, L21, L33]don't care [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 1977#[L58, L34, L21]don't care [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 2023#[L58, L21, L33]don't care [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 2015#[L58, L21, L33]don't care [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 1943#[L58, L34, L21]don't care [2023-10-12 17:14:33,995 INFO L750 eck$LassoCheckResult]: Loop: 1943#[L58, L34, L21]don't care [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 1945#[L58, L21, L33]don't care [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 1943#[L58, L34, L21]don't care [2023-10-12 17:14:33,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:33,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1393945475, now seen corresponding path program 7 times [2023-10-12 17:14:33,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:33,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733294944] [2023-10-12 17:14:33,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:33,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,012 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,021 INFO L85 PathProgramCache]: Analyzing trace with hash 3947, now seen corresponding path program 8 times [2023-10-12 17:14:34,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901650455] [2023-10-12 17:14:34,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,025 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,027 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash -448191891, now seen corresponding path program 8 times [2023-10-12 17:14:34,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806386964] [2023-10-12 17:14:34,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,236 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:34,236 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:34,236 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:34,236 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:34,236 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:34,236 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,236 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:34,236 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:34,236 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_BEv2_Iteration9_Lasso [2023-10-12 17:14:34,236 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:34,237 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:34,238 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:34,244 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:34,247 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:34,250 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:34,252 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:34,255 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:34,337 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:34,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:34,479 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:34,479 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:34,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,481 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:34,491 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:34,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:34,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:34,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:34,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:34,500 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:34,500 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:34,504 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:34,513 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:34,517 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:34,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,518 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:34,525 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:34,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:34,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:34,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:34,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:34,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:34,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:34,539 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:34,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:34,550 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:34,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,551 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:34,554 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:34,555 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:34,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:34,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:34,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:34,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:34,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:34,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:34,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:34,575 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:34,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,576 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:34,577 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:34,579 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:34,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:34,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:34,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:34,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:34,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:34,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:34,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:34,592 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:34,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,594 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:34,595 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:34,597 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:34,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:34,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:34,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:34,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:34,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:34,605 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:34,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:34,617 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:34,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,618 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:34,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-10-12 17:14:34,621 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:34,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:34,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:34,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:34,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:34,630 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:34,630 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:34,657 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:34,665 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:14:34,665 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:14:34,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:34,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:34,669 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:34,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-10-12 17:14:34,677 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:34,698 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:34,698 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:34,698 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(back, front) = 1*back - 1*front Supporting invariants [] [2023-10-12 17:14:34,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:34,706 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:14:34,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:34,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:34,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:34,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:34,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:34,752 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:34,765 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:34,765 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:14:34,766 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 87 states and 228 transitions. cyclomatic complexity: 160 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:34,786 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 87 states and 228 transitions. cyclomatic complexity: 160. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 148 states and 360 transitions. Complement of second has 5 states. [2023-10-12 17:14:34,787 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:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2023-10-12 17:14:34,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:14:34,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:34,788 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:34,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:34,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:34,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:34,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:34,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:34,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:34,832 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:34,833 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:14:34,833 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 87 states and 228 transitions. cyclomatic complexity: 160 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:34,860 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 87 states and 228 transitions. cyclomatic complexity: 160. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 221 states and 522 transitions. Complement of second has 7 states. [2023-10-12 17:14:34,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:34,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:34,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2023-10-12 17:14:34,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:14:34,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:34,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:14:34,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:34,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 4 letters. [2023-10-12 17:14:34,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:34,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 221 states and 522 transitions. [2023-10-12 17:14:34,867 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-10-12 17:14:34,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 221 states to 188 states and 462 transitions. [2023-10-12 17:14:34,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2023-10-12 17:14:34,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2023-10-12 17:14:34,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 188 states and 462 transitions. [2023-10-12 17:14:34,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:34,870 INFO L219 hiAutomatonCegarLoop]: Abstraction has 188 states and 462 transitions. [2023-10-12 17:14:34,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states and 462 transitions. [2023-10-12 17:14:34,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 143. [2023-10-12 17:14:34,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 143 states have (on average 2.6503496503496504) internal successors, (379), 142 states have internal predecessors, (379), 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:34,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 379 transitions. [2023-10-12 17:14:34,876 INFO L241 hiAutomatonCegarLoop]: Abstraction has 143 states and 379 transitions. [2023-10-12 17:14:34,876 INFO L430 stractBuchiCegarLoop]: Abstraction has 143 states and 379 transitions. [2023-10-12 17:14:34,877 INFO L337 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-10-12 17:14:34,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 379 transitions. [2023-10-12 17:14:34,878 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2023-10-12 17:14:34,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:34,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:34,878 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1] [2023-10-12 17:14:34,878 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:34,878 INFO L748 eck$LassoCheckResult]: Stem: 2606#[$Ultimate##0]don't care [102] $Ultimate##0-->L57: Formula: (and (= v_back_46 v_front_38) (= v_W_26 v_w_40) (= v_d_45 0) v_v_assert_53 (<= 0 v_W_26)) InVars {front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} OutVars{front=v_front_38, back=v_back_46, v_assert=v_v_assert_53, w=v_w_40, W=v_W_26, d=v_d_45} AuxVars[] AssignedVars[] 2608#[L57]don't care [80] L57-->L21: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 2574#[L57-1, L21]don't care [83] L57-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 2576#[L58, L21, L33]don't care [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 2692#[L58, L21, L33]don't care [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 2698#[L58, L34, L21]don't care [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 2682#[L58, L34, L21]don't care [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 2678#[L58, L21, L33]don't care [99] L21-->L21: Formula: (and (= (+ v_back_37 1) v_back_36) (< 0 v_w_29) v_v_assert_36 (= (select v_queue_21 v_back_37) 1) (= v_w_29 (+ v_w_28 1))) InVars {queue=v_queue_21, back=v_back_37, w=v_w_29, v_assert=v_v_assert_36} OutVars{queue=v_queue_21, back=v_back_36, w=v_w_28, v_assert=v_v_assert_36} AuxVars[] AssignedVars[back, w] 2628#[L58, L21, L33]don't care [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 2596#[L58, L34, L21]don't care [2023-10-12 17:14:34,878 INFO L750 eck$LassoCheckResult]: Loop: 2596#[L58, L34, L21]don't care [94] L34-->L33: Formula: (and (= v_d_13 (+ v_temp_11 v_d_14)) (= v_temp_11 (select v_queue_15 v_front_21)) (= (+ v_front_21 1) v_front_20) (< v_front_21 v_back_26)) InVars {front=v_front_21, queue=v_queue_15, back=v_back_26, d=v_d_14} OutVars{front=v_front_20, queue=v_queue_15, back=v_back_26, d=v_d_13, temp=v_temp_11} AuxVars[] AssignedVars[front, d, temp] 2598#[L58, L21, L33]don't care [72] L33-->L34: Formula: v_v_assert_4 InVars {v_assert=v_v_assert_4} OutVars{v_assert=v_v_assert_4} AuxVars[] AssignedVars[] 2596#[L58, L34, L21]don't care [2023-10-12 17:14:34,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1369814765, now seen corresponding path program 9 times [2023-10-12 17:14:34,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625289438] [2023-10-12 17:14:34,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,890 INFO L85 PathProgramCache]: Analyzing trace with hash 3947, now seen corresponding path program 9 times [2023-10-12 17:14:34,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560745981] [2023-10-12 17:14:34,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,892 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:34,894 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:34,894 INFO L85 PathProgramCache]: Analyzing trace with hash 2131999575, now seen corresponding path program 10 times [2023-10-12 17:14:34,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:34,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46184919] [2023-10-12 17:14:34,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:34,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:34,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:35,089 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:35,089 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:35,089 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:35,089 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:35,090 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:35,090 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,090 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:35,090 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:35,090 INFO L133 ssoRankerPreferences]: Filename of dumped script: prod-cons.wvr.bpl_BEv2_Iteration10_Lasso [2023-10-12 17:14:35,090 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:35,090 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:35,091 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:35,094 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:35,100 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:35,167 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:35,169 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:35,172 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:35,301 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:35,301 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:35,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:35,303 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:35,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-10-12 17:14:35,306 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:35,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:35,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:35,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:35,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:35,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:35,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:35,328 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:35,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:35,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:35,332 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:35,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-10-12 17:14:35,335 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:35,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:35,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:35,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:35,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:35,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:35,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:35,368 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:35,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:35,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:35,373 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:35,381 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:35,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-10-12 17:14:35,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:35,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:35,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:35,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:35,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:35,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:35,413 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:35,421 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:14:35,421 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:14:35,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:35,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:35,425 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:35,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-10-12 17:14:35,434 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:35,441 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:35,441 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:35,441 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(back, front) = 1*back - 1*front Supporting invariants [] [2023-10-12 17:14:35,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:35,450 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:14:35,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:35,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:35,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:35,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:35,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:35,506 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:35,507 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:14:35,507 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 379 transitions. cyclomatic complexity: 267 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:35,523 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 379 transitions. cyclomatic complexity: 267. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 208 states and 520 transitions. Complement of second has 5 states. [2023-10-12 17:14:35,524 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:35,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:35,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2023-10-12 17:14:35,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:14:35,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:35,524 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:35,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:35,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:35,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:35,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:35,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:35,577 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:35,578 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:14:35,578 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 379 transitions. cyclomatic complexity: 267 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:35,607 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 379 transitions. cyclomatic complexity: 267. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 213 states and 547 transitions. Complement of second has 7 states. [2023-10-12 17:14:35,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:14:35,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:35,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2023-10-12 17:14:35,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:14:35,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:35,609 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:35,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:35,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:35,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:35,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:35,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:35,665 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:35,665 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 2 loop predicates [2023-10-12 17:14:35,665 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 379 transitions. cyclomatic complexity: 267 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:35,689 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 379 transitions. cyclomatic complexity: 267. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 300 states and 706 transitions. Complement of second has 7 states. [2023-10-12 17:14:35,689 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:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2023-10-12 17:14:35,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:14:35,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:35,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:14:35,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:35,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 9 letters. Loop has 4 letters. [2023-10-12 17:14:35,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:35,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 706 transitions. [2023-10-12 17:14:35,696 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:35,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 0 states and 0 transitions. [2023-10-12 17:14:35,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:14:35,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:14:35,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:14:35,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:14:35,696 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:35,696 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:35,696 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:35,696 INFO L337 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-10-12 17:14:35,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:14:35,696 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:35,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:14:35,702 INFO L201 PluginConnector]: Adding new model prod-cons.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:14:35 BoogieIcfgContainer [2023-10-12 17:14:35,702 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:14:35,703 INFO L158 Benchmark]: Toolchain (without parser) took 7223.98ms. Allocated memory was 180.4MB in the beginning and 255.9MB in the end (delta: 75.5MB). Free memory was 134.2MB in the beginning and 108.5MB in the end (delta: 25.7MB). Peak memory consumption was 101.2MB. Max. memory is 8.0GB. [2023-10-12 17:14:35,703 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.29ms. Allocated memory is still 180.4MB. Free memory is still 135.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:14:35,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.80ms. Allocated memory is still 180.4MB. Free memory was 134.2MB in the beginning and 132.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:35,703 INFO L158 Benchmark]: Boogie Preprocessor took 18.96ms. Allocated memory is still 180.4MB. Free memory was 132.7MB in the beginning and 131.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:35,704 INFO L158 Benchmark]: RCFGBuilder took 231.72ms. Allocated memory is still 180.4MB. Free memory was 131.5MB in the beginning and 121.6MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:14:35,704 INFO L158 Benchmark]: BuchiAutomizer took 6944.08ms. Allocated memory was 180.4MB in the beginning and 255.9MB in the end (delta: 75.5MB). Free memory was 121.4MB in the beginning and 108.5MB in the end (delta: 13.0MB). Peak memory consumption was 88.7MB. Max. memory is 8.0GB. [2023-10-12 17:14:35,705 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.29ms. Allocated memory is still 180.4MB. Free memory is still 135.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.80ms. Allocated memory is still 180.4MB. Free memory was 134.2MB in the beginning and 132.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.96ms. Allocated memory is still 180.4MB. Free memory was 132.7MB in the beginning and 131.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 231.72ms. Allocated memory is still 180.4MB. Free memory was 131.5MB in the beginning and 121.6MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 6944.08ms. Allocated memory was 180.4MB in the beginning and 255.9MB in the end (delta: 75.5MB). Free memory was 121.4MB in the beginning and 108.5MB in the end (delta: 13.0MB). Peak memory consumption was 88.7MB. 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 10 terminating modules (2 trivial, 7 deterministic, 1 nondeterministic). One deterministic module has affine ranking function w and consists of 4 locations. One deterministic module has affine ranking function back + -1 * front and consists of 3 locations. One deterministic module has affine ranking function back + -1 * front and consists of 3 locations. One deterministic module has affine ranking function back + -1 * front and consists of 3 locations. One deterministic module has affine ranking function back + -1 * front and consists of 3 locations. One deterministic module has affine ranking function back + -1 * front and consists of 3 locations. One deterministic module has affine ranking function back + -1 * front and consists of 4 locations. One nondeterministic module has affine ranking function back + -1 * front and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 5.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 166 StatesRemovedByMinimization, 7 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 [6, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 145 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 214 IncrementalHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 22 mSDtfsCounter, 214 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital66 mio100 ax100 hnf100 lsp62 ukn94 mio100 lsp61 div100 bol100 ite100 ukn100 eq211 hnf88 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 35 PlacesBefore, 23 PlacesAfterwards, 27 TransitionsBefore, 15 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 13 TotalNumberOfCompositions, 220 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 169, independent: 147, independent conditional: 0, independent unconditional: 147, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 91, independent conditional: 0, independent unconditional: 91, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 89, independent conditional: 0, independent unconditional: 89, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 70, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 169, independent: 56, independent conditional: 0, independent unconditional: 56, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 23, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, 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:35,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:35,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2023-10-12 17:14:36,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:36,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...