/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_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/inc-subseq-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:26:59,990 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:27:00,046 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:27:00,077 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:27:00,077 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:27:00,078 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:27:00,079 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:27:00,079 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:27:00,079 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:27:00,082 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:27:00,082 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:27:00,082 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:27:00,082 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:27:00,083 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:27:00,084 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:27:00,084 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:27:00,084 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:27:00,084 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:27:00,084 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:27:00,084 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:27:00,085 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:27:00,085 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:27:00,086 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:27:00,086 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:27:00,086 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:27:00,086 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:27:00,086 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:27:00,086 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:27:00,087 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:27:00,087 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:27:00,087 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:27:00,088 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:27:00,088 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:27:00,089 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:27:00,089 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_PETRI_NET [2023-10-12 17:27:00,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:27:00,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:27:00,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:27:00,265 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:27:00,265 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:27:00,266 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-array.wvr.bpl [2023-10-12 17:27:00,267 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/inc-subseq-array.wvr.bpl' [2023-10-12 17:27:00,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:27:00,283 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:27:00,284 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:27:00,284 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:27:00,284 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:27:00,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:00" (1/1) ... [2023-10-12 17:27:00,300 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:00" (1/1) ... [2023-10-12 17:27:00,304 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:27:00,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:27:00,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:27:00,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:27:00,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:27:00,313 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:00" (1/1) ... [2023-10-12 17:27:00,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:00" (1/1) ... [2023-10-12 17:27:00,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:00" (1/1) ... [2023-10-12 17:27:00,315 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:00" (1/1) ... [2023-10-12 17:27:00,317 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:00" (1/1) ... [2023-10-12 17:27:00,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:00" (1/1) ... [2023-10-12 17:27:00,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:00" (1/1) ... [2023-10-12 17:27:00,321 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:00" (1/1) ... [2023-10-12 17:27:00,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:27:00,323 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:27:00,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:27:00,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:27:00,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:00" (1/1) ... [2023-10-12 17:27:00,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:00,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:00,346 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:27:00,362 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:27:00,373 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:27:00,374 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:27:00,374 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:27:00,374 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:27:00,374 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:27:00,374 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:27:00,374 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:27:00,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:27:00,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:27:00,375 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:27:00,412 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:27:00,414 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:27:00,539 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:27:00,550 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:27:00,550 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:27:00,552 INFO L201 PluginConnector]: Adding new model inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:27:00 BoogieIcfgContainer [2023-10-12 17:27:00,552 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:27:00,555 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:27:00,556 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:27:00,559 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:27:00,559 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:27:00,559 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:27:00" (1/2) ... [2023-10-12 17:27:00,561 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c3f8925 and model type inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:27:00, skipping insertion in model container [2023-10-12 17:27:00,561 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:27:00,562 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:27:00" (2/2) ... [2023-10-12 17:27:00,572 INFO L332 chiAutomizerObserver]: Analyzing ICFG inc-subseq-array.wvr.bpl [2023-10-12 17:27:00,648 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:27:00,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 76 flow [2023-10-12 17:27:00,699 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:27:00,700 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:27:00,707 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:27:00,707 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 76 flow [2023-10-12 17:27:00,711 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 64 flow [2023-10-12 17:27:00,714 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:27:00,728 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 64 flow [2023-10-12 17:27:00,730 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 64 flow [2023-10-12 17:27:00,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 64 flow [2023-10-12 17:27:00,736 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:27:00,736 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:27:00,736 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:27:00,737 INFO L119 LiptonReduction]: Number of co-enabled transitions 124 [2023-10-12 17:27:01,181 INFO L134 LiptonReduction]: Checked pairs total: 166 [2023-10-12 17:27:01,182 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-10-12 17:27:01,193 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:27:01,193 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:27:01,193 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:27:01,193 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:27:01,193 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:27:01,194 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:27:01,194 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:27:01,194 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:27:01,194 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 places, 14 transitions, 40 flow [2023-10-12 17:27:01,197 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:27:01,197 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:27:01,197 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:27:01,198 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:27:01,200 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:27:01,201 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 places, 14 transitions, 40 flow [2023-10-12 17:27:01,203 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:27:01,204 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:27:01,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:27:01,204 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:27:01,207 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [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]true [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]true [2023-10-12 17:27:01,208 INFO L750 eck$LassoCheckResult]: Loop: 40#[L23, L57-1]true [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]true [2023-10-12 17:27:01,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:01,213 INFO L85 PathProgramCache]: Analyzing trace with hash 4272, now seen corresponding path program 1 times [2023-10-12 17:27:01,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:01,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698627615] [2023-10-12 17:27:01,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:01,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:01,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:01,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:01,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:01,315 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 1 times [2023-10-12 17:27:01,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:01,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771578360] [2023-10-12 17:27:01,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:01,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:01,322 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:01,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:01,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:01,327 INFO L85 PathProgramCache]: Analyzing trace with hash 132532, now seen corresponding path program 1 times [2023-10-12 17:27:01,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:01,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235345516] [2023-10-12 17:27:01,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:01,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:01,389 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:27:01,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:27:01,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235345516] [2023-10-12 17:27:01,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235345516] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:27:01,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:27:01,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:27:01,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8693608] [2023-10-12 17:27:01,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:27:01,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:27:01,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:27:01,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:27:01,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 14 transitions, 40 flow. 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:27:01,437 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:27:01,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:27:01,484 INFO L124 PetriNetUnfolderBase]: 35/70 cut-off events. [2023-10-12 17:27:01,484 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:27:01,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 70 events. 35/70 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 159 event pairs, 8 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 116. Up to 41 conditions per place. [2023-10-12 17:27:01,488 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 21 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-10-12 17:27:01,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 23 transitions, 113 flow [2023-10-12 17:27:01,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 23 transitions, 113 flow [2023-10-12 17:27:01,507 INFO L124 PetriNetUnfolderBase]: 35/70 cut-off events. [2023-10-12 17:27:01,507 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:27:01,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 70 events. 35/70 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 161 event pairs, 8 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 116. Up to 41 conditions per place. [2023-10-12 17:27:01,508 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 19 places, 23 transitions, 113 flow [2023-10-12 17:27:01,512 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 19 places, 23 transitions, 113 flow [2023-10-12 17:27:01,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:27:01,517 INFO L430 stractBuchiCegarLoop]: Abstraction has has 19 places, 23 transitions, 113 flow [2023-10-12 17:27:01,517 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:27:01,518 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 places, 23 transitions, 113 flow [2023-10-12 17:27:01,520 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:27:01,520 INFO L124 PetriNetUnfolderBase]: 2/10 cut-off events. [2023-10-12 17:27:01,520 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:27:01,521 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:27:01,521 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [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]true [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]true [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] 60#[L23, L39, L58]true [2023-10-12 17:27:01,522 INFO L750 eck$LassoCheckResult]: Loop: 60#[L23, L39, L58]true [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[] 63#[L23, L40, L58]true [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] 60#[L23, L39, L58]true [2023-10-12 17:27:01,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:01,522 INFO L85 PathProgramCache]: Analyzing trace with hash 132516, now seen corresponding path program 1 times [2023-10-12 17:27:01,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:01,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153726224] [2023-10-12 17:27:01,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:01,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:01,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:01,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:01,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:01,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:01,531 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 1 times [2023-10-12 17:27:01,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:01,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440682798] [2023-10-12 17:27:01,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:01,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:01,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:01,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:01,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:01,541 INFO L85 PathProgramCache]: Analyzing trace with hash 127350366, now seen corresponding path program 1 times [2023-10-12 17:27:01,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:01,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213850795] [2023-10-12 17:27:01,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:01,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:01,563 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:27:01,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:27:01,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213850795] [2023-10-12 17:27:01,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213850795] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:27:01,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:27:01,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:27:01,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642537645] [2023-10-12 17:27:01,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:27:01,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:27:01,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:27:01,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:27:01,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 23 transitions, 113 flow. 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:27:01,638 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:27:01,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:27:01,675 INFO L124 PetriNetUnfolderBase]: 32/67 cut-off events. [2023-10-12 17:27:01,675 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:27:01,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 67 events. 32/67 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 162 event pairs, 5 based on Foata normal form. 3/50 useless extension candidates. Maximal degree in co-relation 162. Up to 49 conditions per place. [2023-10-12 17:27:01,677 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 24 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-10-12 17:27:01,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 26 transitions, 180 flow [2023-10-12 17:27:01,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 26 transitions, 180 flow [2023-10-12 17:27:01,685 INFO L124 PetriNetUnfolderBase]: 32/67 cut-off events. [2023-10-12 17:27:01,685 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:27:01,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 67 events. 32/67 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 160 event pairs, 5 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 162. Up to 49 conditions per place. [2023-10-12 17:27:01,685 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 21 places, 26 transitions, 180 flow [2023-10-12 17:27:01,686 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 21 places, 26 transitions, 180 flow [2023-10-12 17:27:01,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:27:01,687 INFO L430 stractBuchiCegarLoop]: Abstraction has has 21 places, 26 transitions, 180 flow [2023-10-12 17:27:01,687 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:27:01,688 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 places, 26 transitions, 180 flow [2023-10-12 17:27:01,692 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:27:01,694 INFO L124 PetriNetUnfolderBase]: 6/16 cut-off events. [2023-10-12 17:27:01,696 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:27:01,696 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:27:01,702 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [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]true [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]true [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] 77#[L57-1, L25-1]true [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] 40#[L23, L57-1]true [2023-10-12 17:27:01,702 INFO L750 eck$LassoCheckResult]: Loop: 40#[L23, L57-1]true [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]true [2023-10-12 17:27:01,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:01,703 INFO L85 PathProgramCache]: Analyzing trace with hash 4108555, now seen corresponding path program 1 times [2023-10-12 17:27:01,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:01,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307850264] [2023-10-12 17:27:01,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:01,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:01,710 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:01,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:01,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:01,715 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 2 times [2023-10-12 17:27:01,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:01,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425769364] [2023-10-12 17:27:01,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:01,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:01,718 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:01,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:01,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:01,721 INFO L85 PathProgramCache]: Analyzing trace with hash 127365305, now seen corresponding path program 1 times [2023-10-12 17:27:01,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:01,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556531905] [2023-10-12 17:27:01,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:01,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:01,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:01,734 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:01,820 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:27:01,821 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:27:01,821 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:27:01,821 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:27:01,821 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:27:01,821 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:01,821 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:27:01,821 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:27:01,821 INFO L133 ssoRankerPreferences]: Filename of dumped script: inc-subseq-array.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:27:01,821 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:27:01,821 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:27:01,833 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:27:01,854 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:27:01,883 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:27:01,957 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:27:01,959 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:27:01,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:01,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:01,963 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:27:01,964 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:27:01,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:27:01,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:01,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:01,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:01,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:01,977 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:01,977 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:01,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:02,002 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:27:02,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:02,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:02,003 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:27:02,005 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:27:02,007 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:27:02,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:02,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:02,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:02,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:02,019 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:02,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:02,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:02,041 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:27:02,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:02,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:02,042 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:27:02,043 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:27:02,046 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:27:02,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:02,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:02,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:02,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:02,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:02,055 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:02,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:02,071 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:27:02,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:02,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:02,072 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:27:02,074 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:27:02,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:27:02,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:02,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:02,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:02,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:02,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:02,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:02,102 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:27:02,118 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:27:02,118 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:27:02,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:02,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:02,127 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:27:02,128 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:27:02,157 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:27:02,178 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:27:02,179 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:27:02,179 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:27:02,184 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:27:02,187 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:27:02,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:02,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:27:02,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:02,229 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:27:02,230 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:02,230 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:27:02,232 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:27:02,233 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 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:27:02,332 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 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) Result 5 states and 262 transitions. [2023-10-12 17:27:02,333 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:27:02,338 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:27:02,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:27:02,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 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:27:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2023-10-12 17:27:02,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:27:02,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:02,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:27:02,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:02,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:27:02,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:02,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 308 transitions, 2752 flow [2023-10-12 17:27:02,373 INFO L124 PetriNetUnfolderBase]: 99/172 cut-off events. [2023-10-12 17:27:02,373 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-10-12 17:27:02,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 172 events. 99/172 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 550 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 582. Up to 154 conditions per place. [2023-10-12 17:27:02,374 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 31 places, 308 transitions, 2752 flow [2023-10-12 17:27:02,378 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 31 places, 308 transitions, 2752 flow [2023-10-12 17:27:02,378 INFO L430 stractBuchiCegarLoop]: Abstraction has has 31 places, 308 transitions, 2752 flow [2023-10-12 17:27:02,378 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:27:02,378 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 places, 308 transitions, 2752 flow [2023-10-12 17:27:02,381 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:27:02,381 INFO L124 PetriNetUnfolderBase]: 8/22 cut-off events. [2023-10-12 17:27:02,381 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-10-12 17:27:02,381 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:27:02,383 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [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]true [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]true [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] 60#[L23, L39, L58]true [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[] 63#[L23, L40, L58]true [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] 126#[L40, L58, L25-1]true [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] 128#[L39, L58, L25-1]true [2023-10-12 17:27:02,383 INFO L750 eck$LassoCheckResult]: Loop: 128#[L39, L58, L25-1]true [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[] 126#[L40, L58, L25-1]true [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] 128#[L39, L58, L25-1]true [2023-10-12 17:27:02,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:02,383 INFO L85 PathProgramCache]: Analyzing trace with hash -347105971, now seen corresponding path program 1 times [2023-10-12 17:27:02,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:02,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371256474] [2023-10-12 17:27:02,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:02,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:02,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:02,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:02,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:02,411 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 2 times [2023-10-12 17:27:02,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:02,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051317776] [2023-10-12 17:27:02,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:02,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:02,424 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:02,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:02,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:02,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1438613447, now seen corresponding path program 2 times [2023-10-12 17:27:02,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:02,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211707521] [2023-10-12 17:27:02,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:02,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:02,485 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:27:02,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:27:02,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211707521] [2023-10-12 17:27:02,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211707521] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:27:02,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021393860] [2023-10-12 17:27:02,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:27:02,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:27:02,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:02,487 INFO L229 MonitoredProcess]: Starting monitored process 7 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:27:02,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-10-12 17:27:02,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:27:02,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:27:02,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:27:02,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:02,541 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:27:02,541 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:27:02,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021393860] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:27:02,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:27:02,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2023-10-12 17:27:02,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148210914] [2023-10-12 17:27:02,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:27:02,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:27:02,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:27:02,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:27:02,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 308 transitions, 2752 flow. 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:27:02,615 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:27:02,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:27:02,686 INFO L124 PetriNetUnfolderBase]: 215/386 cut-off events. [2023-10-12 17:27:02,687 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-10-12 17:27:02,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2013 conditions, 386 events. 215/386 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1532 event pairs, 0 based on Foata normal form. 15/238 useless extension candidates. Maximal degree in co-relation 1574. Up to 368 conditions per place. [2023-10-12 17:27:02,690 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 103 selfloop transitions, 36 changer transitions 22/161 dead transitions. [2023-10-12 17:27:02,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 161 transitions, 1718 flow [2023-10-12 17:27:02,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 161 transitions, 1718 flow [2023-10-12 17:27:02,714 INFO L124 PetriNetUnfolderBase]: 215/386 cut-off events. [2023-10-12 17:27:02,714 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-10-12 17:27:02,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2013 conditions, 386 events. 215/386 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1542 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 1574. Up to 368 conditions per place. [2023-10-12 17:27:02,715 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 31 places, 161 transitions, 1718 flow [2023-10-12 17:27:02,739 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 31 places, 161 transitions, 1718 flow [2023-10-12 17:27:02,744 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:27:02,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:27:02,746 INFO L430 stractBuchiCegarLoop]: Abstraction has has 31 places, 161 transitions, 1718 flow [2023-10-12 17:27:02,746 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:27:02,746 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 places, 161 transitions, 1718 flow [2023-10-12 17:27:02,753 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:27:02,754 INFO L124 PetriNetUnfolderBase]: 44/86 cut-off events. [2023-10-12 17:27:02,754 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:27:02,754 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:27:02,754 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [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]true [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]true [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] 77#[L57-1, L25-1]true [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] 40#[L23, L57-1]true [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] 77#[L57-1, L25-1]true [2023-10-12 17:27:02,754 INFO L750 eck$LassoCheckResult]: Loop: 77#[L57-1, L25-1]true [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] 40#[L23, L57-1]true [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] 77#[L57-1, L25-1]true [2023-10-12 17:27:02,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:02,755 INFO L85 PathProgramCache]: Analyzing trace with hash 127365304, now seen corresponding path program 2 times [2023-10-12 17:27:02,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:02,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319985210] [2023-10-12 17:27:02,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:02,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:02,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:02,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:02,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash 3974, now seen corresponding path program 1 times [2023-10-12 17:27:02,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:02,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346308514] [2023-10-12 17:27:02,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:02,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:02,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:02,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:02,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:02,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2138975869, now seen corresponding path program 3 times [2023-10-12 17:27:02,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:02,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869232858] [2023-10-12 17:27:02,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:02,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:02,808 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:02,813 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:02,929 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:27:02,929 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:27:02,929 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:27:02,929 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:27:02,929 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:27:02,930 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:02,930 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:27:02,930 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:27:02,930 INFO L133 ssoRankerPreferences]: Filename of dumped script: inc-subseq-array.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:27:02,930 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:27:02,930 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:27:02,931 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:27:02,933 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:27:02,935 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:27:03,077 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:27:03,077 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:27:03,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:03,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:03,079 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:27:03,081 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:27:03,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:27:03,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:03,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:03,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:03,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:03,090 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:03,090 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:03,105 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:03,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2023-10-12 17:27:03,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:03,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:03,112 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:27:03,112 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:27:03,117 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:27:03,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:03,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:03,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:03,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:03,125 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:03,125 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:03,137 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:03,145 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:27:03,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:03,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:03,147 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:27:03,149 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:27:03,150 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:27:03,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:03,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:03,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:03,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:03,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:03,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:03,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:03,180 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:27:03,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:03,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:03,182 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:27:03,184 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:27:03,186 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:27:03,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:03,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:03,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:03,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:03,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:03,200 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:03,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:03,229 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:27:03,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:03,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:03,230 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:27:03,233 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:27:03,235 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:27:03,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:03,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:03,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:03,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:03,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:03,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:03,264 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:27:03,275 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:27:03,276 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:27:03,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:03,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:03,277 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:27:03,279 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:27:03,281 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:27:03,298 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:27:03,298 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:27:03,298 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:27:03,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-10-12 17:27:03,306 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:27:03,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:03,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:27:03,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:03,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:27:03,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:03,336 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:27:03,337 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:27:03,337 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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:27:03,457 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. 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 7 states and 346 transitions. [2023-10-12 17:27:03,457 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:27:03,469 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:27:03,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:27:03,470 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:27:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2023-10-12 17:27:03,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:27:03,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:03,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:27:03,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:03,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:27:03,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:03,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:27:03,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-10-12 17:27:03,852 INFO L124 PetriNetUnfolderBase]: 869/1537 cut-off events. [2023-10-12 17:27:03,852 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2023-10-12 17:27:03,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9505 conditions, 1537 events. 869/1537 cut-off events. For 258/258 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 8813 event pairs, 1 based on Foata normal form. 0/889 useless extension candidates. Maximal degree in co-relation 7312. Up to 1519 conditions per place. [2023-10-12 17:27:03,854 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:27:03,889 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:27:03,889 INFO L430 stractBuchiCegarLoop]: Abstraction has has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:27:03,889 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:27:03,889 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:27:04,039 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:27:04,039 INFO L124 PetriNetUnfolderBase]: 314/528 cut-off events. [2023-10-12 17:27:04,039 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-10-12 17:27:04,040 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:27:04,041 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [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]true [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]true [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] 77#[L57-1, L25-1]true [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] 40#[L23, L57-1]true [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] 60#[L23, L39, L58]true [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] 128#[L39, L58, L25-1]true [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[] 126#[L40, L58, L25-1]true [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] 128#[L39, L58, L25-1]true [2023-10-12 17:27:04,041 INFO L750 eck$LassoCheckResult]: Loop: 128#[L39, L58, L25-1]true [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[] 126#[L40, L58, L25-1]true [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] 128#[L39, L58, L25-1]true [2023-10-12 17:27:04,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:04,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1883299860, now seen corresponding path program 1 times [2023-10-12 17:27:04,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:04,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273886433] [2023-10-12 17:27:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:04,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:04,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:04,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:04,069 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:04,069 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 3 times [2023-10-12 17:27:04,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:04,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817963031] [2023-10-12 17:27:04,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:04,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:04,073 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:04,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:04,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:04,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1669936334, now seen corresponding path program 2 times [2023-10-12 17:27:04,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:04,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062675523] [2023-10-12 17:27:04,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:04,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:04,096 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:04,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:04,340 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:27:04,341 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:27:04,341 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:27:04,341 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:27:04,341 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:27:04,341 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:04,341 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:27:04,341 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:27:04,341 INFO L133 ssoRankerPreferences]: Filename of dumped script: inc-subseq-array.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:27:04,341 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:27:04,341 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:27:04,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:27:04,345 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:27:04,347 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:27:04,351 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:27:04,353 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:27:04,355 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:27:04,651 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:27:04,651 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:27:04,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:04,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:04,652 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:27:04,655 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:27:04,656 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:27:04,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:04,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:04,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:04,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:04,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:04,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:04,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:04,682 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:27:04,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:04,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:04,683 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:27:04,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:27:04,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:27:04,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:04,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:04,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:04,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:04,705 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:04,705 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:04,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:04,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:27:04,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:04,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:04,734 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:27:04,738 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:27:04,740 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:27:04,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:04,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:04,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:04,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:04,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:04,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:04,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:04,769 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:27:04,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:04,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:04,770 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:27:04,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:27:04,776 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:27:04,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:04,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:04,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:04,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:04,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:04,784 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:04,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:04,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:27:04,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:04,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:04,806 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:27:04,810 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:27:04,811 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:27:04,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:04,817 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:04,817 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:04,817 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:04,818 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:04,818 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:04,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:04,831 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:27:04,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:04,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:04,833 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:27:04,835 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:27:04,836 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:27:04,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:04,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:04,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:04,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:04,845 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:04,845 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:04,857 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:27:04,866 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:27:04,866 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:27:04,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:04,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:04,868 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:27:04,873 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:27:04,873 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:27:04,880 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:27:04,880 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:27:04,880 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2023-10-12 17:27:04,885 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:27:04,896 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:27:04,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:04,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:27:04,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:04,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:27:04,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:04,935 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:27:04,935 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:27:04,935 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. 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:27:04,983 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. 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 6 states and 297 transitions. [2023-10-12 17:27:04,984 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:27:05,248 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:27:05,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:27:05,251 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:27:05,251 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:27:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:27:05,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:27:05,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:05,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:27:05,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:05,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:27:05,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:05,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:27:32,875 INFO L124 PetriNetUnfolderBase]: 2385/4234 cut-off events. [2023-10-12 17:27:32,875 INFO L125 PetriNetUnfolderBase]: For 881/881 co-relation queries the response was YES. [2023-10-12 17:27:32,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30349 conditions, 4234 events. 2385/4234 cut-off events. For 881/881 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 28803 event pairs, 4 based on Foata normal form. 0/2332 useless extension candidates. Maximal degree in co-relation 25718. Up to 4216 conditions per place. [2023-10-12 17:27:32,878 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:27:33,349 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:27:33,349 INFO L430 stractBuchiCegarLoop]: Abstraction has has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:27:33,349 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:27:33,349 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:27:52,912 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:27:52,913 INFO L124 PetriNetUnfolderBase]: 1856/3197 cut-off events. [2023-10-12 17:27:52,913 INFO L125 PetriNetUnfolderBase]: For 635/635 co-relation queries the response was YES. [2023-10-12 17:27:52,913 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:27:52,913 INFO L748 eck$LassoCheckResult]: Stem: 36#[$Ultimate##0]true [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]true [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]true [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] 60#[L23, L39, L58]true [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[] 63#[L23, L40, L58]true [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] 126#[L40, L58, L25-1]true [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] 63#[L23, L40, L58]true [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] 126#[L40, L58, L25-1]true [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] 63#[L23, L40, L58]true [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] 60#[L23, L39, L58]true [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] 60#[L23, L39, L58]true [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] 128#[L39, L58, L25-1]true [2023-10-12 17:27:52,913 INFO L750 eck$LassoCheckResult]: Loop: 128#[L39, L58, L25-1]true [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[] 126#[L40, L58, L25-1]true [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] 128#[L39, L58, L25-1]true [2023-10-12 17:27:52,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:52,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1982958041, now seen corresponding path program 1 times [2023-10-12 17:27:52,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:52,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064475642] [2023-10-12 17:27:52,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:52,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:52,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:52,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:52,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:52,926 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 4 times [2023-10-12 17:27:52,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:52,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524494422] [2023-10-12 17:27:52,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:52,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:52,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:52,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:52,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:52,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1342804513, now seen corresponding path program 2 times [2023-10-12 17:27:52,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:27:52,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633547456] [2023-10-12 17:27:52,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:27:52,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:27:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:52,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:27:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:27:52,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:27:53,218 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:27:53,218 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:27:53,218 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:27:53,218 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:27:53,218 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:27:53,218 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:53,218 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:27:53,218 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:27:53,219 INFO L133 ssoRankerPreferences]: Filename of dumped script: inc-subseq-array.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:27:53,219 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:27:53,219 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:27:53,223 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:27:53,226 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:27:53,227 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:27:53,229 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:27:53,231 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:27:53,234 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:27:53,544 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:27:53,544 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:27:53,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:53,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:53,545 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:27:53,547 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:27:53,553 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:27:53,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:53,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:53,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:53,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:53,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:53,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:53,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:53,578 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:27:53,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:53,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:53,579 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:27:53,581 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:27:53,583 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:27:53,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:53,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:53,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:53,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:53,590 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:53,590 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:53,605 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:53,608 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:27:53,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:53,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:53,610 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:27:53,612 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:27:53,613 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:27:53,619 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:53,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:53,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:53,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:53,620 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:53,620 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:53,636 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:53,639 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:27:53,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:53,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:53,640 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:27:53,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:27:53,643 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:27:53,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:53,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:53,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:53,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:53,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:53,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:53,666 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:53,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:27:53,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:53,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:53,670 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:27:53,677 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:27:53,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:53,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:53,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:53,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:53,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:53,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:53,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-10-12 17:27:53,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:53,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-10-12 17:27:53,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:53,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:53,712 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:27:53,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-10-12 17:27:53,716 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:27:53,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:53,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:53,722 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:27:53,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:53,747 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:27:53,747 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:27:53,790 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:27:53,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-10-12 17:27:53,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:53,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:53,795 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:27:53,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-10-12 17:27:53,797 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:27:53,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:27:53,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:27:53,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:27:53,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:27:53,805 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:27:53,805 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:27:53,815 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:27:53,821 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:27:53,821 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:27:53,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:27:53,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:27:53,822 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:27:53,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-10-12 17:27:53,826 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:27:53,832 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:27:53,832 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:27:53,832 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2023-10-12 17:27:53,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-10-12 17:27:53,841 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:27:53,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:53,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:27:53,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:53,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:27:53,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:53,889 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:27:53,889 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:27:53,889 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:27:53,942 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 6 states and 297 transitions. [2023-10-12 17:27:53,942 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:27:54,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-10-12 17:27:58,644 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:27:58,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:27:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:27:58,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:27:58,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:27:58,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:58,645 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:27:58,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:27:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:58,685 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:27:58,686 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:27:58,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:27:58,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:27:58,699 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:27:58,700 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:27:58,700 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:27:58,736 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 6 states and 301 transitions. [2023-10-12 17:27:58,736 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:28:03,106 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:28:03,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:28:03,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:28:03,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:28:03,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:28:03,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:03,108 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:28:03,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:28:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:28:03,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:28:03,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:28:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:28:03,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:28:03,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:28:03,154 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:28:03,155 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:28:03,155 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:28:03,194 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 6 states and 333 transitions. [2023-10-12 17:28:03,195 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:28:08,221 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:28:08,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:28:08,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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:28:08,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2023-10-12 17:28:08,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:28:08,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:08,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 13 letters. Loop has 2 letters. [2023-10-12 17:28:08,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:08,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 11 letters. Loop has 4 letters. [2023-10-12 17:28:08,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:28:08,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 494616 transitions, 8300928 flow Received shutdown request... [2023-10-12 17:31:05,759 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:31:05,759 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:31:05,935 WARN L144 chiPetriNetCegarLoop]: Unhandled de.uni_freiburg.informatik.ultimate.automata.AutomataOperationCanceledException: Timeout or canceled by user.occured during abstraction size reduction. Continuing with non-reduced net [2023-10-12 17:31:05,935 INFO L430 stractBuchiCegarLoop]: Abstraction has has 69 places, 494616 transitions, 8300928 flow [2023-10-12 17:31:05,935 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:31:05,935 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 69 places, 494616 transitions, 8300928 flow [2023-10-12 17:31:06,346 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:31:06,350 INFO L201 PluginConnector]: Adding new model inc-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:31:06 BoogieIcfgContainer [2023-10-12 17:31:06,350 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:31:06,351 INFO L158 Benchmark]: Toolchain (without parser) took 246067.46ms. Allocated memory was 184.5MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 135.2MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2023-10-12 17:31:06,351 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 184.5MB. Free memory was 136.4MB in the beginning and 136.2MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:31:06,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.92ms. Allocated memory is still 184.5MB. Free memory was 135.0MB in the beginning and 133.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:31:06,351 INFO L158 Benchmark]: Boogie Preprocessor took 15.89ms. Allocated memory is still 184.5MB. Free memory was 133.6MB in the beginning and 132.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:31:06,352 INFO L158 Benchmark]: RCFGBuilder took 229.00ms. Allocated memory is still 184.5MB. Free memory was 132.4MB in the beginning and 122.3MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:31:06,352 INFO L158 Benchmark]: BuchiAutomizer took 245795.12ms. Allocated memory was 184.5MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 122.2MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. [2023-10-12 17:31:06,353 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.22ms. Allocated memory is still 184.5MB. Free memory was 136.4MB in the beginning and 136.2MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.92ms. Allocated memory is still 184.5MB. Free memory was 135.0MB in the beginning and 133.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.89ms. Allocated memory is still 184.5MB. Free memory was 133.6MB in the beginning and 132.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 229.00ms. Allocated memory is still 184.5MB. Free memory was 132.4MB in the beginning and 122.3MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 245795.12ms. Allocated memory was 184.5MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 122.2MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 4.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 3 deterministic, 1 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function end + -1 * start and consists of 4 locations. One nondeterministic module has affine ranking function end + -1 * start and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 8300928 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 245.6s and 8 iterations. TraceHistogramMax:0. Analysis of lassos took 3.3s. Construction of modules took 0.2s. Büchi inclusion checks took 15.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. 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 [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 547 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 541 mSDsluCounter, 376 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 540 IncrementalHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 260 mSDtfsCounter, 540 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital95 mio100 ax100 hnf100 lsp93 ukn79 mio100 lsp61 div100 bol108 ite100 ukn100 eq184 hnf88 smp100 dnf140 smp83 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 79ms VariablesStem: 16 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing PetriNetUnfolderBuchi. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 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: 58, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 41, dependent conditional: 0, dependent unconditional: 41, 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 could not prove your program: Timeout Completed graceful shutdown [2023-10-12 17:31:06,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0