/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/dec-subseq-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:26:01,166 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:26:01,230 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:26:01,253 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:26:01,254 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:26:01,254 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:26:01,255 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:26:01,255 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:26:01,256 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:26:01,259 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:26:01,259 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:26:01,259 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:26:01,259 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:26:01,260 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:26:01,261 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:26:01,261 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:26:01,261 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:26:01,261 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:26:01,261 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:26:01,261 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:26:01,261 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:26:01,262 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:26:01,263 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:26:01,263 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:26:01,263 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:26:01,263 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:26:01,263 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:26:01,264 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:26:01,264 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:26:01,264 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:26:01,265 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:26:01,265 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:26:01,265 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:26:01,266 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:26:01,266 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:26:01,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:26:01,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:26:01,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:26:01,477 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:26:01,479 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:26:01,481 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/dec-subseq-array.wvr.bpl [2023-10-12 17:26:01,481 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dec-subseq-array.wvr.bpl' [2023-10-12 17:26:01,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:26:01,512 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:26:01,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:26:01,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:26:01,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:26:01,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:01" (1/1) ... [2023-10-12 17:26:01,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:01" (1/1) ... [2023-10-12 17:26:01,554 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:26:01,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:26:01,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:26:01,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:26:01,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:26:01,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:01" (1/1) ... [2023-10-12 17:26:01,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:01" (1/1) ... [2023-10-12 17:26:01,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:01" (1/1) ... [2023-10-12 17:26:01,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:01" (1/1) ... [2023-10-12 17:26:01,567 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:01" (1/1) ... [2023-10-12 17:26:01,569 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:01" (1/1) ... [2023-10-12 17:26:01,570 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:01" (1/1) ... [2023-10-12 17:26:01,571 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:01" (1/1) ... [2023-10-12 17:26:01,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:26:01,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:26:01,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:26:01,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:26:01,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:01" (1/1) ... [2023-10-12 17:26:01,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:01,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:01,603 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:26:01,610 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:26:01,628 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:26:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:26:01,629 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:26:01,629 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:26:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:26:01,629 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:26:01,629 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:26:01,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:26:01,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:26:01,630 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:26:01,664 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:26:01,666 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:26:01,812 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:26:01,821 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:26:01,821 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:26:01,823 INFO L201 PluginConnector]: Adding new model dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:26:01 BoogieIcfgContainer [2023-10-12 17:26:01,823 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:26:01,828 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:26:01,828 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:26:01,830 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:26:01,831 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:26:01,831 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:26:01" (1/2) ... [2023-10-12 17:26:01,832 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7d3ced78 and model type dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:26:01, skipping insertion in model container [2023-10-12 17:26:01,832 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:26:01,832 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:26:01" (2/2) ... [2023-10-12 17:26:01,833 INFO L332 chiAutomizerObserver]: Analyzing ICFG dec-subseq-array.wvr.bpl [2023-10-12 17:26:01,869 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-10-12 17:26:01,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 76 flow [2023-10-12 17:26:01,900 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:26:01,900 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:26:01,902 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:26:01,902 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 76 flow [2023-10-12 17:26:01,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 64 flow [2023-10-12 17:26:01,907 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:26:01,916 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 26 transitions, 64 flow [2023-10-12 17:26:01,917 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 26 transitions, 64 flow [2023-10-12 17:26:01,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 26 transitions, 64 flow [2023-10-12 17:26:01,923 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:26:01,923 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:26:01,923 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:26:01,924 INFO L119 LiptonReduction]: Number of co-enabled transitions 124 [2023-10-12 17:26:02,258 INFO L134 LiptonReduction]: Checked pairs total: 166 [2023-10-12 17:26:02,258 INFO L136 LiptonReduction]: Total number of compositions: 15 [2023-10-12 17:26:02,266 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:26:02,266 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:26:02,266 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:26:02,266 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:26:02,267 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:26:02,267 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:26:02,267 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:26:02,267 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:26:02,267 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 places, 14 transitions, 40 flow [2023-10-12 17:26:02,269 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:02,270 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:26:02,270 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:26:02,270 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:02,272 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:26:02,272 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 places, 14 transitions, 40 flow [2023-10-12 17:26:02,272 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:02,273 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:26:02,273 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:26:02,273 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:02,275 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:26:02,276 INFO L750 eck$LassoCheckResult]: Loop: 40#[L23, L57-1]true [100] L23-->L23: Formula: (and (< v_last_19 (select v_A_30 v_i_51)) (= v_i_50 (+ v_i_51 1)) (< 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:26:02,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:02,279 INFO L85 PathProgramCache]: Analyzing trace with hash 4272, now seen corresponding path program 1 times [2023-10-12 17:26:02,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:02,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495514010] [2023-10-12 17:26:02,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:02,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:02,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:02,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:02,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:02,347 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 1 times [2023-10-12 17:26:02,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:02,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576037281] [2023-10-12 17:26:02,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:02,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:02,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:02,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:02,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:02,358 INFO L85 PathProgramCache]: Analyzing trace with hash 132532, now seen corresponding path program 1 times [2023-10-12 17:26:02,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:02,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883572516] [2023-10-12 17:26:02,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:02,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:02,423 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:26:02,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:26:02,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883572516] [2023-10-12 17:26:02,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883572516] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:26:02,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:26:02,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:26:02,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699075103] [2023-10-12 17:26:02,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:26:02,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:26:02,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:26:02,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:26:02,464 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:26:02,464 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:26:02,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:26:02,508 INFO L124 PetriNetUnfolderBase]: 35/70 cut-off events. [2023-10-12 17:26:02,508 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:26:02,509 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:26:02,510 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 21 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-10-12 17:26:02,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 23 transitions, 113 flow [2023-10-12 17:26:02,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 23 transitions, 113 flow [2023-10-12 17:26:02,518 INFO L124 PetriNetUnfolderBase]: 35/70 cut-off events. [2023-10-12 17:26:02,518 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:26:02,518 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:26:02,518 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 19 places, 23 transitions, 113 flow [2023-10-12 17:26:02,520 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 19 places, 23 transitions, 113 flow [2023-10-12 17:26:02,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:26:02,524 INFO L430 stractBuchiCegarLoop]: Abstraction has has 19 places, 23 transitions, 113 flow [2023-10-12 17:26:02,524 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:26:02,524 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19 places, 23 transitions, 113 flow [2023-10-12 17:26:02,526 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:02,526 INFO L124 PetriNetUnfolderBase]: 2/10 cut-off events. [2023-10-12 17:26:02,526 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:26:02,526 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:02,526 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:26:02,527 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)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) 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:26:02,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:02,527 INFO L85 PathProgramCache]: Analyzing trace with hash 132516, now seen corresponding path program 1 times [2023-10-12 17:26:02,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:02,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212974869] [2023-10-12 17:26:02,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:02,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:02,531 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:02,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:02,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:02,534 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 1 times [2023-10-12 17:26:02,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:02,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459943060] [2023-10-12 17:26:02,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:02,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:02,538 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:02,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:02,543 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:02,543 INFO L85 PathProgramCache]: Analyzing trace with hash 127350366, now seen corresponding path program 1 times [2023-10-12 17:26:02,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:02,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982238436] [2023-10-12 17:26:02,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:02,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:02,564 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:26:02,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:26:02,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982238436] [2023-10-12 17:26:02,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982238436] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:26:02,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:26:02,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-10-12 17:26:02,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901553595] [2023-10-12 17:26:02,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:26:02,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:26:02,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-10-12 17:26:02,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-10-12 17:26:02,637 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:26:02,637 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:26:02,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:26:02,661 INFO L124 PetriNetUnfolderBase]: 32/67 cut-off events. [2023-10-12 17:26:02,661 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:26:02,662 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:26:02,662 INFO L140 encePairwiseOnDemand]: 42/45 looper letters, 24 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-10-12 17:26:02,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 26 transitions, 180 flow [2023-10-12 17:26:02,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 26 transitions, 180 flow [2023-10-12 17:26:02,667 INFO L124 PetriNetUnfolderBase]: 32/67 cut-off events. [2023-10-12 17:26:02,667 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:26:02,668 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:26:02,668 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 21 places, 26 transitions, 180 flow [2023-10-12 17:26:02,668 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 21 places, 26 transitions, 180 flow [2023-10-12 17:26:02,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-10-12 17:26:02,669 INFO L430 stractBuchiCegarLoop]: Abstraction has has 21 places, 26 transitions, 180 flow [2023-10-12 17:26:02,669 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:26:02,669 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 places, 26 transitions, 180 flow [2023-10-12 17:26:02,671 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:02,671 INFO L124 PetriNetUnfolderBase]: 6/16 cut-off events. [2023-10-12 17:26:02,671 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:26:02,671 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:02,672 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) (<= .cse0 v_last_17))) 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:26:02,672 INFO L750 eck$LassoCheckResult]: Loop: 40#[L23, L57-1]true [100] L23-->L23: Formula: (and (< v_last_19 (select v_A_30 v_i_51)) (= v_i_50 (+ v_i_51 1)) (< 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:26:02,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:02,672 INFO L85 PathProgramCache]: Analyzing trace with hash 4108555, now seen corresponding path program 1 times [2023-10-12 17:26:02,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:02,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8706590] [2023-10-12 17:26:02,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:02,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:02,678 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:02,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:02,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:02,683 INFO L85 PathProgramCache]: Analyzing trace with hash 131, now seen corresponding path program 2 times [2023-10-12 17:26:02,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:02,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374882919] [2023-10-12 17:26:02,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:02,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:02,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:02,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:02,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:02,688 INFO L85 PathProgramCache]: Analyzing trace with hash 127365305, now seen corresponding path program 1 times [2023-10-12 17:26:02,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:02,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029721353] [2023-10-12 17:26:02,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:02,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:02,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:02,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:02,789 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:26:02,789 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:26:02,789 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:26:02,790 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:26:02,790 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:26:02,790 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:02,790 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:26:02,790 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:26:02,790 INFO L133 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:26:02,790 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:26:02,790 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:26:02,801 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:26:02,807 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:26:02,834 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:26:02,905 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:26:02,908 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:26:02,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:02,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:02,925 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:26:02,928 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:26:02,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:02,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:02,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:02,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:02,937 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:02,937 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:02,942 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:26:02,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:02,988 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:26:02,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:02,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:02,992 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:26:03,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:26:03,006 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:26:03,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:03,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:03,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:03,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:03,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:03,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:03,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:03,039 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:26:03,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:03,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:03,040 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:26: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:26:03,086 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:26:03,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:03,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:03,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:03,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:03,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:03,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:03,109 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:03,139 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:26:03,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:03,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:03,141 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:26:03,165 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:26:03,167 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:26:03,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:03,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:03,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:03,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:03,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:03,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:03,191 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:26:03,198 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:26:03,198 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:26:03,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:03,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:03,201 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:26:03,202 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:26:03,203 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:26:03,233 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:26:03,233 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:26:03,233 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:26:03,255 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:26:03,257 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:26:03,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:03,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:26:03,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:03,292 WARN L260 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:26:03,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:03,292 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:26:03,294 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:26:03,295 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:26:03,385 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:26:03,386 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:26:03,390 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:26:03,391 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:26:03,392 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:26:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2023-10-12 17:26:03,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:26:03,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:03,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:26:03,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:03,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 180 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:26:03,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:03,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 308 transitions, 2752 flow [2023-10-12 17:26:03,439 INFO L124 PetriNetUnfolderBase]: 99/172 cut-off events. [2023-10-12 17:26:03,439 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-10-12 17:26:03,440 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:26:03,440 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 31 places, 308 transitions, 2752 flow [2023-10-12 17:26:03,443 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 31 places, 308 transitions, 2752 flow [2023-10-12 17:26:03,443 INFO L430 stractBuchiCegarLoop]: Abstraction has has 31 places, 308 transitions, 2752 flow [2023-10-12 17:26:03,443 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:26:03,443 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 places, 308 transitions, 2752 flow [2023-10-12 17:26:03,444 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:26:03,446 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:03,446 INFO L124 PetriNetUnfolderBase]: 8/22 cut-off events. [2023-10-12 17:26:03,446 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-10-12 17:26:03,447 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:03,447 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) (<= .cse0 v_last_17))) 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)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) 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:26:03,447 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)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) 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:26:03,447 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:03,447 INFO L85 PathProgramCache]: Analyzing trace with hash -347105971, now seen corresponding path program 1 times [2023-10-12 17:26:03,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:03,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254629669] [2023-10-12 17:26:03,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:03,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:03,455 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:03,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:03,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:03,461 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 2 times [2023-10-12 17:26:03,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:03,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694886434] [2023-10-12 17:26:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:03,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:03,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:03,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:03,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:03,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1438613447, now seen corresponding path program 2 times [2023-10-12 17:26:03,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:03,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529861667] [2023-10-12 17:26:03,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:03,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:03,501 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:26:03,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:26:03,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529861667] [2023-10-12 17:26:03,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529861667] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:26:03,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178048372] [2023-10-12 17:26:03,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-10-12 17:26:03,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:26:03,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:03,517 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:26:03,530 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:26:03,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-10-12 17:26:03,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-10-12 17:26:03,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:26:03,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:03,583 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:26:03,583 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-10-12 17:26:03,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178048372] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:26:03,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-10-12 17:26:03,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2023-10-12 17:26:03,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005181126] [2023-10-12 17:26:03,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:26:03,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:26:03,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-10-12 17:26:03,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-10-12 17:26:03,657 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:26:03,657 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:26:03,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:26:03,713 INFO L124 PetriNetUnfolderBase]: 215/386 cut-off events. [2023-10-12 17:26:03,713 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-10-12 17:26:03,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 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:26:03,716 INFO L140 encePairwiseOnDemand]: 41/45 looper letters, 103 selfloop transitions, 36 changer transitions 22/161 dead transitions. [2023-10-12 17:26:03,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 161 transitions, 1718 flow [2023-10-12 17:26:03,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 161 transitions, 1718 flow [2023-10-12 17:26:03,736 INFO L124 PetriNetUnfolderBase]: 215/386 cut-off events. [2023-10-12 17:26:03,737 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-10-12 17:26:03,737 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:26:03,737 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 31 places, 161 transitions, 1718 flow [2023-10-12 17:26:03,739 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 31 places, 161 transitions, 1718 flow [2023-10-12 17:26:03,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-10-12 17:26:03,740 INFO L430 stractBuchiCegarLoop]: Abstraction has has 31 places, 161 transitions, 1718 flow [2023-10-12 17:26:03,740 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:26:03,740 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 places, 161 transitions, 1718 flow [2023-10-12 17:26:03,746 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:03,746 INFO L124 PetriNetUnfolderBase]: 44/86 cut-off events. [2023-10-12 17:26:03,746 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-10-12 17:26:03,746 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:03,746 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) (<= .cse0 v_last_17))) 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) (<= .cse0 v_last_17))) 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:26:03,746 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) (<= .cse0 v_last_17))) 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:26:03,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:03,747 INFO L85 PathProgramCache]: Analyzing trace with hash 127365304, now seen corresponding path program 2 times [2023-10-12 17:26:03,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:03,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348233193] [2023-10-12 17:26:03,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:03,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:03,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:03,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:03,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:03,756 INFO L85 PathProgramCache]: Analyzing trace with hash 3974, now seen corresponding path program 1 times [2023-10-12 17:26:03,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:03,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104899597] [2023-10-12 17:26:03,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:03,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:03,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:03,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:03,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:03,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:03,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2138975869, now seen corresponding path program 3 times [2023-10-12 17:26:03,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:03,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948596523] [2023-10-12 17:26:03,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:03,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:03,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:03,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:03,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:03,882 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:26:03,882 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:26:03,882 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:26:03,882 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:26:03,882 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:26:03,882 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:03,882 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:26:03,882 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:26:03,882 INFO L133 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:26:03,883 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:26:03,883 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:26:03,884 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:26:03,885 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:26:03,887 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:26:04,028 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:26:04,028 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:26:04,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:04,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:04,029 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:26:04,031 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:26:04,033 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:26:04,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:04,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:04,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:04,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:04,041 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:04,041 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:04,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:04,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-10-12 17:26:04,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:04,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:04,066 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:26:04,068 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:26:04,070 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:26:04,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:04,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:04,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:04,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:04,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:04,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:04,085 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:04,090 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:26:04,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:04,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:04,092 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:26:04,093 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:26:04,095 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:26:04,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:04,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:04,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:04,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:04,112 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:04,112 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:04,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:04,127 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:26:04,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:04,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:04,130 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:26:04,162 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:26:04,164 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:26:04,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:04,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:04,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:04,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:04,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:04,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:04,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:04,192 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:26:04,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:04,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:04,193 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:26:04,209 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:26:04,210 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:26:04,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:04,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:04,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:04,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:04,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:04,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:04,232 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:26:04,241 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:26:04,241 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:26:04,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:04,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:04,273 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:26:04,274 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:26:04,274 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:26:04,308 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:26:04,309 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:26:04,309 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2023-10-12 17:26:04,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:26:04,317 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:26:04,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:04,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:26:04,332 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:04,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:26:04,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:04,346 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:26:04,347 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:26:04,347 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:26:04,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:26:04,493 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:26:04,493 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:26:04,504 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:26:04,504 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:26:04,504 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:26:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 225 transitions. [2023-10-12 17:26:04,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:26:04,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:04,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:26:04,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:04,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 225 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:26:04,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:04,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:26:04,896 INFO L124 PetriNetUnfolderBase]: 869/1537 cut-off events. [2023-10-12 17:26:04,896 INFO L125 PetriNetUnfolderBase]: For 258/258 co-relation queries the response was YES. [2023-10-12 17:26:04,898 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:26:04,898 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:26:04,925 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:26:04,926 INFO L430 stractBuchiCegarLoop]: Abstraction has has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:26:04,926 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:26:04,926 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 places, 2486 transitions, 31560 flow [2023-10-12 17:26:05,048 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:05,049 INFO L124 PetriNetUnfolderBase]: 314/528 cut-off events. [2023-10-12 17:26:05,049 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-10-12 17:26:05,049 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:05,049 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) (<= .cse0 v_last_17))) 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) (<= .cse0 v_last_17))) 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)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) 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:26:05,049 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)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) 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:26:05,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:05,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1883299860, now seen corresponding path program 1 times [2023-10-12 17:26:05,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:05,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107489941] [2023-10-12 17:26:05,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:05,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:05,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:05,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:05,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:05,062 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 3 times [2023-10-12 17:26:05,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:05,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549295546] [2023-10-12 17:26:05,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:05,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:05,064 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:05,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:05,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:05,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1669936334, now seen corresponding path program 2 times [2023-10-12 17:26:05,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:05,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682766018] [2023-10-12 17:26:05,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:05,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:05,071 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:05,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:05,318 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:26:05,319 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:26:05,319 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:26:05,319 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:26:05,319 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:26:05,319 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:05,319 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:26:05,319 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:26:05,319 INFO L133 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_BEv2_Iteration6_Lasso [2023-10-12 17:26:05,319 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:26:05,319 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:26:05,321 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:26:05,323 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:26:05,325 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:26:05,329 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:26:05,331 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:26:05,332 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:26:05,548 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:26:05,548 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:26:05,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:05,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:05,549 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:26:05,552 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:26:05,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:26:05,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:05,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:05,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:05,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:05,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:05,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:05,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:05,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-10-12 17:26:05,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:05,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:05,581 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:26:05,595 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:26:05,595 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:26:05,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:05,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:05,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:05,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:05,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:05,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:05,618 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:05,622 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:26:05,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:05,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:05,623 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:26:05,625 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:26:05,626 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:26:05,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:05,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:05,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:05,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:05,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:05,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:05,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:05,657 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:26:05,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:05,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:05,658 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:26:05,660 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:26:05,661 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:26:05,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:05,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:05,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:05,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:05,668 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:05,668 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:05,682 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:05,694 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:26:05,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:05,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:05,695 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:26:05,716 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:26:05,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:26:05,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:05,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:05,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:05,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:05,723 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:05,723 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:05,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:05,744 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:26:05,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:05,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:05,746 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:26:05,747 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:26:05,749 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:26:05,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:05,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:05,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:05,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:05,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:05,757 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:05,773 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:26:05,780 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:26:05,780 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:26:05,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:05,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:05,781 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:26:05,794 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:26:05,800 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:26:05,801 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:26:05,801 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2023-10-12 17:26:05,806 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:26:05,807 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:26:05,808 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:26:05,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:05,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:26:05,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:05,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:26:05,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:05,853 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:26:05,853 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:26:05,854 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:26:05,897 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:26:05,897 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:26:06,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2023-10-12 17:26:06,168 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:26:06,169 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:26:06,170 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:26:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:26:06,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:26:06,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:06,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:26:06,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:06,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:26:06,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:06,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:26:28,677 INFO L124 PetriNetUnfolderBase]: 2385/4234 cut-off events. [2023-10-12 17:26:28,677 INFO L125 PetriNetUnfolderBase]: For 881/881 co-relation queries the response was YES. [2023-10-12 17:26:28,680 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:26:28,680 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:26:29,066 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:26:29,066 INFO L430 stractBuchiCegarLoop]: Abstraction has has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:26:29,066 INFO L337 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-10-12 17:26:29,066 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 places, 32796 transitions, 483336 flow [2023-10-12 17:26:47,032 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:26:47,032 INFO L124 PetriNetUnfolderBase]: 1856/3197 cut-off events. [2023-10-12 17:26:47,032 INFO L125 PetriNetUnfolderBase]: For 635/635 co-relation queries the response was YES. [2023-10-12 17:26:47,032 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:26:47,033 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) (<= .cse0 v_last_17))) 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) (<= .cse0 v_last_17))) 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)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) 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_last_19 (select v_A_30 v_i_51)) (= v_i_50 (+ v_i_51 1)) (< 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) (<= .cse0 v_last_17))) 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:26:47,033 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)) (or (and v_ok_22 v_ok_21 (<= v_new_18 v_v_old_15)) (and (not v_ok_21) (or (< v_v_old_15 v_new_18) (not v_ok_22)))) (= v_v_old_14 v_new_18)) 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:26:47,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:47,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1982958041, now seen corresponding path program 1 times [2023-10-12 17:26:47,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:47,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980596695] [2023-10-12 17:26:47,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:47,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:47,041 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:47,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:47,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:47,047 INFO L85 PathProgramCache]: Analyzing trace with hash 3451, now seen corresponding path program 4 times [2023-10-12 17:26:47,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:47,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084208517] [2023-10-12 17:26:47,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:47,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:47,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:47,049 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:47,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:47,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:47,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1342804513, now seen corresponding path program 2 times [2023-10-12 17:26:47,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:26:47,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760809083] [2023-10-12 17:26:47,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:26:47,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:26:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:47,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:26:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:26:47,065 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:26:47,339 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:26:47,339 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:26:47,339 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:26:47,339 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:26:47,339 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:26:47,339 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:47,339 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:26:47,339 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:26:47,339 INFO L133 ssoRankerPreferences]: Filename of dumped script: dec-subseq-array.wvr.bpl_BEv2_Iteration7_Lasso [2023-10-12 17:26:47,339 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:26:47,339 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:26:47,341 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:26:47,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:26:47,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:26:47,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:26:47,349 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:26:47,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:26:47,664 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:26:47,664 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:26:47,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:47,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:47,669 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:26:47,671 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:26:47,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:26:47,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:47,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:47,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:47,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:47,683 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:47,683 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:47,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:47,701 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:26:47,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:47,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:47,702 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:26:47,703 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:26:47,706 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:26:47,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:47,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:47,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:47,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:47,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:47,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:47,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:47,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2023-10-12 17:26:47,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:47,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:47,728 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:26:47,729 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:26:47,731 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:26:47,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:47,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:47,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:47,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:47,739 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:47,739 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:47,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:47,750 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:26:47,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:47,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:47,751 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:26:47,752 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:26:47,755 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:26:47,760 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:47,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:47,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:47,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:47,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:47,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:47,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:47,768 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:26:47,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:47,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:47,769 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:26:47,771 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:26:47,772 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:26:47,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:47,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:47,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:47,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:47,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:47,779 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:47,789 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:47,803 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:26:47,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:47,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:47,804 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:26:47,806 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:26:47,807 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:26:47,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:47,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:47,813 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:26:47,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:47,837 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:26:47,837 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:26:47,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:26:47,884 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:26:47,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:47,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:47,893 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:26:47,897 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:26:47,897 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:26:47,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:26:47,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:26:47,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:26:47,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:26:47,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:26:47,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:26:47,920 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:26:47,926 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:26:47,926 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2023-10-12 17:26:47,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:26:47,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:26:47,941 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:26:47,943 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:26:47,947 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:26:47,978 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:26:47,978 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:26:47,978 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2023-10-12 17:26:47,993 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:26:47,998 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:26:48,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:48,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:26:48,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:48,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:26:48,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:48,030 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:26:48,031 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:26:48,031 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:26:48,073 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:26:48,073 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:26:48,583 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:26:52,871 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:26:52,872 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:26:52,872 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:26:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:26:52,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:26:52,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:52,873 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:26:52,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:52,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:26:52,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:52,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:26:52,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:52,928 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:26:52,928 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:26:52,928 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:26:52,963 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:26:52,963 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:26:57,439 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:26:57,440 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:26:57,443 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:26:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2023-10-12 17:26:57,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 174 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:26:57,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:26:57,444 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-10-12 17:26:57,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:26:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:57,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:26:57,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:57,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:26:57,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:26:57,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:26:57,484 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:26:57,485 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:26:57,485 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:26:57,551 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:26:57,551 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:27:02,663 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:27:02,663 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,664 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:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2023-10-12 17:27:02,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 11 letters. Loop has 2 letters. [2023-10-12 17:27:02,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:02,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 13 letters. Loop has 2 letters. [2023-10-12 17:27:02,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:02,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 175 transitions. Stem has 11 letters. Loop has 4 letters. [2023-10-12 17:27:02,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:27:02,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 494616 transitions, 8300928 flow Received shutdown request... [2023-10-12 17:30:15,916 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:30:15,952 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:30:15,973 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:30:15,974 INFO L430 stractBuchiCegarLoop]: Abstraction has has 69 places, 494616 transitions, 8300928 flow [2023-10-12 17:30:15,974 INFO L337 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-10-12 17:30:15,974 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 69 places, 494616 transitions, 8300928 flow [2023-10-12 17:30:16,402 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:30:16,406 INFO L201 PluginConnector]: Adding new model dec-subseq-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:30:16 BoogieIcfgContainer [2023-10-12 17:30:16,406 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:30:16,407 INFO L158 Benchmark]: Toolchain (without parser) took 254894.35ms. Allocated memory was 209.7MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 160.8MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 6.6GB. Max. memory is 8.0GB. [2023-10-12 17:30:16,408 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 209.7MB. Free memory was 162.0MB in the beginning and 161.8MB in the end (delta: 155.2kB). There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:30:16,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.57ms. Allocated memory is still 209.7MB. Free memory was 160.6MB in the beginning and 159.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:30:16,410 INFO L158 Benchmark]: Boogie Preprocessor took 15.54ms. Allocated memory is still 209.7MB. Free memory was 159.2MB in the beginning and 158.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:30:16,410 INFO L158 Benchmark]: RCFGBuilder took 250.96ms. Allocated memory is still 209.7MB. Free memory was 158.1MB in the beginning and 180.5MB in the end (delta: -22.4MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. [2023-10-12 17:30:16,411 INFO L158 Benchmark]: BuchiAutomizer took 254578.49ms. Allocated memory was 209.7MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 180.2MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 6.6GB. Max. memory is 8.0GB. [2023-10-12 17:30:16,437 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.18ms. Allocated memory is still 209.7MB. Free memory was 162.0MB in the beginning and 161.8MB in the end (delta: 155.2kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.57ms. Allocated memory is still 209.7MB. Free memory was 160.6MB in the beginning and 159.2MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.54ms. Allocated memory is still 209.7MB. Free memory was 159.2MB in the beginning and 158.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 250.96ms. Allocated memory is still 209.7MB. Free memory was 158.1MB in the beginning and 180.5MB in the end (delta: -22.4MB). Peak memory consumption was 14.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 254578.49ms. Allocated memory was 209.7MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 180.2MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 6.6GB. 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 254.5s and 8 iterations. TraceHistogramMax:0. Analysis of lassos took 3.3s. Construction of modules took 0.2s. Büchi inclusion checks took 15.2s. 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: 75ms 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.3s - 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.3s, 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: 30, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 19, dependent conditional: 0, dependent unconditional: 19, 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 [2023-10-12 17:30:16,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 Completed graceful shutdown