/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/inc-subseq.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:13:58,079 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:13:58,130 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:13:58,167 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:13:58,168 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:13:58,168 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:13:58,169 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:13:58,170 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:13:58,170 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:13:58,176 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:13:58,176 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:13:58,177 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:13:58,177 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:13:58,178 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:13:58,179 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:13:58,179 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:13:58,180 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:13:58,180 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:13:58,180 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:13:58,181 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:13:58,182 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:13:58,182 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:13:58,182 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:13:58,182 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:13:58,183 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:13:58,183 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:13:58,183 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:13:58,183 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:13:58,183 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:13:58,184 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:13:58,184 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:13:58,185 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:13:58,185 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:13:58,186 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:13:58,186 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_AUTOMATON [2023-10-12 17:13:58,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:13:58,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:13:58,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:13:58,411 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:13:58,412 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:13:58,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/inc-subseq.wvr.bpl [2023-10-12 17:13:58,413 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/inc-subseq.wvr.bpl' [2023-10-12 17:13:58,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:13:58,440 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:13:58,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:58,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:13:58,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:13:58,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:58" (1/1) ... [2023-10-12 17:13:58,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:58" (1/1) ... [2023-10-12 17:13:58,475 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:13:58,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:13:58,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:13:58,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:13:58,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:13:58,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:58" (1/1) ... [2023-10-12 17:13:58,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:58" (1/1) ... [2023-10-12 17:13:58,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:58" (1/1) ... [2023-10-12 17:13:58,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:58" (1/1) ... [2023-10-12 17:13:58,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:58" (1/1) ... [2023-10-12 17:13:58,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:58" (1/1) ... [2023-10-12 17:13:58,496 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:58" (1/1) ... [2023-10-12 17:13:58,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:58" (1/1) ... [2023-10-12 17:13:58,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:13:58,500 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:13:58,500 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:13:58,500 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:13:58,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:58" (1/1) ... [2023-10-12 17:13:58,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:13:58,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:13:58,530 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:13:58,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-10-12 17:13:58,614 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:13:58,614 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:13:58,614 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:13:58,615 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:13:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:13:58,615 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:13:58,615 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:13:58,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:13:58,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:13:58,616 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:13:58,668 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:13:58,670 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:13:58,773 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:13:58,788 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:13:58,788 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:13:58,790 INFO L201 PluginConnector]: Adding new model inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:58 BoogieIcfgContainer [2023-10-12 17:13:58,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:13:58,791 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:13:58,791 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:13:58,794 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:13:58,795 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:58,795 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:13:58" (1/2) ... [2023-10-12 17:13:58,796 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ce359d7 and model type inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:13:58, skipping insertion in model container [2023-10-12 17:13:58,797 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:13:58,797 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:13:58" (2/2) ... [2023-10-12 17:13:58,798 INFO L332 chiAutomizerObserver]: Analyzing ICFG inc-subseq.wvr.bpl [2023-10-12 17:13:58,846 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:13:58,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 76 flow [2023-10-12 17:13:58,919 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:13:58,919 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:13:58,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 3/26 cut-off events. For 2/2 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/22 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2023-10-12 17:13:58,941 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 76 flow [2023-10-12 17:13:58,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 64 flow [2023-10-12 17:13:58,958 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:13:58,972 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 64 flow [2023-10-12 17:13:58,975 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 64 flow [2023-10-12 17:13:58,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 64 flow [2023-10-12 17:13:58,984 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:13:58,984 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:13:58,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 3/26 cut-off events. For 2/2 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/22 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2023-10-12 17:13:58,985 INFO L119 LiptonReduction]: Number of co-enabled transitions 124 [2023-10-12 17:13:59,538 INFO L134 LiptonReduction]: Checked pairs total: 166 [2023-10-12 17:13:59,538 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-10-12 17:13:59,558 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:13:59,558 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:13:59,558 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:13:59,558 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:13:59,559 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:13:59,559 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:13:59,559 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:13:59,560 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:13:59,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:13:59,601 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2023-10-12 17:13:59,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:59,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:59,607 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:13:59,607 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:59,608 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:13:59,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 19 states, but on-demand construction may add more states [2023-10-12 17:13:59,613 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 12 [2023-10-12 17:13:59,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:13:59,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:13:59,614 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-10-12 17:13:59,614 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:13:59,619 INFO L748 eck$LassoCheckResult]: Stem: 35#[$Ultimate##0]don't care [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 38#[L57]don't care [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 40#[L23, L57-1]don't care [2023-10-12 17:13:59,619 INFO L750 eck$LassoCheckResult]: Loop: 40#[L23, L57-1]don't care [100] L23-->L23: Formula: (and (= v_i_50 (+ v_i_51 1)) (< (select v_A_30 v_i_51) v_last_19) (< v_i_51 v_N_19)) InVars {A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_51} OutVars{A=v_A_30, N=v_N_19, last=v_last_19, i=v_i_50} AuxVars[] AssignedVars[i] 40#[L23, L57-1]don't care [2023-10-12 17:13:59,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:59,625 INFO L85 PathProgramCache]: Analyzing trace with hash 4272, now seen corresponding path program 1 times [2023-10-12 17:13:59,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:59,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280016092] [2023-10-12 17:13:59,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:59,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:59,692 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:59,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:59,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:59,714 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 1 times [2023-10-12 17:13:59,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:59,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084058016] [2023-10-12 17:13:59,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:59,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:59,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:13:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:13:59,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:13:59,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:13:59,739 INFO L85 PathProgramCache]: Analyzing trace with hash 132532, now seen corresponding path program 1 times [2023-10-12 17:13:59,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:13:59,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995612005] [2023-10-12 17:13:59,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:13:59,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:13:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:13:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:13:59,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:13:59,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995612005] [2023-10-12 17:13:59,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995612005] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:13:59,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:13:59,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:13:59,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340703590] [2023-10-12 17:13:59,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:13:59,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:13:59,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:13:59,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:13:59,929 INFO L87 Difference]: Start difference. First operand currently 19 states, but on-demand construction may add more states Second operand has 3 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:13:59,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:13:59,973 INFO L93 Difference]: Finished difference Result 36 states and 70 transitions. [2023-10-12 17:13:59,975 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 70 transitions. [2023-10-12 17:13:59,977 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 20 [2023-10-12 17:13:59,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 28 states and 58 transitions. [2023-10-12 17:13:59,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-10-12 17:13:59,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-10-12 17:13:59,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 58 transitions. [2023-10-12 17:13:59,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:13:59,990 INFO L219 hiAutomatonCegarLoop]: Abstraction has 28 states and 58 transitions. [2023-10-12 17:14:00,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 58 transitions. [2023-10-12 17:14:00,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2023-10-12 17:14:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 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:00,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 43 transitions. [2023-10-12 17:14:00,021 INFO L241 hiAutomatonCegarLoop]: Abstraction has 19 states and 43 transitions. [2023-10-12 17:14:00,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:14:00,025 INFO L430 stractBuchiCegarLoop]: Abstraction has 19 states and 43 transitions. [2023-10-12 17:14:00,026 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:14:00,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 43 transitions. [2023-10-12 17:14:00,029 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 14 [2023-10-12 17:14:00,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:00,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:00,029 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:00,029 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:00,030 INFO L748 eck$LassoCheckResult]: Stem: 154#[$Ultimate##0]don't care [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 156#[L57]don't care [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 136#[L23, L57-1]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 138#[L25-1, L57-1]don't care [2023-10-12 17:14:00,030 INFO L750 eck$LassoCheckResult]: Loop: 138#[L25-1, L57-1]don't care [94] L25-1-->L23: Formula: (and (= v_i_34 (+ v_i_35 1)) (= (select v_A_20 v_i_35) v_last_11)) InVars {A=v_A_20, i=v_i_35} OutVars{A=v_A_20, last=v_last_11, i=v_i_34} AuxVars[] AssignedVars[last, i] 148#[L23, L57-1]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 138#[L25-1, L57-1]don't care [2023-10-12 17:14:00,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:00,030 INFO L85 PathProgramCache]: Analyzing trace with hash 132531, now seen corresponding path program 1 times [2023-10-12 17:14:00,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:00,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031857209] [2023-10-12 17:14:00,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:00,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:00,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:00,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:00,046 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:00,046 INFO L85 PathProgramCache]: Analyzing trace with hash 3974, now seen corresponding path program 1 times [2023-10-12 17:14:00,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:00,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685621426] [2023-10-12 17:14:00,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:00,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:00,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:00,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:00,058 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:00,058 INFO L85 PathProgramCache]: Analyzing trace with hash 127365304, now seen corresponding path program 1 times [2023-10-12 17:14:00,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:00,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846191159] [2023-10-12 17:14:00,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:00,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:00,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:00,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:00,219 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:00,222 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:00,222 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:00,222 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:00,222 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:00,222 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:00,222 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:00,223 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:00,223 INFO L133 ssoRankerPreferences]: Filename of dumped script: inc-subseq.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:14:00,223 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:00,223 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:00,237 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:00,280 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:00,284 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:00,384 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:00,388 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:00,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:00,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:00,397 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:00,398 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:00,401 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:00,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:00,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:00,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:00,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:00,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:00,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:00,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:00,451 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:00,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:00,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:00,455 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:00,465 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:00,466 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:00,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:00,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:00,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:00,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:00,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:00,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:00,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:00,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:00,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:00,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:00,507 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:00,516 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:00,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:00,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:00,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:00,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:00,527 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:00,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:00,533 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:00,545 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:00,567 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:14:00,567 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:14:00,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:00,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:00,573 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:00,576 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:00,620 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:00,639 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:00,639 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:00,640 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:14:00,646 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:00,649 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:00,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:00,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:00,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:00,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:00,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:00,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:14:00,725 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:00,726 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 43 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:00,816 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 43 transitions. cyclomatic complexity: 30. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 77 states and 188 transitions. Complement of second has 6 states. [2023-10-12 17:14:00,817 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:00,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2023-10-12 17:14:00,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:14:00,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:00,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:14:00,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:00,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 34 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:14:00,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:00,821 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 188 transitions. [2023-10-12 17:14:00,831 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 20 [2023-10-12 17:14:00,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 54 states and 133 transitions. [2023-10-12 17:14:00,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2023-10-12 17:14:00,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2023-10-12 17:14:00,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 133 transitions. [2023-10-12 17:14:00,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:00,835 INFO L219 hiAutomatonCegarLoop]: Abstraction has 54 states and 133 transitions. [2023-10-12 17:14:00,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 133 transitions. [2023-10-12 17:14:00,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 35. [2023-10-12 17:14:00,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.8285714285714287) internal successors, (99), 34 states have internal predecessors, (99), 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:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 99 transitions. [2023-10-12 17:14:00,844 INFO L241 hiAutomatonCegarLoop]: Abstraction has 35 states and 99 transitions. [2023-10-12 17:14:00,844 INFO L430 stractBuchiCegarLoop]: Abstraction has 35 states and 99 transitions. [2023-10-12 17:14:00,844 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:14:00,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 99 transitions. [2023-10-12 17:14:00,846 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2023-10-12 17:14:00,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:00,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:00,847 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:14:00,847 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:00,847 INFO L748 eck$LassoCheckResult]: Stem: 318#[$Ultimate##0]don't care [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 320#[L57]don't care [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 322#[L23, L57-1]don't care [84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 326#[L23, L39, L58]don't care [2023-10-12 17:14:00,847 INFO L750 eck$LassoCheckResult]: Loop: 326#[L23, L39, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 334#[L23, L40, L58]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 326#[L23, L39, L58]don't care [2023-10-12 17:14:00,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:00,848 INFO L85 PathProgramCache]: Analyzing trace with hash 132516, now seen corresponding path program 1 times [2023-10-12 17:14:00,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:00,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204281018] [2023-10-12 17:14:00,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:00,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:00,860 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:00,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:00,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:00,870 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 1 times [2023-10-12 17:14:00,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:00,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714667446] [2023-10-12 17:14:00,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:00,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:00,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:00,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:00,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:00,886 INFO L85 PathProgramCache]: Analyzing trace with hash 127350366, now seen corresponding path program 1 times [2023-10-12 17:14:00,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:00,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660999629] [2023-10-12 17:14:00,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:00,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:00,930 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:00,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:00,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660999629] [2023-10-12 17:14:00,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660999629] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:00,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:14:00,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:14:00,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976717423] [2023-10-12 17:14:00,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:01,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:01,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:14:01,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:14:01,051 INFO L87 Difference]: Start difference. First operand 35 states and 99 transitions. cyclomatic complexity: 72 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:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:01,070 INFO L93 Difference]: Finished difference Result 40 states and 103 transitions. [2023-10-12 17:14:01,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 103 transitions. [2023-10-12 17:14:01,075 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:14:01,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 95 transitions. [2023-10-12 17:14:01,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2023-10-12 17:14:01,084 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2023-10-12 17:14:01,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 95 transitions. [2023-10-12 17:14:01,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:01,084 INFO L219 hiAutomatonCegarLoop]: Abstraction has 35 states and 95 transitions. [2023-10-12 17:14:01,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 95 transitions. [2023-10-12 17:14:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-10-12 17:14:01,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.7142857142857144) internal successors, (95), 34 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:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 95 transitions. [2023-10-12 17:14:01,087 INFO L241 hiAutomatonCegarLoop]: Abstraction has 35 states and 95 transitions. [2023-10-12 17:14:01,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:14:01,091 INFO L430 stractBuchiCegarLoop]: Abstraction has 35 states and 95 transitions. [2023-10-12 17:14:01,091 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:14:01,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 95 transitions. [2023-10-12 17:14:01,097 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:14:01,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:01,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:01,097 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:14:01,097 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:01,098 INFO L748 eck$LassoCheckResult]: Stem: 446#[$Ultimate##0]don't care [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 448#[L57]don't care [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 408#[L23, L57-1]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 410#[L25-1, L57-1]don't care [84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 426#[L39, L25-1, L58]don't care [2023-10-12 17:14:01,098 INFO L750 eck$LassoCheckResult]: Loop: 426#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 438#[L40, L25-1, L58]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 426#[L39, L25-1, L58]don't care [2023-10-12 17:14:01,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:01,099 INFO L85 PathProgramCache]: Analyzing trace with hash 4108545, now seen corresponding path program 1 times [2023-10-12 17:14:01,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:01,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079182386] [2023-10-12 17:14:01,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:01,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:01,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:01,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:01,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:01,124 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 2 times [2023-10-12 17:14:01,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:01,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512708811] [2023-10-12 17:14:01,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:01,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:01,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:01,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:01,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:01,137 INFO L85 PathProgramCache]: Analyzing trace with hash -346653061, now seen corresponding path program 1 times [2023-10-12 17:14:01,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:01,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327999820] [2023-10-12 17:14:01,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:01,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:01,157 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:01,176 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:01,331 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:01,332 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:01,332 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:01,332 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:01,332 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:01,332 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:01,332 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:01,332 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:01,332 INFO L133 ssoRankerPreferences]: Filename of dumped script: inc-subseq.wvr.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:14:01,332 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:01,332 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:01,335 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:01,337 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:01,340 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:01,343 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:01,389 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:01,419 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:01,422 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:01,605 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:01,606 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:01,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:01,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:01,610 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:01,618 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:01,624 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:01,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:01,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:01,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:01,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:01,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:01,628 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:01,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:01,649 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:01,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:01,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:01,651 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:01,660 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:01,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:01,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:01,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:01,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:01,669 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:01,670 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:01,670 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:01,689 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:01,695 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:01,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:01,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:01,697 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:01,707 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:01,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:01,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:01,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:01,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:01,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:01,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:01,720 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:01,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:01,737 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:01,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:01,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:01,740 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:01,750 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:01,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:01,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:01,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:01,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:01,761 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:01,763 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:01,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:01,785 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:01,794 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:01,794 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:14:01,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:01,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:01,799 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:01,803 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:01,806 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:01,824 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:01,824 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:01,824 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(start, end) = -1*start + 1*end Supporting invariants [] [2023-10-12 17:14:01,831 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:01,833 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:01,843 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:01,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:01,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:01,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:01,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:01,867 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:01,868 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:01,868 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 95 transitions. cyclomatic complexity: 67 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:01,901 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 95 transitions. cyclomatic complexity: 67. 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 86 states and 219 transitions. Complement of second has 5 states. [2023-10-12 17:14:01,902 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:01,903 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:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2023-10-12 17:14:01,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:14:01,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:01,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:14:01,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:01,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:14:01,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:01,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 219 transitions. [2023-10-12 17:14:01,906 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:14:01,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 54 states and 140 transitions. [2023-10-12 17:14:01,909 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2023-10-12 17:14:01,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2023-10-12 17:14:01,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 140 transitions. [2023-10-12 17:14:01,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:01,909 INFO L219 hiAutomatonCegarLoop]: Abstraction has 54 states and 140 transitions. [2023-10-12 17:14:01,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 140 transitions. [2023-10-12 17:14:01,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2023-10-12 17:14:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.62) internal successors, (131), 49 states have internal predecessors, (131), 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:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 131 transitions. [2023-10-12 17:14:01,921 INFO L241 hiAutomatonCegarLoop]: Abstraction has 50 states and 131 transitions. [2023-10-12 17:14:01,921 INFO L430 stractBuchiCegarLoop]: Abstraction has 50 states and 131 transitions. [2023-10-12 17:14:01,921 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:14:01,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 131 transitions. [2023-10-12 17:14:01,923 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:14:01,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:01,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:01,924 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:14:01,924 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:01,924 INFO L748 eck$LassoCheckResult]: Stem: 627#[$Ultimate##0]don't care [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 629#[L57]don't care [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 597#[L23, L57-1]don't care [84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 601#[L23, L39, L58]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 657#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 609#[L40, L25-1, L58]don't care [2023-10-12 17:14:01,924 INFO L750 eck$LassoCheckResult]: Loop: 609#[L40, L25-1, L58]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 585#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 609#[L40, L25-1, L58]don't care [2023-10-12 17:14:01,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:01,925 INFO L85 PathProgramCache]: Analyzing trace with hash 127351022, now seen corresponding path program 1 times [2023-10-12 17:14:01,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:01,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530951901] [2023-10-12 17:14:01,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:01,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:01,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:01,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:01,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:01,955 INFO L85 PathProgramCache]: Analyzing trace with hash 4231, now seen corresponding path program 3 times [2023-10-12 17:14:01,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:01,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663516400] [2023-10-12 17:14:01,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:01,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:01,963 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:01,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:01,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:01,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2125251124, now seen corresponding path program 2 times [2023-10-12 17:14:01,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:01,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569308764] [2023-10-12 17:14:01,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:01,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:01,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:02,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:02,184 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:02,185 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:02,185 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:02,185 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:02,185 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:02,185 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:02,185 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:02,185 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:02,185 INFO L133 ssoRankerPreferences]: Filename of dumped script: inc-subseq.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:14:02,185 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:02,185 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:02,188 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:02,191 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:02,194 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:02,198 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:02,460 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:02,460 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:02,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:02,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:02,462 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:02,472 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:02,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:02,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:02,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:02,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:02,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:02,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:02,484 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:02,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:02,501 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:02,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:02,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:02,503 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:02,511 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:02,512 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:02,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:02,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:02,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:02,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:02,522 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:02,522 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:02,532 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:02,540 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:02,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:02,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:02,542 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:02,549 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:02,594 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:02,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:02,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:02,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:02,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:02,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:02,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:02,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:02,612 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:02,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:02,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:02,613 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:02,614 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:02,616 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:02,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:02,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:02,623 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:14:02,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:02,646 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:14:02,646 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:14:02,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:02,693 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:02,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:02,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:02,695 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:02,697 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:02,698 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:02,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:02,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:02,705 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:14:02,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:02,713 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:14:02,713 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:14:02,736 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:02,759 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:14:02,760 INFO L444 ModelExtractionUtils]: 14 out of 26 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:14:02,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:02,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:02,878 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:02,879 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:02,881 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:02,889 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2023-10-12 17:14:02,890 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:02,890 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(start, end) = -1*start + 1*end Supporting invariants [] [2023-10-12 17:14:02,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-10-12 17:14:02,901 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:14:02,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:02,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:02,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:02,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:02,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:02,947 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:02,948 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:02,948 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 131 transitions. cyclomatic complexity: 94 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:02,979 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 131 transitions. cyclomatic complexity: 94. 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 151 states and 382 transitions. Complement of second has 5 states. [2023-10-12 17:14:02,980 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:02,982 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:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2023-10-12 17:14:02,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:14:02,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:02,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:14:02,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:02,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:14:02,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:02,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 382 transitions. [2023-10-12 17:14:02,987 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:14:02,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 101 states and 260 transitions. [2023-10-12 17:14:02,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2023-10-12 17:14:02,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-10-12 17:14:02,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 260 transitions. [2023-10-12 17:14:02,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:02,992 INFO L219 hiAutomatonCegarLoop]: Abstraction has 101 states and 260 transitions. [2023-10-12 17:14:02,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states and 260 transitions. [2023-10-12 17:14:03,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 62. [2023-10-12 17:14:03,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.774193548387097) internal successors, (172), 61 states have internal predecessors, (172), 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:03,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 172 transitions. [2023-10-12 17:14:03,005 INFO L241 hiAutomatonCegarLoop]: Abstraction has 62 states and 172 transitions. [2023-10-12 17:14:03,005 INFO L430 stractBuchiCegarLoop]: Abstraction has 62 states and 172 transitions. [2023-10-12 17:14:03,005 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:14:03,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 172 transitions. [2023-10-12 17:14:03,007 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:14:03,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:03,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:03,008 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:14:03,008 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:03,008 INFO L748 eck$LassoCheckResult]: Stem: 923#[$Ultimate##0]don't care [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 925#[L57]don't care [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 905#[L23, L57-1]don't care [84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 909#[L23, L39, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 973#[L23, L40, L58]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 959#[L40, L25-1, L58]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 891#[L39, L25-1, L58]don't care [2023-10-12 17:14:03,009 INFO L750 eck$LassoCheckResult]: Loop: 891#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 893#[L40, L25-1, L58]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 891#[L39, L25-1, L58]don't care [2023-10-12 17:14:03,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:03,009 INFO L85 PathProgramCache]: Analyzing trace with hash -347105971, now seen corresponding path program 3 times [2023-10-12 17:14:03,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:03,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895566406] [2023-10-12 17:14:03,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:03,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:03,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:03,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:03,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:03,044 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 4 times [2023-10-12 17:14:03,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:03,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794253079] [2023-10-12 17:14:03,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:03,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:03,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:03,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:03,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:03,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1438613447, now seen corresponding path program 4 times [2023-10-12 17:14:03,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:03,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294617366] [2023-10-12 17:14:03,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:03,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:03,111 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:03,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:14:03,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294617366] [2023-10-12 17:14:03,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294617366] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:14:03,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647288558] [2023-10-12 17:14:03,112 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-10-12 17:14:03,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:14:03,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:03,113 INFO L229 MonitoredProcess]: Starting monitored process 17 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:03,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-10-12 17:14:03,150 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-10-12 17:14:03,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:14:03,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:03,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:03,167 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:03,167 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:14:03,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647288558] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:14:03,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:14:03,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2023-10-12 17:14:03,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827249673] [2023-10-12 17:14:03,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:14:03,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:14:03,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:14:03,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:14:03,267 INFO L87 Difference]: Start difference. First operand 62 states and 172 transitions. cyclomatic complexity: 125 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:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:14:03,307 INFO L93 Difference]: Finished difference Result 146 states and 383 transitions. [2023-10-12 17:14:03,307 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 383 transitions. [2023-10-12 17:14:03,309 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:14:03,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 115 states and 309 transitions. [2023-10-12 17:14:03,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-10-12 17:14:03,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-10-12 17:14:03,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 309 transitions. [2023-10-12 17:14:03,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:03,310 INFO L219 hiAutomatonCegarLoop]: Abstraction has 115 states and 309 transitions. [2023-10-12 17:14:03,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 309 transitions. [2023-10-12 17:14:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2023-10-12 17:14:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 2.840909090909091) internal successors, (250), 87 states have internal predecessors, (250), 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:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 250 transitions. [2023-10-12 17:14:03,326 INFO L241 hiAutomatonCegarLoop]: Abstraction has 88 states and 250 transitions. [2023-10-12 17:14:03,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:14:03,328 INFO L430 stractBuchiCegarLoop]: Abstraction has 88 states and 250 transitions. [2023-10-12 17:14:03,328 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:14:03,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 250 transitions. [2023-10-12 17:14:03,329 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:14:03,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:03,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:03,329 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2023-10-12 17:14:03,330 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:03,331 INFO L748 eck$LassoCheckResult]: Stem: 1218#[$Ultimate##0]don't care [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 1220#[L57]don't care [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 1200#[L23, L57-1]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 1202#[L25-1, L57-1]don't care [84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 1228#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 1324#[L40, L25-1, L58]don't care [94] L25-1-->L23: Formula: (and (= v_i_34 (+ v_i_35 1)) (= (select v_A_20 v_i_35) v_last_11)) InVars {A=v_A_20, i=v_i_35} OutVars{A=v_A_20, last=v_last_11, i=v_i_34} AuxVars[] AssignedVars[last, i] 1274#[L23, L40, L58]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 1256#[L40, L25-1, L58]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 1188#[L39, L25-1, L58]don't care [2023-10-12 17:14:03,331 INFO L750 eck$LassoCheckResult]: Loop: 1188#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 1190#[L40, L25-1, L58]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 1188#[L39, L25-1, L58]don't care [2023-10-12 17:14:03,331 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:03,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1873851990, now seen corresponding path program 1 times [2023-10-12 17:14:03,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:03,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911379331] [2023-10-12 17:14:03,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:03,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:03,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:03,344 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:03,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:03,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:03,358 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 5 times [2023-10-12 17:14:03,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:03,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447327096] [2023-10-12 17:14:03,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:03,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:03,362 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:03,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:03,369 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:03,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1180467856, now seen corresponding path program 2 times [2023-10-12 17:14:03,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:03,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130685495] [2023-10-12 17:14:03,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:03,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:03,419 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:03,426 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:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:03,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:03,439 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:03,704 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:03,704 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:03,704 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:03,704 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:03,704 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:03,704 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:03,704 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:03,704 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:03,704 INFO L133 ssoRankerPreferences]: Filename of dumped script: inc-subseq.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:14:03,704 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:03,704 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:03,710 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:03,713 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:03,815 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:03,817 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:03,819 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:03,824 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:04,062 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:04,063 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:04,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:04,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:04,064 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:04,074 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:04,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:04,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:04,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:04,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:04,084 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:04,084 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:04,087 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:04,092 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:04,099 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:04,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:04,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:04,100 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:04,111 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:04,113 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:04,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:04,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:04,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:04,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:04,131 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:04,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:04,145 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:04,155 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:14:04,155 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:14:04,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:04,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:04,157 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:04,168 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:04,176 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:04,190 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:14:04,190 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:04,190 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2023-10-12 17:14:04,197 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:04,200 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:14:04,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:04,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:04,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:04,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:04,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:04,246 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:04,246 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:04,246 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 250 transitions. cyclomatic complexity: 182 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:04,281 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 250 transitions. cyclomatic complexity: 182. 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 192 states and 492 transitions. Complement of second has 5 states. [2023-10-12 17:14:04,282 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:04,283 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:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2023-10-12 17:14:04,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:14:04,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:04,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:14:04,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:04,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:14:04,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:04,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 492 transitions. [2023-10-12 17:14:04,286 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:14:04,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 137 states and 359 transitions. [2023-10-12 17:14:04,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2023-10-12 17:14:04,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-10-12 17:14:04,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 359 transitions. [2023-10-12 17:14:04,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:14:04,288 INFO L219 hiAutomatonCegarLoop]: Abstraction has 137 states and 359 transitions. [2023-10-12 17:14:04,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 359 transitions. [2023-10-12 17:14:04,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 88. [2023-10-12 17:14:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 2.75) internal successors, (242), 87 states have internal predecessors, (242), 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:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 242 transitions. [2023-10-12 17:14:04,301 INFO L241 hiAutomatonCegarLoop]: Abstraction has 88 states and 242 transitions. [2023-10-12 17:14:04,301 INFO L430 stractBuchiCegarLoop]: Abstraction has 88 states and 242 transitions. [2023-10-12 17:14:04,301 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:14:04,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 242 transitions. [2023-10-12 17:14:04,302 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2023-10-12 17:14:04,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:14:04,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:14:04,303 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2023-10-12 17:14:04,303 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2023-10-12 17:14:04,304 INFO L748 eck$LassoCheckResult]: Stem: 1637#[$Ultimate##0]don't care [104] $Ultimate##0-->L57: Formula: (and (= v_last_37 v_v_old_22) (= (select v_A_48 0) v_v_old_22) (= v_i_76 0) v_ok_29 (= v_start_64 v_end_78)) InVars {A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} OutVars{A=v_A_48, start=v_start_64, ok=v_ok_29, last=v_last_37, i=v_i_76, v_old=v_v_old_22, end=v_end_78} AuxVars[] AssignedVars[] 1639#[L57]don't care [87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0] 1609#[L23, L57-1]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 1611#[L25-1, L57-1]don't care [84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0] 1649#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 1657#[L40, L25-1, L58]don't care [94] L25-1-->L23: Formula: (and (= v_i_34 (+ v_i_35 1)) (= (select v_A_20 v_i_35) v_last_11)) InVars {A=v_A_20, i=v_i_35} OutVars{A=v_A_20, last=v_last_11, i=v_i_34} AuxVars[] AssignedVars[last, i] 1645#[L23, L40, L58]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 1647#[L40, L25-1, L58]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 1721#[L39, L25-1, L58]don't care [94] L25-1-->L23: Formula: (and (= v_i_34 (+ v_i_35 1)) (= (select v_A_20 v_i_35) v_last_11)) InVars {A=v_A_20, i=v_i_35} OutVars{A=v_A_20, last=v_last_11, i=v_i_34} AuxVars[] AssignedVars[last, i] 1683#[L23, L39, L58]don't care [99] L23-->L25-1: Formula: (let ((.cse0 (select v_A_28 v_i_48))) (and (= (+ v_end_49 1) v_end_48) (< v_i_48 v_N_17) (= (select v_queue_23 v_end_49) .cse0) (<= v_last_17 .cse0))) InVars {A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_49} OutVars{A=v_A_28, N=v_N_17, queue=v_queue_23, last=v_last_17, i=v_i_48, end=v_end_48} AuxVars[] AssignedVars[end] 1679#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 1627#[L40, L25-1, L58]don't care [2023-10-12 17:14:04,304 INFO L750 eck$LassoCheckResult]: Loop: 1627#[L40, L25-1, L58]don't care [103] L40-->L39: Formula: (and (= v_new_18 (select v_queue_29 v_start_49)) (< v_start_49 v_end_62) (= v_start_48 (+ v_start_49 1)) (= v_v_old_14 v_new_18) (or (and (<= v_v_old_15 v_new_18) v_ok_22 v_ok_21) (and (not v_ok_21) (or (< v_new_18 v_v_old_15) (not v_ok_22))))) InVars {start=v_start_49, ok=v_ok_22, queue=v_queue_29, v_old=v_v_old_15, end=v_end_62} OutVars{new=v_new_18, start=v_start_48, ok=v_ok_21, queue=v_queue_29, v_old=v_v_old_14, end=v_end_62} AuxVars[] AssignedVars[new, start, ok, v_old] 1625#[L39, L25-1, L58]don't care [77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[] 1627#[L40, L25-1, L58]don't care [2023-10-12 17:14:04,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2060185838, now seen corresponding path program 3 times [2023-10-12 17:14:04,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:04,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243164849] [2023-10-12 17:14:04,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:04,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:04,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:04,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:04,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:04,333 INFO L85 PathProgramCache]: Analyzing trace with hash 4231, now seen corresponding path program 6 times [2023-10-12 17:14:04,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:04,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736373494] [2023-10-12 17:14:04,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:04,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:04,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:04,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:04,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:04,338 INFO L85 PathProgramCache]: Analyzing trace with hash 141336408, now seen corresponding path program 4 times [2023-10-12 17:14:04,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:14:04,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806249528] [2023-10-12 17:14:04,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:14:04,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:14:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:04,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:14:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:14:04,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:14:04,651 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:14:04,652 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:14:04,652 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:14:04,652 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:14:04,652 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:14:04,652 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:04,652 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:14:04,652 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:14:04,652 INFO L133 ssoRankerPreferences]: Filename of dumped script: inc-subseq.wvr.bpl_BEv2_Iteration8_Lasso [2023-10-12 17:14:04,652 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:14:04,652 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:14:04,655 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:04,657 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:04,819 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:04,820 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:04,824 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:14:05,077 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:14:05,077 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:14:05,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:05,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:05,081 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:14:05,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:14:05,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:14:05,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:05,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:05,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:14:05,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:05,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:14:05,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:14:05,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:14:05,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:05,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:05,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:05,101 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:05,103 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:05,104 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:05,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:14:05,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:14:05,110 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:14:05,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:14:05,117 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:14:05,117 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:14:05,135 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:14:05,146 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:14:05,146 INFO L444 ModelExtractionUtils]: 16 out of 26 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:14:05,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:14:05,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:14:05,149 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:05,151 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:05,153 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:14:05,160 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2023-10-12 17:14:05,160 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:14:05,160 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2023-10-12 17:14:05,163 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:05,169 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:14:05,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:05,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:05,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:05,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:05,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:05,231 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:05,232 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:05,232 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 242 transitions. cyclomatic complexity: 177 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:05,249 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 242 transitions. cyclomatic complexity: 177. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 148 states and 393 transitions. Complement of second has 5 states. [2023-10-12 17:14:05,250 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:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2023-10-12 17:14:05,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:14:05,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:05,252 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:05,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:05,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:05,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:05,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:05,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:05,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:05,302 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:05,303 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:05,303 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 242 transitions. cyclomatic complexity: 177 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:05,340 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 242 transitions. cyclomatic complexity: 177. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 234 states and 615 transitions. Complement of second has 7 states. [2023-10-12 17:14:05,342 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:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:05,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2023-10-12 17:14:05,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:14:05,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:05,342 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:14:05,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:14:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:05,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:14:05,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:14:05,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:14:05,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:14:05,393 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:05,393 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:05,393 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 242 transitions. cyclomatic complexity: 177 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:05,418 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 242 transitions. cyclomatic complexity: 177. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 222 states and 558 transitions. Complement of second has 7 states. [2023-10-12 17:14:05,419 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:05,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:14:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2023-10-12 17:14:05,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:14:05,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:05,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 13 letters. Loop has 2 letters. [2023-10-12 17:14:05,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:05,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 11 letters. Loop has 4 letters. [2023-10-12 17:14:05,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:14:05,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 558 transitions. [2023-10-12 17:14:05,423 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:05,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 0 states and 0 transitions. [2023-10-12 17:14:05,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:14:05,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:14:05,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:14:05,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:14:05,423 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:05,423 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:05,423 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:14:05,423 INFO L337 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-10-12 17:14:05,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:14:05,424 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:14:05,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:14:05,429 INFO L201 PluginConnector]: Adding new model inc-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:14:05 BoogieIcfgContainer [2023-10-12 17:14:05,429 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:14:05,429 INFO L158 Benchmark]: Toolchain (without parser) took 6988.92ms. Allocated memory was 184.5MB in the beginning and 250.6MB in the end (delta: 66.1MB). Free memory was 138.0MB in the beginning and 166.8MB in the end (delta: -28.7MB). Peak memory consumption was 38.4MB. Max. memory is 8.0GB. [2023-10-12 17:14:05,430 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 184.5MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:14:05,430 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.34ms. Allocated memory is still 184.5MB. Free memory was 138.0MB in the beginning and 136.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:05,430 INFO L158 Benchmark]: Boogie Preprocessor took 19.43ms. Allocated memory is still 184.5MB. Free memory was 136.5MB in the beginning and 135.5MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:14:05,430 INFO L158 Benchmark]: RCFGBuilder took 290.65ms. Allocated memory is still 184.5MB. Free memory was 135.3MB in the beginning and 125.2MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-10-12 17:14:05,430 INFO L158 Benchmark]: BuchiAutomizer took 6637.83ms. Allocated memory was 184.5MB in the beginning and 250.6MB in the end (delta: 66.1MB). Free memory was 125.2MB in the beginning and 166.8MB in the end (delta: -41.5MB). Peak memory consumption was 26.9MB. Max. memory is 8.0GB. [2023-10-12 17:14:05,431 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.25ms. Allocated memory is still 184.5MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.34ms. Allocated memory is still 184.5MB. Free memory was 138.0MB in the beginning and 136.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.43ms. Allocated memory is still 184.5MB. Free memory was 136.5MB in the beginning and 135.5MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 290.65ms. Allocated memory is still 184.5MB. Free memory was 135.3MB in the beginning and 125.2MB in the end (delta: 10.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 6637.83ms. Allocated memory was 184.5MB in the beginning and 250.6MB in the end (delta: 66.1MB). Free memory was 125.2MB in the beginning and 166.8MB in the end (delta: -41.5MB). Peak memory consumption was 26.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function end + -1 * start and consists of 3 locations. One deterministic module has affine ranking function end + -1 * start and consists of 3 locations. One deterministic module has affine ranking function end + -1 * start and consists of 3 locations. One nondeterministic module has affine ranking function end + -1 * start and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 9 iterations. TraceHistogramMax:3. Analysis of lassos took 4.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 242 IncrementalHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 6 mSDtfsCounter, 242 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital91 mio100 ax100 hnf100 lsp96 ukn79 mio100 lsp61 div100 bol116 ite100 ukn100 eq167 hnf90 smp100 dnf186 smp70 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 75ms VariablesStem: 6 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.6s - 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.6s, 30 PlacesBefore, 18 PlacesAfterwards, 26 TransitionsBefore, 14 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 3 FixpointIterations, 6 TrivialSequentialCompositions, 7 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 15 TotalNumberOfCompositions, 166 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 135, independent: 121, independent conditional: 0, independent unconditional: 121, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 93, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 93, independent: 78, independent conditional: 0, independent unconditional: 78, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 68, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 135, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 93, unknown conditional: 0, unknown unconditional: 93] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 15, Positive conditional cache size: 0, Positive unconditional cache size: 15, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, 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:05,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:14:05,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-10-12 17:14:05,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...